About the Execution of ITS-Tools for GPUForwardProgress-PT-36b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1251645.00 | 0.00 | 0.00 | FFFFTFFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008000516.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 GPUForwardProgress-PT-36b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008000516
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 4.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K 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 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 179K 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 GPUForwardProgress-PT-36b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748985899404
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-36b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 21:25:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 21:25:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 21:25:02] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2025-06-03 21:25:02] [INFO ] Transformed 720 places.
[2025-06-03 21:25:02] [INFO ] Transformed 757 transitions.
[2025-06-03 21:25:02] [INFO ] Found NUPN structural information;
[2025-06-03 21:25:02] [INFO ] Parsed PT model containing 720 places and 757 transitions and 1877 arcs in 510 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 720 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 720/720 places, 757/757 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 719 transition count 757
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 71 place count 649 transition count 687
Iterating global reduction 1 with 70 rules applied. Total rules applied 141 place count 649 transition count 687
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 176 place count 614 transition count 652
Iterating global reduction 1 with 35 rules applied. Total rules applied 211 place count 614 transition count 652
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 243 place count 614 transition count 620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 244 place count 613 transition count 619
Iterating global reduction 2 with 1 rules applied. Total rules applied 245 place count 613 transition count 619
Applied a total of 245 rules in 435 ms. Remains 613 /720 variables (removed 107) and now considering 619/757 (removed 138) transitions.
// Phase 1: matrix 619 rows 613 cols
[2025-06-03 21:25:03] [INFO ] Computed 37 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:25:04] [INFO ] Implicit Places using invariants in 696 ms returned []
[2025-06-03 21:25:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:25:05] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 2139 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2025-06-03 21:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 2.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 3.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 3.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 5.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 6.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 6.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 8.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 9.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 8.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 10.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 12.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 13.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1232 variables, and 37 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30050 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/613 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (OVERLAPS) 619/1231 variables, 612/649 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1231 variables, 618/1267 constraints. Problems are: Problem set: 0 solved, 618 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 1231/1232 variables, and 1267 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 612/613 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60491ms
Starting structural reductions in LTL mode, iteration 1 : 613/720 places, 619/757 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63104 ms. Remains : 613/720 places, 619/757 transitions.
Support contains 43 out of 613 places after structural reductions.
[2025-06-03 21:26:06] [INFO ] Flatten gal took : 148 ms
[2025-06-03 21:26:06] [INFO ] Flatten gal took : 77 ms
[2025-06-03 21:26:06] [INFO ] Input system was already deterministic with 619 transitions.
RANDOM walk for 40000 steps (129 resets) in 3737 ms. (10 steps per ms) remains 17/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
[2025-06-03 21:26:08] [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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 203/220 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 392/612 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 619/1231 variables, 612/649 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1231 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/1232 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1232 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/1232 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 650 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1766 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 203/220 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 392/612 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 619/1231 variables, 612/649 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1231 variables, 17/666 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1231 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/1232 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1232 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/1232 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
After SMT solving in domain Int declared 1232/1232 variables, and 667 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5008 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6789ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 8 different solutions.
Finished Parikh walk after 410 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=205 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 17 properties in 667 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 118 stabilizing places and 118 stable transitions
Graph (complete) has 952 edges and 613 vertex of which 573 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.22 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&(p2||X(p3)))))'
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 610
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 610
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 604 transition count 608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 603 transition count 607
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 603 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 603 transition count 606
Applied a total of 23 rules in 106 ms. Remains 603 /613 variables (removed 10) and now considering 606/619 (removed 13) transitions.
// Phase 1: matrix 606 rows 603 cols
[2025-06-03 21:26:16] [INFO ] Computed 37 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:26:16] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-06-03 21:26:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:26:17] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2025-06-03 21:26: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/602 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
SMT process timed out in 30195ms, After SMT, problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 30199ms
Starting structural reductions in LTL mode, iteration 1 : 603/613 places, 606/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31480 ms. Remains : 603/613 places, 606/619 transitions.
Stuttering acceptance computed with spot in 485 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-01 finished in 32084 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 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Graph (trivial) has 502 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 946 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 299 transitions
Trivial Post-agglo rules discarded 299 transitions
Performed 299 trivial Post agglomeration. Transition count delta: 299
Iterating post reduction 0 with 299 rules applied. Total rules applied 301 place count 567 transition count 310
Reduce places removed 299 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 305 rules applied. Total rules applied 606 place count 268 transition count 304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 608 place count 266 transition count 304
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 608 place count 266 transition count 230
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 756 place count 192 transition count 230
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 790 place count 158 transition count 196
Iterating global reduction 3 with 34 rules applied. Total rules applied 824 place count 158 transition count 196
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 1040 place count 50 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1041 place count 50 transition count 87
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 1075 place count 16 transition count 20
Iterating global reduction 4 with 34 rules applied. Total rules applied 1109 place count 16 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1113 place count 14 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1114 place count 14 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1115 place count 13 transition count 18
Applied a total of 1115 rules in 129 ms. Remains 13 /613 variables (removed 600) and now considering 18/619 (removed 601) transitions.
[2025-06-03 21:26:48] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
// Phase 1: matrix 16 rows 13 cols
[2025-06-03 21:26:48] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:26:48] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-03 21:26:48] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
[2025-06-03 21:26:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:26:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 21:26:48] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 21:26:48] [INFO ] Redundant transitions in 21 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 21:26:48] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
[2025-06-03 21:26:48] [INFO ] Invariant cache hit.
[2025-06-03 21:26:48] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/26 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/29 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 14 constraints, problems are : Problem set: 0 solved, 16 unsolved in 289 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/26 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2/28 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/29 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/29 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 30 constraints, problems are : Problem set: 0 solved, 16 unsolved in 369 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 668ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 668ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/613 places, 18/619 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 898 ms. Remains : 13/613 places, 18/619 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-03
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-03 finished in 959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||(X(X(p2))&&F(!p0))||X(X(G(p2)))))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 603 transition count 609
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 603 transition count 609
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 603 transition count 607
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 601 transition count 605
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 601 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 601 transition count 603
Applied a total of 28 rules in 96 ms. Remains 601 /613 variables (removed 12) and now considering 603/619 (removed 16) transitions.
// Phase 1: matrix 603 rows 601 cols
[2025-06-03 21:26:49] [INFO ] Computed 37 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:26:49] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-06-03 21:26:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:26:50] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2025-06-03 21:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1203/1204 variables, and 637 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1203 variables, 602/1239 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1203/1204 variables, and 1239 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Starting structural reductions in LTL mode, iteration 1 : 601/613 places, 603/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61373 ms. Remains : 601/613 places, 603/619 transitions.
Stuttering acceptance computed with spot in 495 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 358 ms.
Product exploration explored 100000 steps with 33333 reset in 273 ms.
Computed a total of 112 stabilizing places and 112 stable transitions
Graph (complete) has 936 edges and 601 vertex of which 561 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.11 ms
Computed a total of 112 stabilizing places and 112 stable transitions
Detected a total of 112/601 stabilizing places and 112/603 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 38 ms. Reduced automaton from 11 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-36b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-04 finished in 62606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1&&X((p0||X(X(p2))))))))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 603 transition count 609
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 603 transition count 609
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 603 transition count 607
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 601 transition count 605
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 601 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 601 transition count 603
Applied a total of 28 rules in 54 ms. Remains 601 /613 variables (removed 12) and now considering 603/619 (removed 16) transitions.
// Phase 1: matrix 603 rows 601 cols
[2025-06-03 21:27:52] [INFO ] Computed 37 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:27:52] [INFO ] Implicit Places using invariants in 315 ms returned []
[2025-06-03 21:27:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:27:53] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2025-06-03 21:27:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1203/1204 variables, and 637 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1203 variables, 602/1239 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1203/1204 variables, and 1239 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 601/613 places, 603/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61321 ms. Remains : 601/613 places, 603/619 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-05
Product exploration explored 100000 steps with 33384 reset in 274 ms.
Product exploration explored 100000 steps with 33300 reset in 331 ms.
Computed a total of 112 stabilizing places and 112 stable transitions
Graph (complete) has 936 edges and 601 vertex of which 561 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.14 ms
Computed a total of 112 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (128 resets) in 471 ms. (84 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
[2025-06-03 21:28:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 521/600 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1203 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/1204 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1204 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1204 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1204/1204 variables, and 638 constraints, problems are : Problem set: 0 solved, 2 unsolved in 750 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 521/600 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1203 variables, 2/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1203 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1204 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1204 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1204 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1204/1204 variables, and 640 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1113 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1888ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 203 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=50 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p0)]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 238 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Support contains 3 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 603/603 transitions.
Applied a total of 0 rules in 30 ms. Remains 601 /601 variables (removed 0) and now considering 603/603 (removed 0) transitions.
[2025-06-03 21:28:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:28:58] [INFO ] Implicit Places using invariants in 391 ms returned []
[2025-06-03 21:28:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:28:59] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2025-06-03 21:28:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/1204 variables, and 37 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/601 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1203 variables, 602/1239 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1203/1204 variables, and 1239 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Finished structural reductions in LTL mode , in 1 iterations and 61699 ms. Remains : 601/601 places, 603/603 transitions.
Computed a total of 112 stabilizing places and 112 stable transitions
Graph (complete) has 936 edges and 601 vertex of which 561 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.13 ms
Computed a total of 112 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (130 resets) in 299 ms. (133 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 113 ms. (350 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (13 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
[2025-06-03 21:30:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 521/600 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1203 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/1204 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1204 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1204 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1204/1204 variables, and 638 constraints, problems are : Problem set: 0 solved, 2 unsolved in 760 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 521/600 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1203 variables, 2/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1203 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1204 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1204 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1204 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1204/1204 variables, and 640 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1121 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1906ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 202 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=101 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p0)]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 237 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 280 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 33321 reset in 380 ms.
Product exploration explored 100000 steps with 33273 reset in 376 ms.
Applying partial POR strategy [false, true, false, true, false, true]
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Support contains 3 out of 601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 601/601 places, 603/603 transitions.
Graph (trivial) has 487 edges and 601 vertex of which 6 / 601 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 930 edges and 596 vertex of which 556 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.5 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 289 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 289 rules applied. Total rules applied 291 place count 556 transition count 594
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 38 Pre rules applied. Total rules applied 291 place count 556 transition count 596
Deduced a syphon composed of 327 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 329 place count 556 transition count 596
Discarding 215 places :
Symmetric choice reduction at 1 with 215 rule applications. Total rules 544 place count 341 transition count 381
Deduced a syphon composed of 147 places in 1 ms
Iterating global reduction 1 with 215 rules applied. Total rules applied 759 place count 341 transition count 381
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 793 place count 307 transition count 347
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 827 place count 307 transition count 347
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 1 with 113 rules applied. Total rules applied 940 place count 307 transition count 348
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 942 place count 307 transition count 346
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1020 place count 229 transition count 267
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1098 place count 229 transition count 267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1099 place count 229 transition count 267
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1100 place count 228 transition count 266
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1101 place count 228 transition count 266
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 1135 place count 228 transition count 367
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 1201 place count 162 transition count 235
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 2 with 66 rules applied. Total rules applied 1267 place count 162 transition count 235
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 1363 place count 66 transition count 75
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 1459 place count 66 transition count 75
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 1459 rules in 294 ms. Remains 66 /601 variables (removed 535) and now considering 75/603 (removed 528) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 21:30:04] [INFO ] Redundant transitions in 22 ms returned []
Running 74 sub problems to find dead transitions.
// Phase 1: matrix 75 rows 66 cols
[2025-06-03 21:30:04] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 21:30:04] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem 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 TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
At refinement iteration 1 (OVERLAPS) 74/139 variables, 65/65 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 12/77 constraints. Problems are: Problem set: 56 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/77 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/140 variables, 1/78 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/78 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 1/141 variables, 1/79 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/79 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/79 constraints. Problems are: Problem set: 56 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 79 constraints, problems are : Problem set: 56 solved, 18 unsolved in 1414 ms.
Refiners :[State Equation: 66/66 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 56 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 73/86 variables, 13/13 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 12/25 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 18/43 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/43 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 54/140 variables, 53/96 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/96 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/141 variables, 1/97 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/97 constraints. Problems are: Problem set: 56 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/141 variables, 0/97 constraints. Problems are: Problem set: 56 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 97 constraints, problems are : Problem set: 56 solved, 18 unsolved in 1558 ms.
Refiners :[State Equation: 66/66 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 18/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2993ms problems are : Problem set: 56 solved, 18 unsolved
Search for dead transitions found 56 dead transitions in 2993ms
Found 56 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 56 transitions
Dead transitions reduction (with SMT) removed 56 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 66/601 places, 19/603 transitions.
Graph (complete) has 47 edges and 66 vertex of which 14 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.1 ms
Discarding 52 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 14 /66 variables (removed 52) and now considering 19/19 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/601 places, 19/603 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3324 ms. Remains : 14/601 places, 19/603 transitions.
Built C files in :
/tmp/ltsmin2321640355967855702
[2025-06-03 21:30:07] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2321640355967855702
Running compilation step : cd /tmp/ltsmin2321640355967855702;'/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 2120 ms.
Running link step : cd /tmp/ltsmin2321640355967855702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin2321640355967855702;'/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/stateBased1583839751742466038.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 603/603 transitions.
Applied a total of 0 rules in 19 ms. Remains 601 /601 variables (removed 0) and now considering 603/603 (removed 0) transitions.
// Phase 1: matrix 603 rows 601 cols
[2025-06-03 21:30:22] [INFO ] Computed 37 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:30:23] [INFO ] Implicit Places using invariants in 277 ms returned []
[2025-06-03 21:30:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:30:24] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2025-06-03 21:30:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/1204 variables, and 37 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/601 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1203 variables, 602/1239 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1203/1204 variables, and 1239 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in LTL mode , in 1 iterations and 61520 ms. Remains : 601/601 places, 603/603 transitions.
Built C files in :
/tmp/ltsmin6220259136930758384
[2025-06-03 21:31:24] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6220259136930758384
Running compilation step : cd /tmp/ltsmin6220259136930758384;'/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 1685 ms.
Running link step : cd /tmp/ltsmin6220259136930758384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6220259136930758384;'/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/stateBased13938453347536731511.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 21:31:39] [INFO ] Flatten gal took : 37 ms
[2025-06-03 21:31:39] [INFO ] Flatten gal took : 36 ms
[2025-06-03 21:31:39] [INFO ] Time to serialize gal into /tmp/LTL15500531331929777726.gal : 11 ms
[2025-06-03 21:31:39] [INFO ] Time to serialize properties into /tmp/LTL2978829506806611849.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/LTL15500531331929777726.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6948600763083954645.hoa' '-atoms' '/tmp/LTL2978829506806611849.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2978829506806611849.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6948600763083954645.hoa
Detected timeout of ITS tools.
[2025-06-03 21:31:54] [INFO ] Flatten gal took : 29 ms
[2025-06-03 21:31:54] [INFO ] Flatten gal took : 29 ms
[2025-06-03 21:31:54] [INFO ] Time to serialize gal into /tmp/LTL10061484109048749710.gal : 8 ms
[2025-06-03 21:31:54] [INFO ] Time to serialize properties into /tmp/LTL8417964209128574248.ltl : 6 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/LTL10061484109048749710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8417964209128574248.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X("(p61==0)"))||(("(p328==0)")&&(X(("(p61==0)")||(X(X("(p515==1)")))))))))
Formula 0 simplified : F(X!"(p61==0)" & (!"(p328==0)" | X(!"(p61==0)" & XX!"(p515==1)")))
Detected timeout of ITS tools.
[2025-06-03 21:32:10] [INFO ] Flatten gal took : 27 ms
[2025-06-03 21:32:10] [INFO ] Applying decomposition
[2025-06-03 21:32:10] [INFO ] Flatten gal took : 27 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/graph3850484779599324871.txt' '-o' '/tmp/graph3850484779599324871.bin' '-w' '/tmp/graph3850484779599324871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3850484779599324871.bin' '-l' '-1' '-v' '-w' '/tmp/graph3850484779599324871.weights' '-q' '0' '-e' '0.001'
[2025-06-03 21:32:10] [INFO ] Decomposing Gal with order
[2025-06-03 21:32:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 21:32:10] [INFO ] Removed a total of 192 redundant transitions.
[2025-06-03 21:32:10] [INFO ] Flatten gal took : 185 ms
[2025-06-03 21:32:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2025-06-03 21:32:10] [INFO ] Time to serialize gal into /tmp/LTL5096767575561710684.gal : 23 ms
[2025-06-03 21:32:10] [INFO ] Time to serialize properties into /tmp/LTL8303132940023029599.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/LTL5096767575561710684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8303132940023029599.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((X("(i4.u23.p61==0)"))||(("(i17.u120.p328==0)")&&(X(("(i4.u23.p61==0)")||(X(X("(i27.u187.p515==1)")))))))))
Formula 0 simplified : F(X!"(i4.u23.p61==0)" & (!"(i17.u120.p328==0)" | X(!"(i4.u23.p61==0)" & XX!"(i27.u187.p515==1)")))
Reverse transition relation is NOT exact ! Due to transitions t545, i0.i1.t106, i0.i1.i2.t99, i1.i1.t337, i1.i1.i1.u111.t330, i2.i1.t437, i2.i1.i2.t429, i3...1032
Computing Next relation with stutter on 3.00189e+17 deadlock states
299 unique states visited
299 strongly connected components in search stack
300 transitions explored
299 items max in DFS search stack
1437 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.5105,226460,1,0,458426,309,6095,639339,149,893,989530
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-05 finished in 273760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Graph (trivial) has 502 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 946 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 298 transitions
Trivial Post-agglo rules discarded 298 transitions
Performed 298 trivial Post agglomeration. Transition count delta: 298
Iterating post reduction 0 with 298 rules applied. Total rules applied 300 place count 567 transition count 311
Reduce places removed 298 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 303 rules applied. Total rules applied 603 place count 269 transition count 306
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 606 place count 268 transition count 304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 608 place count 266 transition count 304
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 608 place count 266 transition count 228
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 760 place count 190 transition count 228
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 795 place count 155 transition count 193
Iterating global reduction 4 with 35 rules applied. Total rules applied 830 place count 155 transition count 193
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 4 with 216 rules applied. Total rules applied 1046 place count 47 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1047 place count 47 transition count 84
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 1081 place count 13 transition count 17
Iterating global reduction 5 with 34 rules applied. Total rules applied 1115 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1117 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1118 place count 11 transition count 15
Applied a total of 1118 rules in 41 ms. Remains 11 /613 variables (removed 602) and now considering 15/619 (removed 604) transitions.
// Phase 1: matrix 15 rows 11 cols
[2025-06-03 21:32:25] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:32:25] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 21:32:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:32:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 21:32:25] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 21:32:25] [INFO ] Redundant transitions in 16 ms returned []
Running 10 sub problems to find dead transitions.
[2025-06-03 21:32:25] [INFO ] Invariant cache hit.
[2025-06-03 21:32:25] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/25 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/26 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 12 constraints, problems are : Problem set: 0 solved, 10 unsolved in 181 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/25 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/26 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 226 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 412ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 412ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/613 places, 15/619 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 541 ms. Remains : 11/613 places, 15/619 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-06 finished in 637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||X(p1))) U (p2 U (G(F(!p1)) U p3))))'
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 610
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 604 transition count 609
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 602 transition count 607
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 602 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 602 transition count 605
Applied a total of 25 rules in 90 ms. Remains 602 /613 variables (removed 11) and now considering 605/619 (removed 14) transitions.
// Phase 1: matrix 605 rows 602 cols
[2025-06-03 21:32:26] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:32:26] [INFO ] Implicit Places using invariants in 323 ms returned []
[2025-06-03 21:32:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:32:27] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2025-06-03 21:32:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 601/1207 variables, and 37 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1206 variables, 604/1242 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1207 variables, and 1242 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60210ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Starting structural reductions in LTL mode, iteration 1 : 602/613 places, 605/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61505 ms. Remains : 602/613 places, 605/619 transitions.
Stuttering acceptance computed with spot in 511 ms :[(NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false, (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-07
Product exploration explored 100000 steps with 33243 reset in 287 ms.
Product exploration explored 100000 steps with 33249 reset in 334 ms.
Computed a total of 112 stabilizing places and 112 stable transitions
Graph (complete) has 938 edges and 602 vertex of which 562 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.5 ms
Computed a total of 112 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 163 ms. Reduced automaton from 10 states, 23 edges and 4 AP (stutter sensitive) to 10 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 409 ms :[(NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false, (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (127 resets) in 252 ms. (158 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40004 steps (13 resets) in 182 ms. (218 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 89 ms. (444 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 (12 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (13 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (13 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (13 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
[2025-06-03 21:33:30] [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, 12 unsolved
At refinement iteration 1 (OVERLAPS) 106/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 491/601 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/1207 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1207 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/1207 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1207/1207 variables, and 639 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1259 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 106/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 491/601 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 12/650 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1206 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/1207 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1207 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/1207 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1207/1207 variables, and 651 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3732 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5004ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 6 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=98 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 380 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (OR p0 (NOT p2) p3 p1))), (F (NOT (OR p0 p3))), (F p3), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p3 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p2 p3))), (F p2), (F (NOT (OR p0 p3 p1))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR p0 p2 p3 p1))), (F (NOT p0))]
Knowledge based reduction with 22 factoid took 723 ms. Reduced automaton from 10 states, 23 edges and 4 AP (stutter sensitive) to 10 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 472 ms :[(NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false, (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 472 ms :[(NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false, (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
[2025-06-03 21:33:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 21:33:37] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 23 ms returned sat
[2025-06-03 21:33:38] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2025-06-03 21:33:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 21:33:38] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 31 ms returned sat
[2025-06-03 21:33:39] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2025-06-03 21:33:39] [INFO ] Computed and/alt/rep : 599/786/599 causal constraints (skipped 5 transitions) in 50 ms.
[2025-06-03 21:33:50] [INFO ] Added : 577 causal constraints over 116 iterations in 10786 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 4 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 605/605 transitions.
Applied a total of 0 rules in 17 ms. Remains 602 /602 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2025-06-03 21:33:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:33:50] [INFO ] Implicit Places using invariants in 336 ms returned []
[2025-06-03 21:33:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:33:51] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2025-06-03 21:33:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1206/1207 variables, and 638 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1206 variables, 604/1242 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1207 variables, and 1242 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Finished structural reductions in LTL mode , in 1 iterations and 61375 ms. Remains : 602/602 places, 605/605 transitions.
Computed a total of 112 stabilizing places and 112 stable transitions
Graph (complete) has 938 edges and 602 vertex of which 562 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.8 ms
Computed a total of 112 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 173 ms. Reduced automaton from 10 states, 23 edges and 4 AP (stutter sensitive) to 10 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 422 ms :[(NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false, (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (130 resets) in 317 ms. (125 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40004 steps (12 resets) in 57 ms. (689 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 57 ms. (689 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 59 ms. (666 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 78 ms. (506 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 40004 steps (12 resets) in 53 ms. (740 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 53 ms. (740 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
[2025-06-03 21:34:52] [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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 106/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 491/601 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/1207 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1207 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/1207 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1207/1207 variables, and 639 constraints, problems are : Problem set: 0 solved, 6 unsolved in 964 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 106/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 491/601 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 6/644 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1206 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1207 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1207 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1207 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1207/1207 variables, and 645 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2361 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3337ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 5 properties in 108 ms.
Support contains 4 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 605/605 transitions.
Graph (trivial) has 487 edges and 602 vertex of which 6 / 602 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 931 edges and 597 vertex of which 557 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 287 transitions
Trivial Post-agglo rules discarded 287 transitions
Performed 287 trivial Post agglomeration. Transition count delta: 287
Iterating post reduction 0 with 289 rules applied. Total rules applied 291 place count 557 transition count 306
Reduce places removed 287 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 289 rules applied. Total rules applied 580 place count 270 transition count 304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 582 place count 268 transition count 304
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 582 place count 268 transition count 231
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 728 place count 195 transition count 231
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 765 place count 158 transition count 194
Iterating global reduction 3 with 37 rules applied. Total rules applied 802 place count 158 transition count 194
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 802 place count 158 transition count 193
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 804 place count 157 transition count 193
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 1020 place count 49 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 136 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 1022 place count 48 transition count 84
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1025 place count 48 transition count 81
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 1056 place count 17 transition count 19
Iterating global reduction 5 with 31 rules applied. Total rules applied 1087 place count 17 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 1092 place count 14 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 22 edges and 14 vertex of which 13 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 1094 place count 13 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1095 place count 13 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1096 place count 13 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1097 place count 12 transition count 13
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 1100 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1101 place count 10 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 1101 place count 10 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1105 place count 8 transition count 9
Applied a total of 1105 rules in 53 ms. Remains 8 /602 variables (removed 594) and now considering 9/605 (removed 596) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 8/602 places, 9/605 transitions.
RANDOM walk for 82 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (OR p0 (NOT p2) p3 p1))), (F (NOT (OR p0 p3))), (F p3), (F (NOT p1)), (F (NOT (OR p0 p2 p3 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p2 p3))), (F p2), (F (NOT (OR p0 p3 p1))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR p0 p2 p3 p1))), (F (NOT p0))]
Knowledge based reduction with 22 factoid took 993 ms. Reduced automaton from 10 states, 23 edges and 4 AP (stutter sensitive) to 10 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 515 ms :[(NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false, (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 502 ms :[(NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false, (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
[2025-06-03 21:34:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 21:34:58] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 25 ms returned sat
[2025-06-03 21:34:59] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2025-06-03 21:34:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 21:34:59] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 25 ms returned sat
[2025-06-03 21:35:00] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2025-06-03 21:35:00] [INFO ] Computed and/alt/rep : 599/786/599 causal constraints (skipped 5 transitions) in 62 ms.
[2025-06-03 21:35:09] [INFO ] Added : 577 causal constraints over 116 iterations in 8898 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 529 ms :[(NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false, (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 33264 reset in 227 ms.
Product exploration explored 100000 steps with 33515 reset in 197 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 397 ms :[(NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false, (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1)]
Support contains 4 out of 602 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 602/602 places, 605/605 transitions.
Graph (trivial) has 487 edges and 602 vertex of which 6 / 602 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 932 edges and 597 vertex of which 557 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 288 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 288 rules applied. Total rules applied 290 place count 557 transition count 596
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 38 Pre rules applied. Total rules applied 290 place count 557 transition count 599
Deduced a syphon composed of 326 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 328 place count 557 transition count 599
Discarding 212 places :
Symmetric choice reduction at 1 with 212 rule applications. Total rules 540 place count 345 transition count 387
Deduced a syphon composed of 149 places in 1 ms
Iterating global reduction 1 with 212 rules applied. Total rules applied 752 place count 345 transition count 387
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 787 place count 310 transition count 352
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 822 place count 310 transition count 352
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 1 with 112 rules applied. Total rules applied 934 place count 310 transition count 353
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 936 place count 310 transition count 351
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1013 place count 233 transition count 273
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1090 place count 233 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1091 place count 233 transition count 273
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1092 place count 232 transition count 272
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1093 place count 232 transition count 272
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -103
Deduced a syphon composed of 184 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 1128 place count 232 transition count 375
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 1195 place count 165 transition count 241
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 2 with 67 rules applied. Total rules applied 1262 place count 165 transition count 241
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 1355 place count 72 transition count 86
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 93 rules applied. Total rules applied 1448 place count 72 transition count 86
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 1448 rules in 85 ms. Remains 72 /602 variables (removed 530) and now considering 86/605 (removed 519) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 21:35:11] [INFO ] Redundant transitions in 19 ms returned []
Running 85 sub problems to find dead transitions.
// Phase 1: matrix 86 rows 72 cols
[2025-06-03 21:35:11] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 21:35:11] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem 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 TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
At refinement iteration 1 (OVERLAPS) 85/156 variables, 71/71 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 14/85 constraints. Problems are: Problem set: 61 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/85 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 1/157 variables, 1/86 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/86 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 1/158 variables, 1/87 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/87 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/158 variables, 0/87 constraints. Problems are: Problem set: 61 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 87 constraints, problems are : Problem set: 61 solved, 24 unsolved in 1583 ms.
Refiners :[State Equation: 72/72 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 61 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 84/100 variables, 16/16 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 14/30 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 24/54 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/54 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 57/157 variables, 56/110 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/110 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/158 variables, 1/111 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/111 constraints. Problems are: Problem set: 61 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/111 constraints. Problems are: Problem set: 61 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 111 constraints, problems are : Problem set: 61 solved, 24 unsolved in 1723 ms.
Refiners :[State Equation: 72/72 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 24/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3328ms problems are : Problem set: 61 solved, 24 unsolved
Search for dead transitions found 61 dead transitions in 3329ms
Found 61 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 61 transitions
Dead transitions reduction (with SMT) removed 61 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 72/602 places, 25/605 transitions.
Graph (complete) has 58 edges and 72 vertex of which 17 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 17 /72 variables (removed 55) and now considering 25/25 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/602 places, 25/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3461 ms. Remains : 17/602 places, 25/605 transitions.
Built C files in :
/tmp/ltsmin18024706460765683811
[2025-06-03 21:35:14] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18024706460765683811
Running compilation step : cd /tmp/ltsmin18024706460765683811;'/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 1681 ms.
Running link step : cd /tmp/ltsmin18024706460765683811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18024706460765683811;'/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/stateBased4912345740405301977.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 605/605 transitions.
Applied a total of 0 rules in 21 ms. Remains 602 /602 variables (removed 0) and now considering 605/605 (removed 0) transitions.
// Phase 1: matrix 605 rows 602 cols
[2025-06-03 21:35:29] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:35:30] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-06-03 21:35:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:35:30] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2025-06-03 21:35:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1206/1207 variables, and 638 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1206 variables, 604/1242 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1207 variables, and 1242 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Finished structural reductions in LTL mode , in 1 iterations and 61337 ms. Remains : 602/602 places, 605/605 transitions.
Built C files in :
/tmp/ltsmin10375766753770585807
[2025-06-03 21:36:31] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10375766753770585807
Running compilation step : cd /tmp/ltsmin10375766753770585807;'/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 1498 ms.
Running link step : cd /tmp/ltsmin10375766753770585807;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10375766753770585807;'/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/stateBased17949078374682688600.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 21:36:46] [INFO ] Flatten gal took : 23 ms
[2025-06-03 21:36:46] [INFO ] Flatten gal took : 21 ms
[2025-06-03 21:36:46] [INFO ] Time to serialize gal into /tmp/LTL5792352606616754179.gal : 5 ms
[2025-06-03 21:36:46] [INFO ] Time to serialize properties into /tmp/LTL1185557721882232794.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/LTL5792352606616754179.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15034019254895871901.hoa' '-atoms' '/tmp/LTL1185557721882232794.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1185557721882232794.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15034019254895871901.hoa
Detected timeout of ITS tools.
[2025-06-03 21:37:01] [INFO ] Flatten gal took : 17 ms
[2025-06-03 21:37:01] [INFO ] Flatten gal took : 18 ms
[2025-06-03 21:37:01] [INFO ] Time to serialize gal into /tmp/LTL15467833444453662611.gal : 5 ms
[2025-06-03 21:37:01] [INFO ] Time to serialize properties into /tmp/LTL2235479014436961666.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/LTL15467833444453662611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2235479014436961666.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((F("(p57!=1)"))||(X("(p274!=1)"))))U(("(p659==1)")U((G(F("(p274==1)")))U("(p394==1)")))))
Formula 0 simplified : X(G!"(p57!=1)" & X!"(p274!=1)") R (!"(p659==1)" R (FG!"(p274==1)" R !"(p394==1)"))
Detected timeout of ITS tools.
[2025-06-03 21:37:16] [INFO ] Flatten gal took : 18 ms
[2025-06-03 21:37:16] [INFO ] Applying decomposition
[2025-06-03 21:37:16] [INFO ] Flatten gal took : 17 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/graph17354065757168285904.txt' '-o' '/tmp/graph17354065757168285904.bin' '-w' '/tmp/graph17354065757168285904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17354065757168285904.bin' '-l' '-1' '-v' '-w' '/tmp/graph17354065757168285904.weights' '-q' '0' '-e' '0.001'
[2025-06-03 21:37:16] [INFO ] Decomposing Gal with order
[2025-06-03 21:37:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 21:37:16] [INFO ] Removed a total of 188 redundant transitions.
[2025-06-03 21:37:16] [INFO ] Flatten gal took : 50 ms
[2025-06-03 21:37:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-03 21:37:16] [INFO ] Time to serialize gal into /tmp/LTL15441889165948223439.gal : 10 ms
[2025-06-03 21:37:16] [INFO ] Time to serialize properties into /tmp/LTL18426750245185790395.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/LTL15441889165948223439.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18426750245185790395.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X((F("(i3.i0.u25.p57!=1)"))||(X("(i15.i2.u100.p274!=1)"))))U(("(i36.i0.u240.p659==1)")U((G(F("(i15.i2.u100.p274==1)")))U("(i21.i1....174
Formula 0 simplified : X(G!"(i3.i0.u25.p57!=1)" & X!"(i15.i2.u100.p274!=1)") R (!"(i36.i0.u240.p659==1)" R (FG!"(i15.i2.u100.p274==1)" R !"(i21.i1.u146.p39...163
Reverse transition relation is NOT exact ! Due to transitions t545, i2.t540, i2.i2.t533, i3.i2.t518, i3.i2.u24.t527, i4.t511, i4.i1.t500, i5.t493, i5.i1.u4...1171
Computing Next relation with stutter on 3.00189e+17 deadlock states
Detected timeout of ITS tools.
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-07 finished in 305323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X((p1&&G(p2))))))'
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 602 transition count 608
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 602 transition count 608
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 602 transition count 606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 601 transition count 605
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 601 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 601 transition count 604
Applied a total of 27 rules in 71 ms. Remains 601 /613 variables (removed 12) and now considering 604/619 (removed 15) transitions.
// Phase 1: matrix 604 rows 601 cols
[2025-06-03 21:37:31] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:37:32] [INFO ] Implicit Places using invariants in 254 ms returned []
[2025-06-03 21:37:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:37:32] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2025-06-03 21:37:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
SMT process timed out in 30102ms, After SMT, problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 30104ms
Starting structural reductions in LTL mode, iteration 1 : 601/613 places, 604/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31290 ms. Remains : 601/613 places, 604/619 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-08 finished in 31527 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))||(X(X((p1 U p2)))&&(p3 U p1))))'
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 603 transition count 609
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 603 transition count 609
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 603 transition count 607
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 601 transition count 605
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 601 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 601 transition count 603
Applied a total of 28 rules in 58 ms. Remains 601 /613 variables (removed 12) and now considering 603/619 (removed 16) transitions.
// Phase 1: matrix 603 rows 601 cols
[2025-06-03 21:38:03] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:38:03] [INFO ] Implicit Places using invariants in 342 ms returned []
[2025-06-03 21:38:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:38:04] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2025-06-03 21:38: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/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1203/1204 variables, and 637 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (OVERLAPS) 603/1203 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1203 variables, 602/1239 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1203/1204 variables, and 1239 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 601/613 places, 603/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61353 ms. Remains : 601/613 places, 603/619 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-09
Product exploration explored 100000 steps with 324 reset in 397 ms.
Product exploration explored 100000 steps with 329 reset in 469 ms.
Computed a total of 112 stabilizing places and 112 stable transitions
Graph (complete) has 936 edges and 601 vertex of which 561 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Computed a total of 112 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) p3))), (X (AND (NOT p1) (NOT p3))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 100 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 36860 steps (119 resets) in 125 ms. (292 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) p3))), (X (AND (NOT p1) (NOT p3))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 17 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 1 out of 601 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 601/601 places, 603/603 transitions.
Graph (trivial) has 483 edges and 601 vertex of which 6 / 601 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 930 edges and 596 vertex of which 556 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 287 transitions
Trivial Post-agglo rules discarded 287 transitions
Performed 287 trivial Post agglomeration. Transition count delta: 287
Iterating post reduction 0 with 287 rules applied. Total rules applied 289 place count 555 transition count 306
Reduce places removed 287 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 288 rules applied. Total rules applied 577 place count 268 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 578 place count 267 transition count 305
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 578 place count 267 transition count 231
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 726 place count 193 transition count 231
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 761 place count 158 transition count 196
Iterating global reduction 3 with 35 rules applied. Total rules applied 796 place count 158 transition count 196
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 1012 place count 50 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1013 place count 50 transition count 87
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 1046 place count 17 transition count 22
Iterating global reduction 4 with 33 rules applied. Total rules applied 1079 place count 17 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1081 place count 16 transition count 21
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1082 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1083 place count 15 transition count 20
Applied a total of 1083 rules in 41 ms. Remains 15 /601 variables (removed 586) and now considering 20/603 (removed 583) transitions.
// Phase 1: matrix 20 rows 15 cols
[2025-06-03 21:39:06] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:39:06] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 21:39:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:39:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 21:39:06] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 21:39:06] [INFO ] Redundant transitions in 15 ms returned []
Running 17 sub problems to find dead transitions.
[2025-06-03 21:39:06] [INFO ] Invariant cache hit.
[2025-06-03 21:39:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 19/31 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 3/34 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/35 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 16 constraints, problems are : Problem set: 0 solved, 17 unsolved in 442 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 19/31 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 3/34 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 33 constraints, problems are : Problem set: 0 solved, 17 unsolved in 613 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1063ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1063ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/601 places, 20/603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1188 ms. Remains : 15/601 places, 20/603 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 145 steps (8 resets) in 8 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 77 steps with 2 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-09 finished in 64520 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&&((p1 U p2) U p3)))))'
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Graph (trivial) has 499 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 946 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 293 transitions
Trivial Post-agglo rules discarded 293 transitions
Performed 293 trivial Post agglomeration. Transition count delta: 293
Iterating post reduction 0 with 293 rules applied. Total rules applied 295 place count 567 transition count 316
Reduce places removed 293 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 299 rules applied. Total rules applied 594 place count 274 transition count 310
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 599 place count 272 transition count 307
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 602 place count 269 transition count 307
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 602 place count 269 transition count 232
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 752 place count 194 transition count 232
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 787 place count 159 transition count 197
Iterating global reduction 4 with 35 rules applied. Total rules applied 822 place count 159 transition count 197
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 4 with 216 rules applied. Total rules applied 1038 place count 51 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1039 place count 51 transition count 88
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 1072 place count 18 transition count 23
Iterating global reduction 5 with 33 rules applied. Total rules applied 1105 place count 18 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1107 place count 17 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1108 place count 16 transition count 21
Applied a total of 1108 rules in 41 ms. Remains 16 /613 variables (removed 597) and now considering 21/619 (removed 598) transitions.
// Phase 1: matrix 21 rows 16 cols
[2025-06-03 21:39:07] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:39:07] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-03 21:39:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:39:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 21:39:07] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 21:39:07] [INFO ] Redundant transitions in 19 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-03 21:39:07] [INFO ] Invariant cache hit.
[2025-06-03 21:39:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 20/31 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 5/36 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 17 constraints, problems are : Problem set: 0 solved, 14 unsolved in 356 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 20/31 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 5/36 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 31 constraints, problems are : Problem set: 0 solved, 14 unsolved in 307 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 666ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 667ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/613 places, 21/619 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 820 ms. Remains : 16/613 places, 21/619 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p3) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-10 finished in 997 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||X((((F(p1)&&X(p2)) U (p3 U G(p2))) U (p0&&((F(p1)&&X(p2)) U (p3 U G(p2))))))))))'
Support contains 6 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Graph (trivial) has 500 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 946 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 297 transitions
Trivial Post-agglo rules discarded 297 transitions
Performed 297 trivial Post agglomeration. Transition count delta: 297
Iterating post reduction 0 with 297 rules applied. Total rules applied 299 place count 567 transition count 312
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 303 rules applied. Total rules applied 602 place count 270 transition count 306
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 606 place count 268 transition count 304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 608 place count 266 transition count 304
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 608 place count 266 transition count 231
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 754 place count 193 transition count 231
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 789 place count 158 transition count 196
Iterating global reduction 4 with 35 rules applied. Total rules applied 824 place count 158 transition count 196
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 1038 place count 51 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1039 place count 51 transition count 88
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 1072 place count 18 transition count 23
Iterating global reduction 5 with 33 rules applied. Total rules applied 1105 place count 18 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1107 place count 17 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1108 place count 16 transition count 21
Applied a total of 1108 rules in 35 ms. Remains 16 /613 variables (removed 597) and now considering 21/619 (removed 598) transitions.
// Phase 1: matrix 21 rows 16 cols
[2025-06-03 21:39:08] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:39:08] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 21:39:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:39:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 21:39:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 21:39:08] [INFO ] Redundant transitions in 21 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-03 21:39:08] [INFO ] Invariant cache hit.
[2025-06-03 21:39:08] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 3/36 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 17 constraints, problems are : Problem set: 0 solved, 18 unsolved in 333 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 3/36 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 35 constraints, problems are : Problem set: 0 solved, 18 unsolved in 560 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 898ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 898ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/613 places, 21/619 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1029 ms. Remains : 16/613 places, 21/619 transitions.
Stuttering acceptance computed with spot in 983 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-11 finished in 2070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Graph (trivial) has 503 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 946 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 297 place count 567 transition count 314
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 301 rules applied. Total rules applied 598 place count 272 transition count 308
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 602 place count 270 transition count 306
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 604 place count 268 transition count 306
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 77 Pre rules applied. Total rules applied 604 place count 268 transition count 229
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 758 place count 191 transition count 229
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 793 place count 156 transition count 194
Iterating global reduction 4 with 35 rules applied. Total rules applied 828 place count 156 transition count 194
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 1042 place count 49 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1043 place count 49 transition count 86
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1078 place count 14 transition count 17
Iterating global reduction 5 with 35 rules applied. Total rules applied 1113 place count 14 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1115 place count 13 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1116 place count 12 transition count 15
Applied a total of 1116 rules in 31 ms. Remains 12 /613 variables (removed 601) and now considering 15/619 (removed 604) transitions.
// Phase 1: matrix 15 rows 12 cols
[2025-06-03 21:39:10] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:39:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 21:39:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:39:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 21:39:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 21:39:10] [INFO ] Redundant transitions in 18 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-03 21:39:10] [INFO ] Invariant cache hit.
[2025-06-03 21:39:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/26 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 13 constraints, problems are : Problem set: 0 solved, 9 unsolved in 241 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 4/26 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 22 constraints, problems are : Problem set: 0 solved, 9 unsolved in 166 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 410ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 410ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/613 places, 15/619 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 519 ms. Remains : 12/613 places, 15/619 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-12 finished in 583 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 U !p1))))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Graph (trivial) has 503 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 946 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 296 rules applied. Total rules applied 298 place count 567 transition count 313
Reduce places removed 296 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 302 rules applied. Total rules applied 600 place count 271 transition count 307
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 604 place count 269 transition count 305
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 606 place count 267 transition count 305
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 606 place count 267 transition count 230
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 756 place count 192 transition count 230
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 791 place count 157 transition count 195
Iterating global reduction 4 with 35 rules applied. Total rules applied 826 place count 157 transition count 195
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 1044 place count 48 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1045 place count 48 transition count 85
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 1078 place count 15 transition count 20
Iterating global reduction 5 with 33 rules applied. Total rules applied 1111 place count 15 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1113 place count 14 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1114 place count 14 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1115 place count 13 transition count 18
Applied a total of 1115 rules in 25 ms. Remains 13 /613 variables (removed 600) and now considering 18/619 (removed 601) transitions.
// Phase 1: matrix 18 rows 13 cols
[2025-06-03 21:39:11] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:39:11] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-03 21:39:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:39:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 21:39:11] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 21:39:11] [INFO ] Redundant transitions in 23 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-03 21:39:11] [INFO ] Invariant cache hit.
[2025-06-03 21:39:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 17/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/30 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 14 constraints, problems are : Problem set: 0 solved, 11 unsolved in 289 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 17/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 4/30 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 25 constraints, problems are : Problem set: 0 solved, 11 unsolved in 238 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 532ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 533ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/613 places, 18/619 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 655 ms. Remains : 13/613 places, 18/619 transitions.
Stuttering acceptance computed with spot in 93 ms :[p1, p1]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-13
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-13 finished in 762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 603 transition count 609
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 603 transition count 609
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 603 transition count 607
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 602 transition count 606
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 602 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 602 transition count 605
Applied a total of 25 rules in 51 ms. Remains 602 /613 variables (removed 11) and now considering 605/619 (removed 14) transitions.
// Phase 1: matrix 605 rows 602 cols
[2025-06-03 21:39:12] [INFO ] Computed 37 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:39:12] [INFO ] Implicit Places using invariants in 333 ms returned []
[2025-06-03 21:39:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:39:13] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2025-06-03 21:39: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/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1206/1207 variables, and 638 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1206 variables, 604/1242 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1207 variables, and 1242 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 602/613 places, 605/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61164 ms. Remains : 602/613 places, 605/619 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-14
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-14 finished in 61337 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 U (G(!p0)||(!p0&&(!p1 U (p2||G(!p1))))))))))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 610
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 610
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 602 transition count 608
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 602 transition count 608
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 602 transition count 606
Applied a total of 24 rules in 52 ms. Remains 602 /613 variables (removed 11) and now considering 606/619 (removed 13) transitions.
// Phase 1: matrix 606 rows 602 cols
[2025-06-03 21:40:13] [INFO ] Computed 37 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:40:13] [INFO ] Implicit Places using invariants in 348 ms returned []
[2025-06-03 21:40:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:40:14] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2025-06-03 21:40:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1207/1208 variables, and 638 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1207 variables, 605/1243 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1207/1208 variables, and 1243 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 602/613 places, 606/619 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61267 ms. Remains : 602/613 places, 606/619 transitions.
Stuttering acceptance computed with spot in 236 ms :[p0, p0, p0, (AND (NOT p2) p1 p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-15
Product exploration explored 100000 steps with 326 reset in 548 ms.
Product exploration explored 100000 steps with 328 reset in 384 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 939 edges and 602 vertex of which 562 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 95 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[p0, p0, p0, (AND p0 (NOT p2) p1)]
RANDOM walk for 40000 steps (129 resets) in 269 ms. (148 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 391 ms. (102 steps per ms) remains 2/2 properties
[2025-06-03 21:41:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/95 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 506/601 variables, 34/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1208 variables, 1/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1208 variables, 0/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1208 variables, 0/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1208/1208 variables, and 639 constraints, problems are : Problem set: 1 solved, 1 unsolved in 765 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/79 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 522/601 variables, 35/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 1/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1207 variables, 0/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1208 variables, 1/640 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1208 variables, 0/640 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1208 variables, 0/640 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1208/1208 variables, and 640 constraints, problems are : Problem set: 1 solved, 1 unsolved in 814 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1598ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 2 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 606/606 transitions.
Graph (trivial) has 491 edges and 602 vertex of which 6 / 602 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 932 edges and 597 vertex of which 557 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 287 transitions
Trivial Post-agglo rules discarded 287 transitions
Performed 287 trivial Post agglomeration. Transition count delta: 287
Iterating post reduction 0 with 289 rules applied. Total rules applied 291 place count 557 transition count 307
Reduce places removed 287 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 289 rules applied. Total rules applied 580 place count 270 transition count 305
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 582 place count 269 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 583 place count 268 transition count 304
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 583 place count 268 transition count 229
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 733 place count 193 transition count 229
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 770 place count 156 transition count 192
Iterating global reduction 4 with 37 rules applied. Total rules applied 807 place count 156 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 807 place count 156 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 809 place count 155 transition count 191
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 1027 place count 46 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 127 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 1029 place count 45 transition count 81
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1031 place count 45 transition count 79
Discarding 33 places :
Symmetric choice reduction at 6 with 33 rule applications. Total rules 1064 place count 12 transition count 13
Iterating global reduction 6 with 33 rules applied. Total rules applied 1097 place count 12 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 1102 place count 9 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 13 edges and 9 vertex of which 8 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 2 rules applied. Total rules applied 1104 place count 8 transition count 10
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1105 place count 8 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1106 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1107 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 1110 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1111 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1111 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1113 place count 4 transition count 4
Applied a total of 1113 rules in 32 ms. Remains 4 /602 variables (removed 598) and now considering 4/606 (removed 602) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 4/602 places, 4/606 transitions.
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2 p1))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 (NOT p1))))]
Knowledge based reduction with 7 factoid took 476 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 199 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Support contains 3 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 606/606 transitions.
Applied a total of 0 rules in 16 ms. Remains 602 /602 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2025-06-03 21:41:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:41:19] [INFO ] Implicit Places using invariants in 337 ms returned []
[2025-06-03 21:41:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:41:20] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2025-06-03 21:41:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1207/1208 variables, and 638 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1207 variables, 605/1243 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1207/1208 variables, and 1243 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Finished structural reductions in LTL mode , in 1 iterations and 61297 ms. Remains : 602/602 places, 606/606 transitions.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 939 edges and 602 vertex of which 562 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 150 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[p0, p0, p0, (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (129 resets) in 253 ms. (157 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 258 ms. (154 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (12 resets) in 54 ms. (727 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
[2025-06-03 21:42:21] [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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 92/95 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 506/601 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/1208 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1208 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1208 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1208/1208 variables, and 639 constraints, problems are : Problem set: 0 solved, 3 unsolved in 890 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 92/95 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 506/601 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 3/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1207 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1208 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1208 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1208 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1208/1208 variables, and 642 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1140 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2042ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 5324 steps, including 28 resets, run visited all 3 properties in 19 ms. (steps per millisecond=280 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 19 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p2 p1))), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 6 factoid took 328 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 327 reset in 375 ms.
Product exploration explored 100000 steps with 328 reset in 316 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 208 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Support contains 3 out of 602 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 602/602 places, 606/606 transitions.
Graph (trivial) has 489 edges and 602 vertex of which 6 / 602 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 933 edges and 597 vertex of which 557 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 286 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 286 rules applied. Total rules applied 288 place count 557 transition count 597
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 288 place count 557 transition count 601
Deduced a syphon composed of 326 places in 2 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 328 place count 557 transition count 601
Discarding 210 places :
Symmetric choice reduction at 1 with 210 rule applications. Total rules 538 place count 347 transition count 391
Deduced a syphon composed of 151 places in 1 ms
Iterating global reduction 1 with 210 rules applied. Total rules applied 748 place count 347 transition count 391
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 783 place count 312 transition count 356
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 818 place count 312 transition count 356
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 1 with 112 rules applied. Total rules applied 930 place count 312 transition count 357
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 932 place count 312 transition count 355
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1009 place count 235 transition count 277
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1086 place count 235 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1087 place count 235 transition count 277
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1088 place count 234 transition count 276
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1089 place count 234 transition count 276
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 187 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 1125 place count 234 transition count 383
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 1195 place count 164 transition count 243
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 1265 place count 164 transition count 243
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 1361 place count 68 transition count 83
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 1457 place count 68 transition count 83
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 1457 rules in 114 ms. Remains 68 /602 variables (removed 534) and now considering 83/606 (removed 523) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 21:42:25] [INFO ] Redundant transitions in 15 ms returned []
Running 82 sub problems to find dead transitions.
// Phase 1: matrix 83 rows 68 cols
[2025-06-03 21:42:25] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 21:42:25] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem 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 TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
At refinement iteration 1 (OVERLAPS) 82/149 variables, 67/67 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 12/79 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/79 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 1/150 variables, 1/80 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/80 constraints. Problems are: Problem set: 59 solved, 23 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/151 variables, 1/81 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/81 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/81 constraints. Problems are: Problem set: 59 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 81 constraints, problems are : Problem set: 59 solved, 23 unsolved in 1254 ms.
Refiners :[State Equation: 68/68 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 59 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 81/95 variables, 14/14 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 12/26 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 23/49 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/49 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 55/150 variables, 54/103 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/103 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1/151 variables, 1/104 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/104 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/104 constraints. Problems are: Problem set: 59 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 104 constraints, problems are : Problem set: 59 solved, 23 unsolved in 2078 ms.
Refiners :[State Equation: 68/68 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 23/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3345ms problems are : Problem set: 59 solved, 23 unsolved
Search for dead transitions found 59 dead transitions in 3345ms
Found 59 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 59 transitions
Dead transitions reduction (with SMT) removed 59 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 68/602 places, 24/606 transitions.
Graph (complete) has 52 edges and 68 vertex of which 15 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.0 ms
Discarding 53 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 15 /68 variables (removed 53) and now considering 24/24 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/602 places, 24/606 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3483 ms. Remains : 15/602 places, 24/606 transitions.
Built C files in :
/tmp/ltsmin12962456327347282828
[2025-06-03 21:42:28] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12962456327347282828
Running compilation step : cd /tmp/ltsmin12962456327347282828;'/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 1471 ms.
Running link step : cd /tmp/ltsmin12962456327347282828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12962456327347282828;'/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/stateBased8564194955398111840.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 606/606 transitions.
Applied a total of 0 rules in 16 ms. Remains 602 /602 variables (removed 0) and now considering 606/606 (removed 0) transitions.
// Phase 1: matrix 606 rows 602 cols
[2025-06-03 21:42:43] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:42:44] [INFO ] Implicit Places using invariants in 274 ms returned []
[2025-06-03 21:42:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:42:45] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1299 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2025-06-03 21:42:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 601/1208 variables, and 37 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/602 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1207 variables, 605/1243 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1207/1208 variables, and 1243 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Finished structural reductions in LTL mode , in 1 iterations and 61541 ms. Remains : 602/602 places, 606/606 transitions.
Built C files in :
/tmp/ltsmin13975243838882857594
[2025-06-03 21:43:45] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13975243838882857594
Running compilation step : cd /tmp/ltsmin13975243838882857594;'/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 1819 ms.
Running link step : cd /tmp/ltsmin13975243838882857594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13975243838882857594;'/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/stateBased7167619078719355100.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 21:44:00] [INFO ] Flatten gal took : 16 ms
[2025-06-03 21:44:00] [INFO ] Flatten gal took : 19 ms
[2025-06-03 21:44:00] [INFO ] Time to serialize gal into /tmp/LTL7505677532829456562.gal : 4 ms
[2025-06-03 21:44:00] [INFO ] Time to serialize properties into /tmp/LTL9053047989453677540.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/LTL7505677532829456562.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7273445914073847097.hoa' '-atoms' '/tmp/LTL9053047989453677540.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/LTL9053047989453677540.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7273445914073847097.hoa
Detected timeout of ITS tools.
[2025-06-03 21:44:15] [INFO ] Flatten gal took : 16 ms
[2025-06-03 21:44:15] [INFO ] Flatten gal took : 16 ms
[2025-06-03 21:44:15] [INFO ] Time to serialize gal into /tmp/LTL11679906169853936049.gal : 3 ms
[2025-06-03 21:44:15] [INFO ] Time to serialize properties into /tmp/LTL10649598300669303687.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11679906169853936049.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10649598300669303687.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((!("((p105==1)&&(p507==1))"))U((G(!("((p105==1)&&(p507==1))")))||((!("((p105==1)&&(p507==1))"))&&(("(p57==1)")U(("((p57==1)&&...193
Formula 0 simplified : XXG((!"(p57==1)" M !"((p57==1)&&(p105==1))") U "((p105==1)&&(p507==1))")
Detected timeout of ITS tools.
[2025-06-03 21:44:30] [INFO ] Flatten gal took : 15 ms
[2025-06-03 21:44:30] [INFO ] Applying decomposition
[2025-06-03 21:44:30] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4389472016526311650.txt' '-o' '/tmp/graph4389472016526311650.bin' '-w' '/tmp/graph4389472016526311650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4389472016526311650.bin' '-l' '-1' '-v' '-w' '/tmp/graph4389472016526311650.weights' '-q' '0' '-e' '0.001'
[2025-06-03 21:44:30] [INFO ] Decomposing Gal with order
[2025-06-03 21:44:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 21:44:30] [INFO ] Removed a total of 189 redundant transitions.
[2025-06-03 21:44:30] [INFO ] Flatten gal took : 40 ms
[2025-06-03 21:44:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 21:44:30] [INFO ] Time to serialize gal into /tmp/LTL15811523392660460136.gal : 18 ms
[2025-06-03 21:44:30] [INFO ] Time to serialize properties into /tmp/LTL17447654392915315034.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15811523392660460136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17447654392915315034.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((!("((i6.u37.p105==1)&&(i27.u183.p507==1))"))U((G(!("((i6.u37.p105==1)&&(i27.u183.p507==1))")))||((!("((i6.u37.p105==1)&&(i27...269
Formula 0 simplified : XXG((!"(i4.u22.p57==1)" M !"((i4.u22.p57==1)&&(i6.u37.p105==1))") U "((i6.u37.p105==1)&&(i27.u183.p507==1))")
Reverse transition relation is NOT exact ! Due to transitions t545, i1.t294, i1.t287, i2.i1.t394, i2.i1.i1.u79.t387, i3.t540, i3.u15.t533, i4.t527, i4.u21....1029
Computing Next relation with stutter on 3.00189e+17 deadlock states
Detected timeout of ITS tools.
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-15 finished in 272413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||X(p1))) U (p2 U (G(F(!p1)) U p3))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0 U (G(!p0)||(!p0&&(!p1 U (p2||G(!p1))))))))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-36b-LTLFireability-15
Stuttering acceptance computed with spot in 220 ms :[p0, p0, p0, (AND (NOT p2) p1 p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 613/613 places, 619/619 transitions.
Graph (trivial) has 502 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 946 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 296 rules applied. Total rules applied 298 place count 567 transition count 313
Reduce places removed 296 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 299 rules applied. Total rules applied 597 place count 271 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 598 place count 270 transition count 310
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 598 place count 270 transition count 234
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 750 place count 194 transition count 234
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 785 place count 159 transition count 199
Iterating global reduction 3 with 35 rules applied. Total rules applied 820 place count 159 transition count 199
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 1036 place count 51 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1037 place count 51 transition count 90
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 1070 place count 18 transition count 25
Iterating global reduction 4 with 33 rules applied. Total rules applied 1103 place count 18 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1109 place count 15 transition count 24
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1113 place count 15 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1114 place count 14 transition count 23
Applied a total of 1114 rules in 30 ms. Remains 14 /613 variables (removed 599) and now considering 23/619 (removed 596) transitions.
[2025-06-03 21:44:46] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 14 cols
[2025-06-03 21:44:46] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:44:46] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-03 21:44:46] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2025-06-03 21:44:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 21:44:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 21:44:46] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 13 sub problems to find dead transitions.
[2025-06-03 21:44:46] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2025-06-03 21:44:46] [INFO ] Invariant cache hit.
[2025-06-03 21:44:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/34 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/35 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 15 constraints, problems are : Problem set: 0 solved, 13 unsolved in 496 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 4/34 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 28 constraints, problems are : Problem set: 0 solved, 13 unsolved in 456 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 976ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 977ms
Starting structural reductions in LI_LTL mode, iteration 1 : 14/613 places, 23/619 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1146 ms. Remains : 14/613 places, 23/619 transitions.
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-15 finished in 1549 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2025-06-03 21:44:47] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17150641480450154263
[2025-06-03 21:44:47] [INFO ] Computing symmetric may disable matrix : 619 transitions.
[2025-06-03 21:44:47] [INFO ] Applying decomposition
[2025-06-03 21:44:47] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 21:44:47] [INFO ] Computing symmetric may enable matrix : 619 transitions.
[2025-06-03 21:44:47] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 21:44:47] [INFO ] Flatten gal took : 24 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/graph12750112210275165192.txt' '-o' '/tmp/graph12750112210275165192.bin' '-w' '/tmp/graph12750112210275165192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12750112210275165192.bin' '-l' '-1' '-v' '-w' '/tmp/graph12750112210275165192.weights' '-q' '0' '-e' '0.001'
[2025-06-03 21:44:47] [INFO ] Decomposing Gal with order
[2025-06-03 21:44:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 21:44:48] [INFO ] Computing Do-Not-Accords matrix : 619 transitions.
[2025-06-03 21:44:48] [INFO ] Removed a total of 181 redundant transitions.
[2025-06-03 21:44:48] [INFO ] Flatten gal took : 120 ms
[2025-06-03 21:44:48] [INFO ] Computation of Completed DNA matrix. took 71 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 21:44:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-03 21:44:48] [INFO ] Built C files in 437ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17150641480450154263
Running compilation step : cd /tmp/ltsmin17150641480450154263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 21:44:48] [INFO ] Time to serialize gal into /tmp/LTLFireability12316064997503653428.gal : 17 ms
[2025-06-03 21:44:48] [INFO ] Time to serialize properties into /tmp/LTLFireability5990105877674485699.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12316064997503653428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5990105877674485699.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((X((F("(i3.u26.p57!=1)"))||(X("(i15.u104.p274!=1)"))))U(("(i34.u240.p659==1)")U((G(F("(i15.u104.p274==1)")))U("(i21.u148.p394==1)")...159
Formula 0 simplified : X(G!"(i3.u26.p57!=1)" & X!"(i15.u104.p274!=1)") R (!"(i34.u240.p659==1)" R (FG!"(i15.u104.p274==1)" R !"(i21.u148.p394==1)"))
Compilation finished in 2525 ms.
Running link step : cd /tmp/ltsmin17150641480450154263;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Reverse transition relation is NOT exact ! Due to transitions t545, i0.t148, i0.t141, i1.t234, i1.u157.t227, i2.t540, i2.t533, i3.t527, i3.t518, i4.t501, i...1061
Running LTSmin : cd /tmp/ltsmin17150641480450154263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((<>((LTLAPp0==true))||X((LTLAPp1==true)))) U ((LTLAPp2==true) U ([](<>(!(LTLAPp1==true))) U (LTLAPp3==true))))' '--buchi-type=spotba'
Computing Next relation with stutter on 3.00189e+17 deadlock states
292 unique states visited
292 strongly connected components in search stack
292 transitions explored
292 items max in DFS search stack
1435 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.5777,242700,1,0,478830,358,6237,636859,151,1119,1024240
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(F((!("((i5.i1.i1.u42.p105==1)&&(i27.u191.p507==1))"))U((G(!("((i5.i1.i1.u42.p105==1)&&(i27.u191.p507==1))")))||((!("((i5.i1.i1....293
Formula 1 simplified : XXG((!"(i3.u26.p57==1)" M !"((i3.u26.p57==1)&&(i5.i1.i1.u42.p105==1))") U "((i5.i1.i1.u42.p105==1)&&(i27.u191.p507==1))")
Computing Next relation with stutter on 3.00189e+17 deadlock states
298 unique states visited
297 strongly connected components in search stack
300 transitions explored
298 items max in DFS search stack
1201 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,26.5912,419084,1,0,876166,358,6468,1.14395e+06,153,1124,1507012
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1248944 ms.
BK_STOP 1748987151049
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-36b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-36b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867008000516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-36b.tgz
mv GPUForwardProgress-PT-36b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;