About the Execution of ITS-Tools for GPUForwardProgress-PT-16b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 589909.00 | 0.00 | 0.00 | FFFFFFFFFTFTFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007900436.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-16b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007900436
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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 84K 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-16b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748963369113
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-16b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 15:09:31] [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 15:09:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 15:09:32] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2025-06-03 15:09:32] [INFO ] Transformed 340 places.
[2025-06-03 15:09:32] [INFO ] Transformed 357 transitions.
[2025-06-03 15:09:32] [INFO ] Found NUPN structural information;
[2025-06-03 15:09:32] [INFO ] Parsed PT model containing 340 places and 357 transitions and 877 arcs in 410 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 357/357 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 339 transition count 357
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 307 transition count 325
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 307 transition count 325
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 78 place count 294 transition count 312
Iterating global reduction 1 with 13 rules applied. Total rules applied 91 place count 294 transition count 312
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 103 place count 294 transition count 300
Applied a total of 103 rules in 135 ms. Remains 294 /340 variables (removed 46) and now considering 300/357 (removed 57) transitions.
// Phase 1: matrix 300 rows 294 cols
[2025-06-03 15:09:32] [INFO ] Computed 17 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:09:33] [INFO ] Implicit Places using invariants in 444 ms returned []
[2025-06-03 15:09:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:09:33] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2025-06-03 15:09:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 300/593 variables, 293/310 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 1/594 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/594 variables, and 311 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30070 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 300/593 variables, 293/310 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 299/609 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (OVERLAPS) 1/594 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/594 variables, and 610 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60328ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Starting structural reductions in LTL mode, iteration 1 : 294/340 places, 300/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61547 ms. Remains : 294/340 places, 300/357 transitions.
Support contains 34 out of 294 places after structural reductions.
[2025-06-03 15:10:34] [INFO ] Flatten gal took : 161 ms
[2025-06-03 15:10:34] [INFO ] Flatten gal took : 57 ms
[2025-06-03 15:10:34] [INFO ] Input system was already deterministic with 300 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (276 resets) in 2056 ms. (19 steps per ms) remains 6/31 properties
BEST_FIRST walk for 40004 steps (35 resets) in 220 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 215 ms. (185 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (37 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (33 resets) in 202 ms. (197 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (35 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (33 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
[2025-06-03 15:10:36] [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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 286/293 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 300/593 variables, 293/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/594 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/594 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 311 constraints, problems are : Problem set: 0 solved, 5 unsolved in 945 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 286/293 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 300/593 variables, 293/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/594 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/594 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 594/594 variables, and 316 constraints, problems are : Problem set: 0 solved, 5 unsolved in 847 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1812ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 284 ms.
Support contains 2 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 300/300 transitions.
Graph (complete) has 453 edges and 294 vertex of which 274 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 141 rules applied. Total rules applied 142 place count 274 transition count 156
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 150 rules applied. Total rules applied 292 place count 134 transition count 146
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 297 place count 129 transition count 146
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 297 place count 129 transition count 112
Deduced a syphon composed of 34 places in 13 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 365 place count 95 transition count 112
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 381 place count 79 transition count 96
Iterating global reduction 3 with 16 rules applied. Total rules applied 397 place count 79 transition count 96
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 397 place count 79 transition count 95
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 399 place count 78 transition count 95
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 503 place count 26 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 504 place count 26 transition count 42
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 519 place count 11 transition count 12
Iterating global reduction 4 with 15 rules applied. Total rules applied 534 place count 11 transition count 12
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 536 place count 10 transition count 11
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 538 place count 9 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 539 place count 9 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 540 place count 8 transition count 10
Applied a total of 540 rules in 102 ms. Remains 8 /294 variables (removed 286) and now considering 10/300 (removed 290) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 8/294 places, 10/300 transitions.
RANDOM walk for 40030 steps (1376 resets) in 176 ms. (226 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (388 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Probably explored full state space saw : 865 states, properties seen :0
Probabilistic random walk after 2273 steps, saw 865 distinct states, run finished after 29 ms. (steps per millisecond=78 ) properties seen :0
Explored full state space saw : 865 states, properties seen :0
Exhaustive walk after 2273 steps, saw 865 distinct states, run finished after 4 ms. (steps per millisecond=568 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 57 stabilizing places and 57 stable transitions
Graph (complete) has 453 edges and 294 vertex of which 274 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.20 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(p0) U (p1&&X(p0)))))'
Support contains 2 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 300/300 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 284 transition count 290
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 284 transition count 290
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 284 transition count 287
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 281 transition count 284
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 281 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 281 transition count 283
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 280 transition count 282
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 280 transition count 282
Applied a total of 32 rules in 64 ms. Remains 280 /294 variables (removed 14) and now considering 282/300 (removed 18) transitions.
// Phase 1: matrix 282 rows 280 cols
[2025-06-03 15:10:39] [INFO ] Computed 17 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:10:39] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-06-03 15:10:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:10:40] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-03 15:10:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 1/562 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/562 variables, and 297 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 281/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 1/562 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 578 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 280/294 places, 282/300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61089 ms. Remains : 280/294 places, 282/300 transitions.
Stuttering acceptance computed with spot in 466 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-00 finished in 61675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(F(p2)&&p1))))'
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 300/300 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 286 transition count 292
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 286 transition count 292
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 286 transition count 289
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 283 transition count 286
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 283 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 283 transition count 285
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 282 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 282 transition count 284
Applied a total of 28 rules in 72 ms. Remains 282 /294 variables (removed 12) and now considering 284/300 (removed 16) transitions.
// Phase 1: matrix 284 rows 282 cols
[2025-06-03 15:11:41] [INFO ] Computed 17 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:11:41] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-06-03 15:11:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:11:41] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2025-06-03 15:11:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 284/565 variables, 281/298 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/565 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 1/566 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/566 variables, and 299 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 284/565 variables, 281/298 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/565 variables, 283/581 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (OVERLAPS) 1/566 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 582 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in LTL mode, iteration 1 : 282/294 places, 284/300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60794 ms. Remains : 282/294 places, 284/300 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-01
Product exploration explored 100000 steps with 684 reset in 548 ms.
Product exploration explored 100000 steps with 695 reset in 402 ms.
Computed a total of 53 stabilizing places and 53 stable transitions
Graph (complete) has 437 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.7 ms
Computed a total of 53 stabilizing places and 53 stable transitions
Detected a total of 53/282 stabilizing places and 53/284 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 966 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
RANDOM walk for 143 steps (0 resets) in 6 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 11 factoid took 1806 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 75 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 1 out of 282 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 : 282/282 places, 284/284 transitions.
Graph (trivial) has 229 edges and 282 vertex of which 6 / 282 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 431 edges and 277 vertex of which 257 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 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 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 256 transition count 146
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 258 place count 128 transition count 146
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 258 place count 128 transition count 108
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 334 place count 90 transition count 108
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 349 place count 75 transition count 93
Iterating global reduction 2 with 15 rules applied. Total rules applied 364 place count 75 transition count 93
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 456 place count 29 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 457 place count 29 transition count 46
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 473 place count 13 transition count 15
Iterating global reduction 3 with 16 rules applied. Total rules applied 489 place count 13 transition count 15
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 3 with 2 rules applied. Total rules applied 491 place count 12 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 492 place count 11 transition count 13
Applied a total of 492 rules in 82 ms. Remains 11 /282 variables (removed 271) and now considering 13/284 (removed 271) transitions.
// Phase 1: matrix 13 rows 11 cols
[2025-06-03 15:12:46] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:12:46] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-03 15:12:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:12:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 15:12:46] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:12:46] [INFO ] Redundant transitions in 21 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-03 15:12:46] [INFO ] Invariant cache hit.
[2025-06-03 15:12: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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/23 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/24 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 12 constraints, problems are : Problem set: 0 solved, 9 unsolved in 283 ms.
Refiners :[State Equation: 11/11 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 21 constraints, problems are : Problem set: 0 solved, 9 unsolved in 253 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 550ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 550ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/282 places, 13/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 763 ms. Remains : 11/282 places, 13/284 transitions.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Detected a total of 9/11 stabilizing places and 9/13 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 198 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 50 ms :[(NOT p0)]
RANDOM walk for 17 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 40 steps with 4 reset in 1 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-01 finished in 66507 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)&&F(G(p1)))))'
Support contains 2 out of 294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 294/294 places, 300/300 transitions.
Graph (trivial) has 247 edges and 294 vertex of which 6 / 294 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 447 edges and 289 vertex of which 269 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 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 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 139 place count 268 transition count 153
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 144 rules applied. Total rules applied 283 place count 131 transition count 146
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 287 place count 128 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 288 place count 127 transition count 145
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 288 place count 127 transition count 111
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 356 place count 93 transition count 111
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 372 place count 77 transition count 95
Iterating global reduction 4 with 16 rules applied. Total rules applied 388 place count 77 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 388 place count 77 transition count 94
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 390 place count 76 transition count 94
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 488 place count 27 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 489 place count 27 transition count 44
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 504 place count 12 transition count 15
Iterating global reduction 5 with 15 rules applied. Total rules applied 519 place count 12 transition count 15
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 521 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 522 place count 10 transition count 13
Applied a total of 522 rules in 39 ms. Remains 10 /294 variables (removed 284) and now considering 13/300 (removed 287) transitions.
// Phase 1: matrix 13 rows 10 cols
[2025-06-03 15:12:47] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:12:47] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-03 15:12:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:12:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 15:12:47] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:12:47] [INFO ] Redundant transitions in 19 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-03 15:12:47] [INFO ] Invariant cache hit.
[2025-06-03 15:12:47] [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) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/23 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 11 constraints, problems are : Problem set: 0 solved, 9 unsolved in 264 ms.
Refiners :[State Equation: 10/10 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) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 292 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 561ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/294 places, 13/300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 704 ms. Remains : 10/294 places, 13/300 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-02
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-02 finished in 894 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((X((X(G(p0))&&F(p1)))||F(p2))) U (p3&&G((X((X(G(p0))&&F(p1)))||F(p2)))))))'
Support contains 4 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 300/300 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 286 transition count 292
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 286 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 286 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 284 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 284 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 283 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 283 transition count 287
Applied a total of 24 rules in 32 ms. Remains 283 /294 variables (removed 11) and now considering 287/300 (removed 13) transitions.
// Phase 1: matrix 287 rows 283 cols
[2025-06-03 15:12:48] [INFO ] Computed 17 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:12:48] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-03 15:12:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:12:49] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-06-03 15:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 287/569 variables, 282/299 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 1/570 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 286 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 570/570 variables, and 300 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 287/569 variables, 282/299 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 286/585 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (OVERLAPS) 1/570 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 586 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Starting structural reductions in LTL mode, iteration 1 : 283/294 places, 287/300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60860 ms. Remains : 283/294 places, 287/300 transitions.
Stuttering acceptance computed with spot in 515 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-03
Product exploration explored 100000 steps with 813 reset in 381 ms.
Product exploration explored 100000 steps with 819 reset in 347 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 440 edges and 283 vertex of which 263 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Computed a total of 51 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X (NOT p3)), (X p2), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (272 resets) in 403 ms. (99 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (35 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (37 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (34 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
[2025-06-03 15:13:51] [INFO ] Invariant cache hit.
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) 72/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 207/282 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 287/569 variables, 282/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/570 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 300 constraints, problems are : Problem set: 0 solved, 3 unsolved in 736 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 207/282 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 287/569 variables, 282/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/570 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/570 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 303 constraints, problems are : Problem set: 0 solved, 3 unsolved in 674 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1421ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 102 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=34 )
Parikh walk visited 3 properties in 11 ms.
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X (NOT p3)), (X p2), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 (NOT p0)))), (F (NOT p1)), (F (NOT p2)), (F p3), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 7 factoid took 437 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 441 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 433 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
[2025-06-03 15:13:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 15:13:54] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 15 ms returned sat
[2025-06-03 15:13:54] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2025-06-03 15:13:54] [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 15:13:55] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 14 ms returned sat
[2025-06-03 15:13:55] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2025-06-03 15:13:55] [INFO ] Computed and/alt/rep : 281/370/281 causal constraints (skipped 5 transitions) in 22 ms.
[2025-06-03 15:13:57] [INFO ] Added : 255 causal constraints over 51 iterations in 2272 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 287/287 transitions.
Applied a total of 0 rules in 6 ms. Remains 283 /283 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2025-06-03 15:13:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:13:57] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-03 15:13:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:13:58] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-06-03 15:13:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 287/569 variables, 282/299 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 1/570 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 300 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 287/569 variables, 282/299 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 286/585 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (OVERLAPS) 1/570 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 586 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Finished structural reductions in LTL mode , in 1 iterations and 60755 ms. Remains : 283/283 places, 287/287 transitions.
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 440 edges and 283 vertex of which 263 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.6 ms
Computed a total of 51 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X (NOT p3)), (X p2), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 206 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 451 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (278 resets) in 198 ms. (201 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (32 resets) in 60 ms. (655 steps per ms) remains 2/3 properties
BEST_FIRST walk for 31899 steps (24 resets) in 58 ms. (540 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X (NOT p3)), (X p2), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 (NOT p0)))), (F (NOT p1)), (F (NOT p2)), (F p3), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 7 factoid took 439 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
[2025-06-03 15:15:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 15:15:00] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 16 ms returned sat
[2025-06-03 15:15:01] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2025-06-03 15:15:01] [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 15:15:01] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 16 ms returned sat
[2025-06-03 15:15:01] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2025-06-03 15:15:01] [INFO ] Computed and/alt/rep : 281/370/281 causal constraints (skipped 5 transitions) in 35 ms.
[2025-06-03 15:15:04] [INFO ] Added : 255 causal constraints over 51 iterations in 2365 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 820 reset in 200 ms.
Product exploration explored 100000 steps with 818 reset in 249 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 287/287 transitions.
Graph (trivial) has 228 edges and 283 vertex of which 6 / 283 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 434 edges and 278 vertex of which 258 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 258 transition count 278
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 17 Pre rules applied. Total rules applied 129 place count 258 transition count 281
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 146 place count 258 transition count 281
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 236 place count 168 transition count 191
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 326 place count 168 transition count 191
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 341 place count 153 transition count 176
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 356 place count 153 transition count 176
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 106 places in 1 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 408 place count 153 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 410 place count 153 transition count 175
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 447 place count 116 transition count 137
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 484 place count 116 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 485 place count 116 transition count 137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 486 place count 115 transition count 136
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 487 place count 115 transition count 136
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 504 place count 115 transition count 187
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 533 place count 86 transition count 129
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 562 place count 86 transition count 129
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 598 place count 50 transition count 69
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 634 place count 50 transition count 69
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 634 rules in 84 ms. Remains 50 /283 variables (removed 233) and now considering 69/287 (removed 218) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:15:05] [INFO ] Redundant transitions in 20 ms returned []
Running 68 sub problems to find dead transitions.
[2025-06-03 15:15:05] [INFO ] Flow matrix only has 68 transitions (discarded 1 similar events)
// Phase 1: matrix 68 rows 50 cols
[2025-06-03 15:15:05] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 15:15:05] [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/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD8 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 TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 1 (OVERLAPS) 67/116 variables, 49/49 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 14/63 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/63 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/117 variables, 1/64 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/64 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 1/118 variables, 1/65 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/65 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/65 constraints. Problems are: Problem set: 43 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 65 constraints, problems are : Problem set: 43 solved, 25 unsolved in 1557 ms.
Refiners :[State Equation: 50/50 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 43 solved, 25 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: 43 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 66/82 variables, 16/16 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 14/30 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 25/55 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/55 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 35/117 variables, 34/89 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/89 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 1/118 variables, 1/90 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/90 constraints. Problems are: Problem set: 43 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/118 variables, 0/90 constraints. Problems are: Problem set: 43 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 90 constraints, problems are : Problem set: 43 solved, 25 unsolved in 1879 ms.
Refiners :[State Equation: 50/50 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 25/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3449ms problems are : Problem set: 43 solved, 25 unsolved
Search for dead transitions found 43 dead transitions in 3451ms
Found 43 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 43 transitions
Dead transitions reduction (with SMT) removed 43 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 50/283 places, 26/287 transitions.
Graph (complete) has 56 edges and 50 vertex of which 17 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 17 /50 variables (removed 33) and now considering 26/26 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/283 places, 26/287 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3566 ms. Remains : 17/283 places, 26/287 transitions.
Built C files in :
/tmp/ltsmin2041987960080742391
[2025-06-03 15:15:09] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2041987960080742391
Running compilation step : cd /tmp/ltsmin2041987960080742391;'/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 1378 ms.
Running link step : cd /tmp/ltsmin2041987960080742391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin2041987960080742391;'/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/stateBased55879222751915559.hoa' '--buchi-type=spotba'
LTSmin run took 643 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-03 finished in 143220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 294/294 places, 300/300 transitions.
Graph (trivial) has 246 edges and 294 vertex of which 6 / 294 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 447 edges and 289 vertex of which 269 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 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 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 268 transition count 152
Reduce places removed 138 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 144 rules applied. Total rules applied 284 place count 130 transition count 146
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 287 place count 128 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 288 place count 127 transition count 145
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 288 place count 127 transition count 110
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 358 place count 92 transition count 110
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 374 place count 76 transition count 94
Iterating global reduction 4 with 16 rules applied. Total rules applied 390 place count 76 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 390 place count 76 transition count 93
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 392 place count 75 transition count 93
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 492 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 493 place count 25 transition count 42
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 508 place count 10 transition count 13
Iterating global reduction 5 with 15 rules applied. Total rules applied 523 place count 10 transition count 13
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 525 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 526 place count 8 transition count 11
Applied a total of 526 rules in 34 ms. Remains 8 /294 variables (removed 286) and now considering 11/300 (removed 289) transitions.
// Phase 1: matrix 11 rows 8 cols
[2025-06-03 15:15:11] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:15:11] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-03 15:15:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:15:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 15:15:11] [INFO ] Implicit Places using invariants and state equation in 34 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 15:15:11] [INFO ] Redundant transitions in 18 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-03 15:15:11] [INFO ] Invariant cache hit.
[2025-06-03 15:15: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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 193 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 194 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 393ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 393ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/294 places, 11/300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 517 ms. Remains : 8/294 places, 11/300 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-04 finished in 581 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) U p1) U G(p2)) U (p3&&((F(p0) U p1) U G(p2))))))'
Support contains 4 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 300/300 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 286 transition count 292
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 286 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 286 transition count 291
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 283 transition count 288
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 283 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 283 transition count 287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 282 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 282 transition count 286
Applied a total of 26 rules in 26 ms. Remains 282 /294 variables (removed 12) and now considering 286/300 (removed 14) transitions.
// Phase 1: matrix 286 rows 282 cols
[2025-06-03 15:15:12] [INFO ] Computed 17 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:15:12] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-03 15:15:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:15:12] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2025-06-03 15:15:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 286/567 variables, 281/298 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 1/568 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 7.0)
(t4 0.0)
(t5 1.0)
(t6 7.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 7.0)
(t12 1.0)
(t13 1.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 6.0)
(t18 6.0)
(t19 0.0)
(t20 0.0)
(t21 6.0)
(t22 1.0)
(t23 7.0)
(t24 0.0)
(t25 1.0)
(t26 1.0)
(t27 1.0)
(t28 1.0)
(t29 1.0)
(t30 1.0)
(t31 1.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 1.0)
(t36 1.0)
(t37 1.0)
(t38 0.0)
(t39 1.0)
(t40 1.0)
(t41 1.0)
(t42 1.0)
(t43 1.0)
(t44 1.0)
(t45 1.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 1.0)
(t50 1.0)
(t51 1.0)
(t52 0.0)
(t53 1.0)
(t54 1.0)
(t55 1.0)
(t56 1.0)
(t57 1.0)
(t58 1.0)
(t59 1.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 1.0)
(t64 1.0)
(t65 1.0)
(t66 0.0)
(t67 1.0)
(t68 1.0)
(t69 1.0)
(t70 1.0)
(t71 1.0)
(t72 1.0)
(t73 1.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 1.0)
(t78 1.0)
(t79 1.0)
(t80 0.0)
(t81 1.0)
(t82 1.0)
(t83 1.0)
(t84 1.0)
(t85 1.0)
(t86 1.0)
(t87 1.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 1.0)
(t92 1.0)
(t93 1.0)
(t94 0.0)
(t95 1.0)
(t96 1.0)
(t97 1.0)
(t98 1.0)
(t99 1.0)
(t100 1.0)
(t101 1.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 1.0)
(t106 1.0)
(t107 1.0)
(t108 0.0)
(t109 1.0)
(t110 1.0)
(t111 1.0)
(t112 1.0)
(t113 1.0)
(t114 1.0)
(t115 1.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 1.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 1.0)
(t124 1.0)
(t125 1.0)
(t126 1.0)
(t127 1.0)
(t128 1.0)
(t129 1.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 1.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 1.0)
(t138 1.0)
(t139 1.0)
(t140 1.0)
(t141 1.0)
(t142 1.0)
(t143 1.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 1.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 1.0)
(t152 1.0)
(t153 1.0)
(t154 1.0)
(t155 1.0)
(t156 1.0)
(t157 1.0)
(t158 0.0)
(t159 0.0)
(t160 0.0)
(t161 1.0)
(t162 0.0)
(t163 0.0)
(t164 0.0)
(t165 1.0)
(t166 1.0)
(t167 1.0)
(t168 1.0)
(t169 1.0)
(t170 1.0)
(t171 1.0)
(t172 0.0)
(t173 0.0)
(t174 0.0)
(t175 0.0)
(t176 0.0)
(t177 1.0)
(t178 0.0)
(t179 0.0)
(t180 0.0)
(t181 1.0)
(t182 1.0)
(t183 1.0)
(t184 1.0)
(t185 1.0)
(t186 1.0)
(t187 1.0)
(t188 0.0)
(t189 0.0)
(t190 0.0)
(t191 1.0)
(t192 0.0)
(t193 0.0)
(t194 0.0)
(t195 1.0)
(t196 1.0)
(t197 1.0)
(t198 1.0)
(t199 1.0)
(t200 1.0)
(t201 1.0)
(t202 0.0)
(t203 0.0)
(t204 0.0)
(t205 1.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 1.0)
(t210 1.0)
(t211 1.0)
(t212 1.0)
(t213 1.0)
(t214 1.0)
(t215 1.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 0.0)
(t221 1.0)
(t222 0.0)
(t223 0.0)
(t224 0.0)
(t225 1.0)
(t226 1.0)
(t227 1.0)
(t228 1.0)
(t229 1.0)
(t230 1.0)
(t231 1.0)
(t232 0.0)
(t233 0.0)
(t234 0.0)
(t235 1.0)
(t236 0.0)
(t237 0.0)
(t238 0.0)
(t239 1.0)
(t240 1.0)
(t241 1.0)
(t242 1.0)
(t243 1.0)
(t244 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/568 variables, and 299 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 286/567 variables, 281/298 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 285/583 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 1/568 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 14)
(t4 0)
(t5 1)
(t6 14)
(t7 0)
(t8 0)
(t9 0)
(t10 0)
(t11 15)
(t12 1)
(t13 1)
(t14 1)
(t15 1)
(t16 1)
(t17 15)
(t18 15)
(t19 0)
(t20 1)
(t21 14)
(t22 1)
(t23 15)
(t24 0)
(t25 1)
(t26 0)
(t27 0)
(t28 1)
(t29 1)
(t30 1)
(t31 1)
(t32 0)
(t33 0)
(t34 1)
(t35 1)
(t36 1)
(t37 1)
(t38 1)
(t39 1)
(t40 0)
(t41 0)
(t42 1)
(t43 1)
(t44 1)
(t45 1)
(t46 0)
(t47 0)
(t48 1)
(t49 1)
(t50 1)
(t51 1)
(t52 1)
(t53 1)
(t54 0)
(t55 0)
(t56 1)
(t57 1)
(t58 1)
(t59 1)
(t60 0)
(t61 0)
(t62 1)
(t63 1)
(t64 1)
(t65 1)
(t66 1)
(t67 1)
(t68 0)
(t69 0)
(t70 1)
(t71 1)
(t72 1)
(t73 1)
(t74 0)
(t75 0)
(t76 1)
(t77 1)
(t78 1)
(t79 1)
(t80 1)
(t81 1)
(t82 0)
(t83 0)
(t84 1)
(t85 1)
(t86 1)
(t87 1)
(t88 0)
(t89 0)
(t90 1)
(t91 1)
(t92 1)
(t93 1)
(t94 1)
(t95 1)
(t96 0)
(t97 0)
(t98 1)
(t99 1)
(t100 1)
(t101 1)
(t102 0)
(t103 0)
(t104 1)
(t105 1)
(t106 1)
(t107 1)
(t108 1)
(t109 1)
(t110 0)
(t111 0)
(t112 1)
(t113 1)
(t114 1)
(t115 1)
(t116 0)
(t117 0)
(t118 1)
(t119 1)
(t120 1)
(t121 1)
(t122 1)
(t123 1)
(t124 0)
(t125 0)
(t126 1)
(t127 1)
(t128 1)
(t129 1)
(t130 0)
(t131 0)
(t132 1)
(t133 1)
(t134 1)
(t135 1)
(t136 1)
(t137 1)
(t138 0)
(t139 0)
(t140 1)
(t141 1)
(t142 1)
(t143 1)
(t144 0)
(t145 0)
(t146 1)
(t147 1)
(t148 1)
(t149 1)
(t150 1)
(t151 1)
(t152 0)
(t153 0)
(t154 1)
(t155 1)
(t156 1)
(t157 1)
(t158 0)
(t159 0)
(t160 1)
(t161 1)
(t162 1)
(t163 1)
(t164 1)
(t165 1)
(t166 0)
(t167 0)
(t168 1)
(t169 1)
(t170 1)
(t171 1)
(t172 1)
(t173 1)
(t174 0)
(t175 0)
(t176 1)
(t177 1)
(t178 0)
(t179 0)
(t180 1)
(t181 1)
(t182 1)
(t183 1)
(t184 1)
(t185 1)
(t186 1)
(t187 1)
(t188 0)
(t189 0)
(t190 0)
(t191 1)
(t192 1)
(t193 1)
(t194 1)
(t195 0)
(t196 0)
(t197 0)
(t198 1)
(t199 1)
(t200 1)
(t201 1)
(t202 0)
(t203 0)
(t204 1)
(t205 1)
(t206 1)
(t207 1)
(t208 1)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 0)
(t218 0)
(t219 0)
(t220 0)
(t221 0)
(t222 0)
(t223 0)
(t224 0)
(t225 0)
(t226 0)
(t227 0)
(t228 1)
(t229 1)
(t230 1)
(t231 1)
(t232 0)
(t233 0)
(t234 1)
(t235 1)
(t236 1)
(t237 1)
(t238 1)
(t239 0)
(t240 0)
(t241 1)
(t242 1)
(t243 1)
(t244 1)
(t245 0)
(t246 0)
(t247 1)
(t248 1)
(t249 1)
(t250 1)
(t251 1)
(t252 0)
(t253 0)
(t254 0)
(t255 0)
(t256 0)
(t257 0)
(t258 0)
(t259 0)
(t260 0)
(t261 0)
(t262 0)
(t263 0)
(t264 0)
(t265 0)
(t266 0)
(t267 0)
(t268 0)
(t269 0)
(t270 1)
(t271 1)
(t272 1)
(t273 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 584 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 282/294 places, 286/300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60749 ms. Remains : 282/294 places, 286/300 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-05
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-05 finished in 61169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(p1)&&(G(p2)||G(p3)))||p0))))'
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 300/300 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 284 transition count 290
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 284 transition count 290
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 284 transition count 287
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 281 transition count 284
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 281 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 281 transition count 283
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 280 transition count 282
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 280 transition count 282
Applied a total of 32 rules in 24 ms. Remains 280 /294 variables (removed 14) and now considering 282/300 (removed 18) transitions.
// Phase 1: matrix 282 rows 280 cols
[2025-06-03 15:16:13] [INFO ] Computed 17 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:16:13] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-03 15:16:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:16:14] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-03 15:16: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/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 1/562 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/562 variables, and 297 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 281/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 1/562 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 578 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 280/294 places, 282/300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60720 ms. Remains : 280/294 places, 282/300 transitions.
Stuttering acceptance computed with spot in 417 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 197 ms.
Product exploration explored 100000 steps with 33333 reset in 203 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 435 edges and 280 vertex of which 260 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Computed a total of 51 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND p0 p2 p3 p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 23 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-16b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-09 finished in 61601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 294/294 places, 300/300 transitions.
Graph (trivial) has 247 edges and 294 vertex of which 6 / 294 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 447 edges and 289 vertex of which 269 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 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 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 268 transition count 152
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 145 rules applied. Total rules applied 285 place count 130 transition count 145
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 288 place count 127 transition count 145
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 288 place count 127 transition count 110
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 358 place count 92 transition count 110
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 374 place count 76 transition count 94
Iterating global reduction 3 with 16 rules applied. Total rules applied 390 place count 76 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 390 place count 76 transition count 93
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 392 place count 75 transition count 93
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 492 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 493 place count 25 transition count 42
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 508 place count 10 transition count 13
Iterating global reduction 4 with 15 rules applied. Total rules applied 523 place count 10 transition count 13
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 525 place count 9 transition count 12
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 526 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 527 place count 8 transition count 11
Applied a total of 527 rules in 23 ms. Remains 8 /294 variables (removed 286) and now considering 11/300 (removed 289) transitions.
// Phase 1: matrix 11 rows 8 cols
[2025-06-03 15:17:14] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:17:15] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-03 15:17:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:17:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 15:17:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:17:15] [INFO ] Redundant transitions in 16 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-03 15:17:15] [INFO ] Invariant cache hit.
[2025-06-03 15:17:15] [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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 153 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 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 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 162 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 320ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 321ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/294 places, 11/300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 8/294 places, 11/300 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-10 finished in 557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 294/294 places, 300/300 transitions.
Graph (trivial) has 245 edges and 294 vertex of which 6 / 294 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 447 edges and 289 vertex of which 269 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 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 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 138 place count 268 transition count 154
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 143 rules applied. Total rules applied 281 place count 132 transition count 147
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 284 place count 129 transition count 147
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 284 place count 129 transition count 111
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 356 place count 93 transition count 111
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 371 place count 78 transition count 96
Iterating global reduction 3 with 15 rules applied. Total rules applied 386 place count 78 transition count 96
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 488 place count 27 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 489 place count 27 transition count 44
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 504 place count 12 transition count 15
Iterating global reduction 4 with 15 rules applied. Total rules applied 519 place count 12 transition count 15
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 521 place count 11 transition count 14
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 522 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 523 place count 10 transition count 13
Applied a total of 523 rules in 25 ms. Remains 10 /294 variables (removed 284) and now considering 13/300 (removed 287) transitions.
[2025-06-03 15:17:15] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 10 cols
[2025-06-03 15:17:15] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:17:15] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 15:17:15] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2025-06-03 15:17:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:17:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 15:17:15] [INFO ] Implicit Places using invariants and state equation in 34 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 15:17:15] [INFO ] Redundant transitions in 20 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-03 15:17:15] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2025-06-03 15:17:15] [INFO ] Invariant cache hit.
[2025-06-03 15:17:15] [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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/21 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/22 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 11 constraints, problems are : Problem set: 0 solved, 8 unsolved in 219 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/21 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/22 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 239 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 462ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 462ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/294 places, 13/300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 576 ms. Remains : 10/294 places, 13/300 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-12 finished in 640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p1))||(F(!p1)&&G(!p2))||p0))))'
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 300/300 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 285 transition count 291
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 285 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 285 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 282 transition count 285
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 282 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 282 transition count 284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 281 transition count 283
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 281 transition count 283
Applied a total of 30 rules in 24 ms. Remains 281 /294 variables (removed 13) and now considering 283/300 (removed 17) transitions.
// Phase 1: matrix 283 rows 281 cols
[2025-06-03 15:17:16] [INFO ] Computed 17 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:17:16] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-03 15:17:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:17:16] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2025-06-03 15:17:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 283/563 variables, 280/297 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 1/564 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 298 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 283/563 variables, 280/297 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 282/579 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 1/564 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/564 variables, and 580 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 281/294 places, 283/300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60759 ms. Remains : 281/294 places, 283/300 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p1)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Computed a total of 52 stabilizing places and 52 stable transitions
Graph (complete) has 436 edges and 281 vertex of which 261 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Computed a total of 52 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 23 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-16b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-14 finished in 61500 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&&(p1 U X(p0))) U (p2||X((p3 U p4)))))'
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 300/300 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 284 transition count 290
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 284 transition count 290
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 284 transition count 287
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 281 transition count 284
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 281 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 281 transition count 283
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 280 transition count 282
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 280 transition count 282
Applied a total of 32 rules in 27 ms. Remains 280 /294 variables (removed 14) and now considering 282/300 (removed 18) transitions.
// Phase 1: matrix 282 rows 280 cols
[2025-06-03 15:18:17] [INFO ] Computed 17 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:18:17] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-03 15:18:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:18:18] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-03 15:18:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 1/562 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 281 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 562/562 variables, and 297 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 281/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 1/562 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 578 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Starting structural reductions in LTL mode, iteration 1 : 280/294 places, 282/300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60773 ms. Remains : 280/294 places, 282/300 transitions.
Stuttering acceptance computed with spot in 469 ms :[(AND (NOT p2) (NOT p4)), (NOT p4), (AND (NOT p0) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p0) (NOT p4)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-15 finished in 61284 ms.
All properties solved by simple procedures.
Total runtime 587122 ms.
BK_STOP 1748963959022
--------------------
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-16b"
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-16b, 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-174867007900436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-16b.tgz
mv GPUForwardProgress-PT-16b 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 ;