About the Execution of ITS-Tools for Champagne-PT-H10T1U
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1911047.00 | 0.00 | 0.00 | TFFFTFFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339400156.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 Champagne-PT-H10T1U, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339400156
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 7.3K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 11:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 6 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Jun 6 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 443K Jun 5 20:08 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 Champagne-PT-H10T1U-LTLFireability-00
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-01
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-02
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-03
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-04
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-05
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-06
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-07
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-08
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-09
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-10
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-11
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-12
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-13
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-14
FORMULA_NAME Champagne-PT-H10T1U-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749335294801
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H10T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 22:28:15] [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-07 22:28:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 22:28:16] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2025-06-07 22:28:16] [INFO ] Transformed 1637 places.
[2025-06-07 22:28:16] [INFO ] Transformed 2633 transitions.
[2025-06-07 22:28:16] [INFO ] Found NUPN structural information;
[2025-06-07 22:28:16] [INFO ] Parsed PT model containing 1637 places and 2633 transitions and 7256 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H10T1U-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 1637 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1637/1637 places, 2633/2633 transitions.
Discarding 373 places :
Symmetric choice reduction at 0 with 373 rule applications. Total rules 373 place count 1264 transition count 2260
Iterating global reduction 0 with 373 rules applied. Total rules applied 746 place count 1264 transition count 2260
Discarding 243 places :
Symmetric choice reduction at 0 with 243 rule applications. Total rules 989 place count 1021 transition count 2017
Iterating global reduction 0 with 243 rules applied. Total rules applied 1232 place count 1021 transition count 2017
Discarding 132 places :
Symmetric choice reduction at 0 with 132 rule applications. Total rules 1364 place count 889 transition count 1885
Iterating global reduction 0 with 132 rules applied. Total rules applied 1496 place count 889 transition count 1885
Applied a total of 1496 rules in 332 ms. Remains 889 /1637 variables (removed 748) and now considering 1885/2633 (removed 748) transitions.
// Phase 1: matrix 1885 rows 889 cols
[2025-06-07 22:28:16] [INFO ] Computed 63 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:28:17] [INFO ] Implicit Places using invariants in 638 ms returned []
[2025-06-07 22:28:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:28:18] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Running 1884 sub problems to find dead transitions.
[2025-06-07 22:28:23] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 timeout
1.0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 888/2774 variables, and 0 constraints, problems are : Problem set: 0 solved, 1884 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/889 constraints, PredecessorRefiner: 1884/1883 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1884 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 888/2774 variables, and 0 constraints, problems are : Problem set: 0 solved, 1884 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/889 constraints, PredecessorRefiner: 1/1883 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60849ms problems are : Problem set: 0 solved, 1884 unsolved
Search for dead transitions found 0 dead transitions in 65698ms
Starting structural reductions in LTL mode, iteration 1 : 889/1637 places, 1885/2633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67520 ms. Remains : 889/1637 places, 1885/2633 transitions.
Support contains 39 out of 889 places after structural reductions.
[2025-06-07 22:29:24] [INFO ] Flatten gal took : 126 ms
[2025-06-07 22:29:24] [INFO ] Flatten gal took : 78 ms
[2025-06-07 22:29:24] [INFO ] Input system was already deterministic with 1885 transitions.
RANDOM walk for 40000 steps (30 resets) in 1809 ms. (22 steps per ms) remains 2/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
[2025-06-07 22:29:25] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 829/889 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/889 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2774 variables, 889/952 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2774 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2774 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2774/2774 variables, and 952 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 889/889 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 829/889 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/889 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2774 variables, 889/952 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2774 variables, 2/954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2774 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2774 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2774/2774 variables, and 954 constraints, problems are : Problem set: 0 solved, 2 unsolved in 866 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 889/889 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1893ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 324 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=64 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 11 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 66 stabilizing places and 66 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||X(F(p2)))))'
Support contains 4 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 877 transition count 1873
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 877 transition count 1873
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 871 transition count 1867
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 871 transition count 1867
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 868 transition count 1864
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 868 transition count 1864
Applied a total of 42 rules in 73 ms. Remains 868 /889 variables (removed 21) and now considering 1864/1885 (removed 21) transitions.
// Phase 1: matrix 1864 rows 868 cols
[2025-06-07 22:29:27] [INFO ] Computed 63 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:29:28] [INFO ] Implicit Places using invariants in 307 ms returned []
[2025-06-07 22:29:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:29:28] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
Running 1863 sub problems to find dead transitions.
[2025-06-07 22:29:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 867/2732 variables, and 0 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/868 constraints, PredecessorRefiner: 1863/1862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1863 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 867/2732 variables, and 0 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/868 constraints, PredecessorRefiner: 1/1862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60603ms problems are : Problem set: 0 solved, 1863 unsolved
Search for dead transitions found 0 dead transitions in 60609ms
Starting structural reductions in LTL mode, iteration 1 : 868/889 places, 1864/1885 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61708 ms. Remains : 868/889 places, 1864/1885 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 377 ms.
Product exploration explored 100000 steps with 33333 reset in 271 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/868 stabilizing places and 62/1864 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H10T1U-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H10T1U-LTLFireability-00 finished in 62693 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||G(p1)))))'
Support contains 2 out of 889 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Graph (trivial) has 916 edges and 889 vertex of which 447 / 889 are part of one of the 61 SCC in 6 ms
Free SCC test removed 386 places
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 502 transition count 1395
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 1 with 193 rules applied. Total rules applied 265 place count 431 transition count 1273
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 326 place count 370 transition count 1273
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 326 place count 370 transition count 1270
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 332 place count 367 transition count 1270
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 381 place count 318 transition count 874
Iterating global reduction 3 with 49 rules applied. Total rules applied 430 place count 318 transition count 874
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 473 place count 318 transition count 831
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 731 place count 189 transition count 702
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 735 place count 185 transition count 662
Iterating global reduction 4 with 4 rules applied. Total rules applied 739 place count 185 transition count 662
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 743 place count 185 transition count 658
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 747 place count 183 transition count 677
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 768 place count 183 transition count 656
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 769 place count 182 transition count 649
Iterating global reduction 5 with 1 rules applied. Total rules applied 770 place count 182 transition count 649
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 771 place count 182 transition count 648
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 773 place count 180 transition count 646
Applied a total of 773 rules in 195 ms. Remains 180 /889 variables (removed 709) and now considering 646/1885 (removed 1239) transitions.
[2025-06-07 22:30:30] [INFO ] Flow matrix only has 171 transitions (discarded 475 similar events)
// Phase 1: matrix 171 rows 180 cols
[2025-06-07 22:30:30] [INFO ] Computed 63 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:30:30] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-07 22:30:30] [INFO ] Flow matrix only has 171 transitions (discarded 475 similar events)
[2025-06-07 22:30:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:30:30] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 22:30:30] [INFO ] Redundant transitions in 36 ms returned []
Running 470 sub problems to find dead transitions.
[2025-06-07 22:30:30] [INFO ] Flow matrix only has 171 transitions (discarded 475 similar events)
[2025-06-07 22:30:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 2/180 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 170/350 variables, 180/243 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (OVERLAPS) 0/350 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 470 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/351 variables, and 243 constraints, problems are : Problem set: 0 solved, 470 unsolved in 21141 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 470/469 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 2/180 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 170/350 variables, 180/243 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 469/712 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 7 (OVERLAPS) 0/350 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 470 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/351 variables, and 712 constraints, problems are : Problem set: 0 solved, 470 unsolved in 22670 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 470/469 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43873ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 43874ms
Starting structural reductions in SI_LTL mode, iteration 1 : 180/889 places, 646/1885 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44408 ms. Remains : 180/889 places, 646/1885 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-01
Stuttering criterion allowed to conclude after 294 steps with 2 reset in 9 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-01 finished in 44529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 889 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Graph (trivial) has 915 edges and 889 vertex of which 454 / 889 are part of one of the 62 SCC in 1 ms
Free SCC test removed 392 places
Ensure Unique test removed 424 transitions
Reduce isomorphic transitions removed 424 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 496 transition count 1389
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 1 with 193 rules applied. Total rules applied 265 place count 425 transition count 1267
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 326 place count 364 transition count 1267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 326 place count 364 transition count 1266
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 328 place count 363 transition count 1266
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 376 place count 315 transition count 895
Iterating global reduction 3 with 48 rules applied. Total rules applied 424 place count 315 transition count 895
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 465 place count 315 transition count 854
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 4 with 256 rules applied. Total rules applied 721 place count 187 transition count 726
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 727 place count 181 transition count 665
Iterating global reduction 4 with 6 rules applied. Total rules applied 733 place count 181 transition count 665
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 739 place count 181 transition count 659
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 741 place count 180 transition count 672
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 755 place count 180 transition count 658
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 756 place count 179 transition count 644
Iterating global reduction 5 with 1 rules applied. Total rules applied 757 place count 179 transition count 644
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 758 place count 179 transition count 643
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 760 place count 177 transition count 641
Applied a total of 760 rules in 143 ms. Remains 177 /889 variables (removed 712) and now considering 641/1885 (removed 1244) transitions.
[2025-06-07 22:31:15] [INFO ] Flow matrix only has 178 transitions (discarded 463 similar events)
// Phase 1: matrix 178 rows 177 cols
[2025-06-07 22:31:15] [INFO ] Computed 63 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:31:15] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-07 22:31:15] [INFO ] Flow matrix only has 178 transitions (discarded 463 similar events)
[2025-06-07 22:31:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:31:15] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 22:31:15] [INFO ] Redundant transitions in 6 ms returned []
Running 467 sub problems to find dead transitions.
[2025-06-07 22:31:15] [INFO ] Flow matrix only has 178 transitions (discarded 463 similar events)
[2025-06-07 22:31:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 3/177 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (OVERLAPS) 177/354 variables, 177/240 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 6 (OVERLAPS) 0/354 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 467 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/355 variables, and 240 constraints, problems are : Problem set: 0 solved, 467 unsolved in 20632 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 467/466 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 467 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 3/177 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (OVERLAPS) 177/354 variables, 177/240 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 466/706 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 7 (OVERLAPS) 0/354 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 467 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/355 variables, and 706 constraints, problems are : Problem set: 0 solved, 467 unsolved in 21166 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 467/466 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41857ms problems are : Problem set: 0 solved, 467 unsolved
Search for dead transitions found 0 dead transitions in 41858ms
Starting structural reductions in SI_LTL mode, iteration 1 : 177/889 places, 641/1885 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42348 ms. Remains : 177/889 places, 641/1885 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-02 finished in 42431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U G(p2))))'
Support contains 3 out of 889 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Graph (trivial) has 912 edges and 889 vertex of which 454 / 889 are part of one of the 62 SCC in 1 ms
Free SCC test removed 392 places
Ensure Unique test removed 424 transitions
Reduce isomorphic transitions removed 424 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 496 transition count 1392
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 1 with 190 rules applied. Total rules applied 259 place count 428 transition count 1270
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 320 place count 367 transition count 1270
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 320 place count 367 transition count 1268
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 324 place count 365 transition count 1268
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 372 place count 317 transition count 884
Iterating global reduction 3 with 48 rules applied. Total rules applied 420 place count 317 transition count 884
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 462 place count 317 transition count 842
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 4 with 254 rules applied. Total rules applied 716 place count 190 transition count 715
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 722 place count 184 transition count 654
Iterating global reduction 4 with 6 rules applied. Total rules applied 728 place count 184 transition count 654
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 734 place count 184 transition count 648
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 736 place count 183 transition count 659
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 748 place count 183 transition count 647
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 749 place count 182 transition count 635
Iterating global reduction 5 with 1 rules applied. Total rules applied 750 place count 182 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 751 place count 182 transition count 634
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 753 place count 180 transition count 632
Applied a total of 753 rules in 116 ms. Remains 180 /889 variables (removed 709) and now considering 632/1885 (removed 1253) transitions.
[2025-06-07 22:31:57] [INFO ] Flow matrix only has 183 transitions (discarded 449 similar events)
// Phase 1: matrix 183 rows 180 cols
[2025-06-07 22:31:57] [INFO ] Computed 63 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:31:57] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-07 22:31:57] [INFO ] Flow matrix only has 183 transitions (discarded 449 similar events)
[2025-06-07 22:31:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:31:57] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 22:31:57] [INFO ] Redundant transitions in 4 ms returned []
Running 461 sub problems to find dead transitions.
[2025-06-07 22:31:57] [INFO ] Flow matrix only has 183 transitions (discarded 449 similar events)
[2025-06-07 22:31:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 4/180 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 182/362 variables, 180/243 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (OVERLAPS) 0/362 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/363 variables, and 243 constraints, problems are : Problem set: 0 solved, 461 unsolved in 20343 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 461/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 4/180 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 182/362 variables, 180/243 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 460/703 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (OVERLAPS) 0/362 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/363 variables, and 703 constraints, problems are : Problem set: 0 solved, 461 unsolved in 21650 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 461/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42052ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 42053ms
Starting structural reductions in SI_LTL mode, iteration 1 : 180/889 places, 632/1885 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42464 ms. Remains : 180/889 places, 632/1885 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-03
Entered a terminal (fully accepting) state of product in 107 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-03 finished in 42716 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))&&(p1 U (G(p1)||(X(p0)&&p2)))))'
Support contains 4 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 877 transition count 1873
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 877 transition count 1873
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 872 transition count 1868
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 872 transition count 1868
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 870 transition count 1866
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 870 transition count 1866
Applied a total of 38 rules in 58 ms. Remains 870 /889 variables (removed 19) and now considering 1866/1885 (removed 19) transitions.
// Phase 1: matrix 1866 rows 870 cols
[2025-06-07 22:32:40] [INFO ] Computed 63 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:32:40] [INFO ] Implicit Places using invariants in 363 ms returned []
[2025-06-07 22:32:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:32:41] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
Running 1865 sub problems to find dead transitions.
[2025-06-07 22:32:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/2736 variables, and 0 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 1865/1864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1865 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/2736 variables, and 0 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 1/1864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60571ms problems are : Problem set: 0 solved, 1865 unsolved
Search for dead transitions found 0 dead transitions in 60576ms
Starting structural reductions in LTL mode, iteration 1 : 870/889 places, 1866/1885 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61656 ms. Remains : 870/889 places, 1866/1885 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-04
Product exploration explored 100000 steps with 39971 reset in 280 ms.
Product exploration explored 100000 steps with 39928 reset in 291 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/870 stabilizing places and 62/1866 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X p1), (X (X p2)), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 24 factoid took 22 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H10T1U-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H10T1U-LTLFireability-04 finished in 62484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G((F(((!p0&&X(p1))||G(p1))) U X(p2)))))'
Support contains 4 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 878 transition count 1874
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 878 transition count 1874
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 873 transition count 1869
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 873 transition count 1869
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 871 transition count 1867
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 871 transition count 1867
Applied a total of 36 rules in 91 ms. Remains 871 /889 variables (removed 18) and now considering 1867/1885 (removed 18) transitions.
// Phase 1: matrix 1867 rows 871 cols
[2025-06-07 22:33:42] [INFO ] Computed 63 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:33:43] [INFO ] Implicit Places using invariants in 445 ms returned []
[2025-06-07 22:33:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:33:43] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
Running 1866 sub problems to find dead transitions.
[2025-06-07 22:33:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 870/2738 variables, and 0 constraints, problems are : Problem set: 0 solved, 1866 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/871 constraints, PredecessorRefiner: 1866/1865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1866 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 870/2738 variables, and 0 constraints, problems are : Problem set: 0 solved, 1866 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/871 constraints, PredecessorRefiner: 1/1865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60544ms problems are : Problem set: 0 solved, 1866 unsolved
Search for dead transitions found 0 dead transitions in 60548ms
Starting structural reductions in LTL mode, iteration 1 : 871/889 places, 1867/1885 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61712 ms. Remains : 871/889 places, 1867/1885 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-05
Stuttering criterion allowed to conclude after 2242 steps with 1 reset in 12 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-05 finished in 61868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(!p0))) U (p1 U X(!p0))))'
Support contains 3 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 876 transition count 1872
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 876 transition count 1872
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 870 transition count 1866
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 870 transition count 1866
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 867 transition count 1863
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 867 transition count 1863
Applied a total of 44 rules in 73 ms. Remains 867 /889 variables (removed 22) and now considering 1863/1885 (removed 22) transitions.
// Phase 1: matrix 1863 rows 867 cols
[2025-06-07 22:34:44] [INFO ] Computed 63 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:34:44] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-06-07 22:34:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:34:45] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
Running 1862 sub problems to find dead transitions.
[2025-06-07 22:34:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/2730 variables, and 0 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/867 constraints, PredecessorRefiner: 1862/1861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1862 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/2730 variables, and 0 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/867 constraints, PredecessorRefiner: 1/1861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60548ms problems are : Problem set: 0 solved, 1862 unsolved
Search for dead transitions found 0 dead transitions in 60552ms
Starting structural reductions in LTL mode, iteration 1 : 867/889 places, 1863/1885 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61542 ms. Remains : 867/889 places, 1863/1885 transitions.
Stuttering acceptance computed with spot in 276 ms :[p0, true, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1361 steps with 0 reset in 7 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-06 finished in 61850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0||F(G(p1)))&&(X(p1) U ((X(p1)&&G(p2))||X(G(p1)))))))'
Support contains 3 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 879 transition count 1875
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 879 transition count 1875
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 873 transition count 1869
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 873 transition count 1869
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 870 transition count 1866
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 870 transition count 1866
Applied a total of 38 rules in 74 ms. Remains 870 /889 variables (removed 19) and now considering 1866/1885 (removed 19) transitions.
// Phase 1: matrix 1866 rows 870 cols
[2025-06-07 22:35:46] [INFO ] Computed 63 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:35:46] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-06-07 22:35:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:35:47] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
Running 1865 sub problems to find dead transitions.
[2025-06-07 22:35:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/2736 variables, and 0 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 1865/1864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1865 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/2736 variables, and 0 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 1/1864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60505ms problems are : Problem set: 0 solved, 1865 unsolved
Search for dead transitions found 0 dead transitions in 60507ms
Starting structural reductions in LTL mode, iteration 1 : 870/889 places, 1866/1885 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61558 ms. Remains : 870/889 places, 1866/1885 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-07
Product exploration explored 100000 steps with 33274 reset in 261 ms.
Product exploration explored 100000 steps with 33465 reset in 363 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Computed a total of 63 stabilizing places and 63 stable transitions
Detected a total of 63/870 stabilizing places and 63/1866 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 188 ms. Reduced automaton from 6 states, 30 edges and 3 AP (stutter sensitive) to 6 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false]
RANDOM walk for 40000 steps (32 resets) in 675 ms. (59 steps per ms) remains 6/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
[2025-06-07 22:36:49] [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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 57/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 810/870 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1866/2736 variables, 870/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2736 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/2736 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2736/2736 variables, and 933 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1499 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 57/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 810/870 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1866/2736 variables, 870/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2736 variables, 6/939 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:36:51] [INFO ] Deduced a trap composed of 176 places in 154 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:36:51] [INFO ] Deduced a trap composed of 177 places in 114 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2736 variables, 2/941 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2736 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/2736 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2736/2736 variables, and 941 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2375 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3887ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 270 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=67 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 488 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p0))), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 p2 p0))), (F (NOT (AND p1 p2))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p2)), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 36 factoid took 1083 ms. Reduced automaton from 6 states, 30 edges and 3 AP (stutter sensitive) to 6 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false]
Support contains 3 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 1866/1866 transitions.
Applied a total of 0 rules in 33 ms. Remains 870 /870 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2025-06-07 22:36:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:36:55] [INFO ] Implicit Places using invariants in 293 ms returned []
[2025-06-07 22:36:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:36:56] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
Running 1865 sub problems to find dead transitions.
[2025-06-07 22:36:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/2736 variables, and 0 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 1865/1864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1865 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/2736 variables, and 0 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 1/1864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60637ms problems are : Problem set: 0 solved, 1865 unsolved
Search for dead transitions found 0 dead transitions in 60641ms
Finished structural reductions in LTL mode , in 1 iterations and 61673 ms. Remains : 870/870 places, 1866/1866 transitions.
Computed a total of 63 stabilizing places and 63 stable transitions
Computed a total of 63 stabilizing places and 63 stable transitions
Detected a total of 63/870 stabilizing places and 63/1866 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p1 p2 p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 184 ms. Reduced automaton from 6 states, 30 edges and 3 AP (stutter sensitive) to 6 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
RANDOM walk for 40000 steps (31 resets) in 294 ms. (135 steps per ms) remains 6/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
[2025-06-07 22:37:57] [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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 57/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 810/870 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1866/2736 variables, 870/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2736 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/2736 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2736/2736 variables, and 933 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1318 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 57/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 810/870 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:37:59] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/870 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1866/2736 variables, 870/934 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2736 variables, 6/940 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2736 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/2736 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2736/2736 variables, and 940 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2077 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 870/870 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3409ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 2 properties in 2385 ms.
Support contains 3 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 1866/1866 transitions.
Graph (trivial) has 897 edges and 870 vertex of which 461 / 870 are part of one of the 63 SCC in 1 ms
Free SCC test removed 398 places
Drop transitions (Empty/Sink Transition effects.) removed 493 transitions
Reduce isomorphic transitions removed 493 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 472 transition count 1312
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 182 rules applied. Total rules applied 244 place count 411 transition count 1191
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 304 place count 351 transition count 1191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 304 place count 351 transition count 1190
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 306 place count 350 transition count 1190
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 354 place count 302 transition count 741
Iterating global reduction 3 with 48 rules applied. Total rules applied 402 place count 302 transition count 741
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 450 place count 302 transition count 693
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 690 place count 182 transition count 573
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 694 place count 180 transition count 586
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 698 place count 180 transition count 582
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 706 place count 180 transition count 574
Free-agglomeration rule applied 108 times.
Iterating global reduction 5 with 108 rules applied. Total rules applied 814 place count 180 transition count 466
Reduce places removed 108 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 441 transitions
Reduce isomorphic transitions removed 441 transitions.
Iterating post reduction 5 with 549 rules applied. Total rules applied 1363 place count 72 transition count 25
Ensure Unique test removed 48 places
Iterating post reduction 6 with 48 rules applied. Total rules applied 1411 place count 24 transition count 25
Applied a total of 1411 rules in 64 ms. Remains 24 /870 variables (removed 846) and now considering 25/1866 (removed 1841) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 24/870 places, 25/1866 transitions.
RANDOM walk for 40000 steps (8 resets) in 413 ms. (96 steps per ms) remains 1/4 properties
BEST_FIRST walk for 26739 steps (6 resets) in 58 ms. (453 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p1 p2 p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (AND p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 p2 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT p2)), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 36 factoid took 1003 ms. Reduced automaton from 6 states, 30 edges and 3 AP (stutter sensitive) to 6 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 33259 reset in 274 ms.
Product exploration explored 100000 steps with 33248 reset in 312 ms.
Built C files in :
/tmp/ltsmin18362340595387742308
[2025-06-07 22:38:06] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18362340595387742308
Running compilation step : cd /tmp/ltsmin18362340595387742308;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18362340595387742308;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18362340595387742308;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 1866/1866 transitions.
Applied a total of 0 rules in 18 ms. Remains 870 /870 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2025-06-07 22:38:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:38:09] [INFO ] Implicit Places using invariants in 294 ms returned []
[2025-06-07 22:38:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:38:10] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
Running 1865 sub problems to find dead transitions.
[2025-06-07 22:38:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/2736 variables, and 0 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 1865/1864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1865 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 timeout
1)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/2736 variables, and 0 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/870 constraints, PredecessorRefiner: 1/1864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60600ms problems are : Problem set: 0 solved, 1865 unsolved
Search for dead transitions found 0 dead transitions in 60604ms
Finished structural reductions in LTL mode , in 1 iterations and 61628 ms. Remains : 870/870 places, 1866/1866 transitions.
Built C files in :
/tmp/ltsmin4055502557751409118
[2025-06-07 22:39:11] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4055502557751409118
Running compilation step : cd /tmp/ltsmin4055502557751409118;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4055502557751409118;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4055502557751409118;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-07 22:39:14] [INFO ] Flatten gal took : 54 ms
[2025-06-07 22:39:14] [INFO ] Flatten gal took : 50 ms
[2025-06-07 22:39:14] [INFO ] Time to serialize gal into /tmp/LTL2279429836343149515.gal : 16 ms
[2025-06-07 22:39:14] [INFO ] Time to serialize properties into /tmp/LTL14094722398556775783.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2279429836343149515.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4411143806074741886.hoa' '-atoms' '/tmp/LTL14094722398556775783.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14094722398556775783.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4411143806074741886.hoa
Detected timeout of ITS tools.
[2025-06-07 22:39:29] [INFO ] Flatten gal took : 46 ms
[2025-06-07 22:39:29] [INFO ] Flatten gal took : 45 ms
[2025-06-07 22:39:29] [INFO ] Time to serialize gal into /tmp/LTL10470133950999884314.gal : 9 ms
[2025-06-07 22:39:29] [INFO ] Time to serialize properties into /tmp/LTL6743648677971449671.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10470133950999884314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6743648677971449671.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((X("(p651!=1)"))U((X(G("(p651!=1)")))||((X("(p651!=1)"))&&(G("(p779!=1)")))))&&(("(p1597!=1)")||(F(G("(p651!=1)")))))))
Formula 0 simplified : G((X!"(p651!=1)" R (XF!"(p651!=1)" & (X!"(p651!=1)" | F!"(p779!=1)"))) | (!"(p1597!=1)" & GF!"(p651!=1)"))
Detected timeout of ITS tools.
[2025-06-07 22:39:44] [INFO ] Flatten gal took : 41 ms
[2025-06-07 22:39:44] [INFO ] Applying decomposition
[2025-06-07 22:39:44] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13174523993759129166.txt' '-o' '/tmp/graph13174523993759129166.bin' '-w' '/tmp/graph13174523993759129166.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13174523993759129166.bin' '-l' '-1' '-v' '-w' '/tmp/graph13174523993759129166.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:39:45] [INFO ] Decomposing Gal with order
[2025-06-07 22:39:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:39:45] [INFO ] Removed a total of 1948 redundant transitions.
[2025-06-07 22:39:45] [INFO ] Flatten gal took : 134 ms
[2025-06-07 22:39:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 52 ms.
[2025-06-07 22:39:45] [INFO ] Time to serialize gal into /tmp/LTL1512899579553422621.gal : 18 ms
[2025-06-07 22:39:45] [INFO ] Time to serialize properties into /tmp/LTL8621827497385030453.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1512899579553422621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8621827497385030453.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(((X("(i25.u133.p651!=1)"))U((X(G("(i25.u133.p651!=1)")))||((X("(i25.u133.p651!=1)"))&&(G("(i30.u160.p779!=1)")))))&&(("(i46.u314....200
Formula 0 simplified : G((X!"(i25.u133.p651!=1)" R (XF!"(i25.u133.p651!=1)" & (X!"(i25.u133.p651!=1)" | F!"(i30.u160.p779!=1)"))) | (!"(i46.u314.p1597!=1)"...183
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H10T1U-LTLFireability-07 finished in 254365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 889 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Graph (trivial) has 915 edges and 889 vertex of which 457 / 889 are part of one of the 63 SCC in 1 ms
Free SCC test removed 394 places
Ensure Unique test removed 424 transitions
Reduce isomorphic transitions removed 424 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 494 transition count 1389
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 1 with 193 rules applied. Total rules applied 265 place count 423 transition count 1267
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 326 place count 362 transition count 1267
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 375 place count 313 transition count 884
Iterating global reduction 3 with 49 rules applied. Total rules applied 424 place count 313 transition count 884
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 466 place count 313 transition count 842
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 4 with 254 rules applied. Total rules applied 720 place count 186 transition count 715
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 726 place count 180 transition count 654
Iterating global reduction 4 with 6 rules applied. Total rules applied 732 place count 180 transition count 654
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 738 place count 180 transition count 648
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 739 place count 180 transition count 647
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 741 place count 178 transition count 645
Applied a total of 741 rules in 59 ms. Remains 178 /889 variables (removed 711) and now considering 645/1885 (removed 1240) transitions.
[2025-06-07 22:40:00] [INFO ] Flow matrix only has 181 transitions (discarded 464 similar events)
// Phase 1: matrix 181 rows 178 cols
[2025-06-07 22:40:00] [INFO ] Computed 63 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:40:00] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-07 22:40:00] [INFO ] Flow matrix only has 181 transitions (discarded 464 similar events)
[2025-06-07 22:40:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:40:00] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 22:40:00] [INFO ] Redundant transitions in 8 ms returned []
Running 470 sub problems to find dead transitions.
[2025-06-07 22:40:00] [INFO ] Flow matrix only has 181 transitions (discarded 464 similar events)
[2025-06-07 22:40:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 3/178 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 180/358 variables, 178/241 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (OVERLAPS) 0/358 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 470 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/359 variables, and 241 constraints, problems are : Problem set: 0 solved, 470 unsolved in 20474 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 470/469 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 3/178 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 180/358 variables, 178/241 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 469/710 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 7 (OVERLAPS) 0/358 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 470 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/359 variables, and 710 constraints, problems are : Problem set: 0 solved, 470 unsolved in 21488 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 470/469 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42022ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 42023ms
Starting structural reductions in SI_LTL mode, iteration 1 : 178/889 places, 645/1885 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42403 ms. Remains : 178/889 places, 645/1885 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-08 finished in 42458 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 889 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Graph (trivial) has 917 edges and 889 vertex of which 454 / 889 are part of one of the 62 SCC in 2 ms
Free SCC test removed 392 places
Ensure Unique test removed 424 transitions
Reduce isomorphic transitions removed 424 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 496 transition count 1390
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 1 with 192 rules applied. Total rules applied 263 place count 426 transition count 1268
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 324 place count 365 transition count 1268
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 324 place count 365 transition count 1266
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 328 place count 363 transition count 1266
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 377 place count 314 transition count 883
Iterating global reduction 3 with 49 rules applied. Total rules applied 426 place count 314 transition count 883
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 468 place count 314 transition count 841
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 4 with 256 rules applied. Total rules applied 724 place count 186 transition count 713
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 730 place count 180 transition count 652
Iterating global reduction 4 with 6 rules applied. Total rules applied 736 place count 180 transition count 652
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 742 place count 180 transition count 646
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 744 place count 178 transition count 644
Applied a total of 744 rules in 55 ms. Remains 178 /889 variables (removed 711) and now considering 644/1885 (removed 1241) transitions.
[2025-06-07 22:40:43] [INFO ] Flow matrix only has 168 transitions (discarded 476 similar events)
// Phase 1: matrix 168 rows 178 cols
[2025-06-07 22:40:43] [INFO ] Computed 63 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:40:43] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-07 22:40:43] [INFO ] Flow matrix only has 168 transitions (discarded 476 similar events)
[2025-06-07 22:40:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:40:43] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 22:40:43] [INFO ] Redundant transitions in 6 ms returned []
Running 469 sub problems to find dead transitions.
[2025-06-07 22:40:43] [INFO ] Flow matrix only has 168 transitions (discarded 476 similar events)
[2025-06-07 22:40:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 2/178 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (OVERLAPS) 167/345 variables, 178/241 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 6 (OVERLAPS) 0/345 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 469 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/346 variables, and 241 constraints, problems are : Problem set: 0 solved, 469 unsolved in 20413 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 469/468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 469 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 2/178 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (OVERLAPS) 167/345 variables, 178/241 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 468/709 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 7 (OVERLAPS) 0/345 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 469 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/346 variables, and 709 constraints, problems are : Problem set: 0 solved, 469 unsolved in 21156 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 469/468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41623ms problems are : Problem set: 0 solved, 469 unsolved
Search for dead transitions found 0 dead transitions in 41625ms
Starting structural reductions in SI_LTL mode, iteration 1 : 178/889 places, 644/1885 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41999 ms. Remains : 178/889 places, 644/1885 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-09 finished in 42058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F((p1&&X(p2)))))))'
Support contains 3 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 876 transition count 1872
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 876 transition count 1872
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 870 transition count 1866
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 870 transition count 1866
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 867 transition count 1863
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 867 transition count 1863
Applied a total of 44 rules in 68 ms. Remains 867 /889 variables (removed 22) and now considering 1863/1885 (removed 22) transitions.
// Phase 1: matrix 1863 rows 867 cols
[2025-06-07 22:41:25] [INFO ] Computed 63 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:41:25] [INFO ] Implicit Places using invariants in 327 ms returned []
[2025-06-07 22:41:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:41:26] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
Running 1862 sub problems to find dead transitions.
[2025-06-07 22:41:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/2730 variables, and 0 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/867 constraints, PredecessorRefiner: 1862/1861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1862 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/2730 variables, and 0 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/867 constraints, PredecessorRefiner: 1/1861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60547ms problems are : Problem set: 0 solved, 1862 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Starting structural reductions in LTL mode, iteration 1 : 867/889 places, 1863/1885 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61575 ms. Remains : 867/889 places, 1863/1885 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-10
Stuttering criterion allowed to conclude after 1383 steps with 0 reset in 8 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-10 finished in 61879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 2 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 876 transition count 1872
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 876 transition count 1872
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 870 transition count 1866
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 870 transition count 1866
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 867 transition count 1863
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 867 transition count 1863
Applied a total of 44 rules in 83 ms. Remains 867 /889 variables (removed 22) and now considering 1863/1885 (removed 22) transitions.
[2025-06-07 22:42:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:42:27] [INFO ] Implicit Places using invariants in 309 ms returned []
[2025-06-07 22:42:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:42:28] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
Running 1862 sub problems to find dead transitions.
[2025-06-07 22:42:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 866/2730 variables, and 0 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/867 constraints, PredecessorRefiner: 1862/1861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1862 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/2730 variables, and 0 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/867 constraints, PredecessorRefiner: 1/1861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60566ms problems are : Problem set: 0 solved, 1862 unsolved
Search for dead transitions found 0 dead transitions in 60570ms
Starting structural reductions in LTL mode, iteration 1 : 867/889 places, 1863/1885 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61657 ms. Remains : 867/889 places, 1863/1885 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-11 finished in 61800 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((G(p0) U (X(p1)&&F(p2))))))'
Support contains 4 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 876 transition count 1872
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 876 transition count 1872
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 870 transition count 1866
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 870 transition count 1866
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 867 transition count 1863
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 867 transition count 1863
Applied a total of 44 rules in 70 ms. Remains 867 /889 variables (removed 22) and now considering 1863/1885 (removed 22) transitions.
[2025-06-07 22:43:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:43:29] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-06-07 22:43:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:43:29] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
Running 1862 sub problems to find dead transitions.
[2025-06-07 22:43:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/2730 variables, and 0 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/867 constraints, PredecessorRefiner: 1862/1861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1862 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/2730 variables, and 0 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/867 constraints, PredecessorRefiner: 1/1861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60558ms problems are : Problem set: 0 solved, 1862 unsolved
Search for dead transitions found 0 dead transitions in 60563ms
Starting structural reductions in LTL mode, iteration 1 : 867/889 places, 1863/1885 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61569 ms. Remains : 867/889 places, 1863/1885 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-12
Entered a terminal (fully accepting) state of product in 387 steps with 0 reset in 4 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-12 finished in 61910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((X((p1&&F(G(p2)))) U (p0&&X((p1&&F(G(p2)))))))))))'
Support contains 3 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 878 transition count 1874
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 878 transition count 1874
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 872 transition count 1868
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 872 transition count 1868
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 869 transition count 1865
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 869 transition count 1865
Applied a total of 40 rules in 69 ms. Remains 869 /889 variables (removed 20) and now considering 1865/1885 (removed 20) transitions.
// Phase 1: matrix 1865 rows 869 cols
[2025-06-07 22:44:30] [INFO ] Computed 63 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:44:31] [INFO ] Implicit Places using invariants in 292 ms returned []
[2025-06-07 22:44:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:44:31] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
Running 1864 sub problems to find dead transitions.
[2025-06-07 22:44:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 868/2734 variables, and 0 constraints, problems are : Problem set: 0 solved, 1864 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/869 constraints, PredecessorRefiner: 1864/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1864 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/2734 variables, and 0 constraints, problems are : Problem set: 0 solved, 1864 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/869 constraints, PredecessorRefiner: 1/1863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60543ms problems are : Problem set: 0 solved, 1864 unsolved
Search for dead transitions found 0 dead transitions in 60546ms
Starting structural reductions in LTL mode, iteration 1 : 869/889 places, 1865/1885 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61583 ms. Remains : 869/889 places, 1865/1885 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-14
Product exploration explored 100000 steps with 79 reset in 369 ms.
Stack based approach found an accepted trace after 6205 steps with 4 reset with depth 1110 and stack size 1110 in 27 ms.
FORMULA Champagne-PT-H10T1U-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Champagne-PT-H10T1U-LTLFireability-14 finished in 62251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0||F(G(p1)))&&(X(p1) U ((X(p1)&&G(p2))||X(G(p1)))))))'
Found a Shortening insensitive property : Champagne-PT-H10T1U-LTLFireability-07
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Support contains 3 out of 889 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 889/889 places, 1885/1885 transitions.
Graph (trivial) has 916 edges and 889 vertex of which 461 / 889 are part of one of the 63 SCC in 2 ms
Free SCC test removed 398 places
Ensure Unique test removed 430 transitions
Reduce isomorphic transitions removed 430 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 490 transition count 1385
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 190 rules applied. Total rules applied 260 place count 421 transition count 1264
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 320 place count 361 transition count 1264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 320 place count 361 transition count 1263
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 322 place count 360 transition count 1263
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 371 place count 311 transition count 867
Iterating global reduction 3 with 49 rules applied. Total rules applied 420 place count 311 transition count 867
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 463 place count 311 transition count 824
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 4 with 246 rules applied. Total rules applied 709 place count 188 transition count 701
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 714 place count 183 transition count 642
Iterating global reduction 4 with 5 rules applied. Total rules applied 719 place count 183 transition count 642
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 724 place count 183 transition count 637
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 726 place count 181 transition count 635
Applied a total of 726 rules in 56 ms. Remains 181 /889 variables (removed 708) and now considering 635/1885 (removed 1250) transitions.
[2025-06-07 22:45:33] [INFO ] Flow matrix only has 177 transitions (discarded 458 similar events)
// Phase 1: matrix 177 rows 181 cols
[2025-06-07 22:45:33] [INFO ] Computed 63 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:45:33] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-07 22:45:33] [INFO ] Flow matrix only has 177 transitions (discarded 458 similar events)
[2025-06-07 22:45:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:45:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 22:45:33] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 494 sub problems to find dead transitions.
[2025-06-07 22:45:33] [INFO ] Flow matrix only has 177 transitions (discarded 458 similar events)
[2025-06-07 22:45:33] [INFO ] Invariant cache hit.
[2025-06-07 22:45:33] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 3/181 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (OVERLAPS) 176/357 variables, 181/244 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 7 (OVERLAPS) 0/357 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 494 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/358 variables, and 254 constraints, problems are : Problem set: 0 solved, 494 unsolved in 22909 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 181/181 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 494/493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 494 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 3/181 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (OVERLAPS) 176/357 variables, 181/244 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 493/747 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 43 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:46:07] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 16/763 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/358 variables, and 763 constraints, problems are : Problem set: 0 solved, 494 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 181/181 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 494/493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 16/16 constraints]
After SMT, in 52987ms problems are : Problem set: 0 solved, 494 unsolved
Search for dead transitions found 0 dead transitions in 52988ms
Starting structural reductions in LI_LTL mode, iteration 1 : 181/889 places, 635/1885 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 53379 ms. Remains : 181/889 places, 635/1885 transitions.
Running random walk in product with property : Champagne-PT-H10T1U-LTLFireability-07
Stuttering criterion allowed to conclude after 324 steps with 101 reset in 3 ms.
Treatment of property Champagne-PT-H10T1U-LTLFireability-07 finished in 53778 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2025-06-07 22:46:26] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8616429163796836335
[2025-06-07 22:46:26] [INFO ] Too many transitions (1885) to apply POR reductions. Disabling POR matrices.
[2025-06-07 22:46:26] [INFO ] Applying decomposition
[2025-06-07 22:46:26] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8616429163796836335
Running compilation step : cd /tmp/ltsmin8616429163796836335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-07 22:46:26] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10497020150086916742.txt' '-o' '/tmp/graph10497020150086916742.bin' '-w' '/tmp/graph10497020150086916742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10497020150086916742.bin' '-l' '-1' '-v' '-w' '/tmp/graph10497020150086916742.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:46:27] [INFO ] Decomposing Gal with order
[2025-06-07 22:46:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:46:27] [INFO ] Removed a total of 1949 redundant transitions.
[2025-06-07 22:46:27] [INFO ] Flatten gal took : 79 ms
[2025-06-07 22:46:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 143 labels/synchronizations in 38 ms.
[2025-06-07 22:46:27] [INFO ] Time to serialize gal into /tmp/LTLFireability8981952203711019134.gal : 13 ms
[2025-06-07 22:46:27] [INFO ] Time to serialize properties into /tmp/LTLFireability656181359558158907.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8981952203711019134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability656181359558158907.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((("(i47.u327.p1597!=1)")||(F(G("(i26.u138.p651!=1)"))))&&((X("(i26.u138.p651!=1)"))U(((X("(i26.u138.p651!=1)"))&&(G("(i31.u167.p7...200
Formula 0 simplified : G((X!"(i26.u138.p651!=1)" R (XF!"(i26.u138.p651!=1)" & (X!"(i26.u138.p651!=1)" | F!"(i31.u167.p779!=1)"))) | (!"(i47.u327.p1597!=1)"...183
Compilation finished in 3429 ms.
Running link step : cd /tmp/ltsmin8616429163796836335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin8616429163796836335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp0==true)||<>([]((LTLAPp1==true))))&&(X((LTLAPp1==true)) U ((X((LTLAPp1==true))&&[]((LTLAPp2==true)))||X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t68, t83, t112, t142, t232, t312, t388, t417, t538, t586, t727, t756, t937, i0.t956, i1.t942,...1068
Computing Next relation with stutter on 2.39299e+23 deadlock states
12 unique states visited
4 strongly connected components in search stack
17 transitions explored
8 items max in DFS search stack
35017 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,350.32,2352684,1,0,4.8142e+06,1105,13980,9.09594e+06,279,2078,7063007
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Champagne-PT-H10T1U-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1909761 ms.
BK_STOP 1749337205848
--------------------
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="Champagne-PT-H10T1U"
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 Champagne-PT-H10T1U, 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 r254-tall-174931339400156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H10T1U.tgz
mv Champagne-PT-H10T1U 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 ;