About the Execution of ITS-Tools for DBSingleClientW-PT-d2m08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1109879.00 | 0.00 | 0.00 | FFFFFFFFFFFFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063600148.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 DBSingleClientW-PT-d2m08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063600148
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748622236366
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 16:23:58] [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-05-30 16:23:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 16:23:59] [INFO ] Load time of PNML (sax parser for PT used): 433 ms
[2025-05-30 16:23:59] [INFO ] Transformed 4763 places.
[2025-05-30 16:23:59] [INFO ] Transformed 2478 transitions.
[2025-05-30 16:23:59] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 619 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 3580 places in 23 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 375 places :
Symmetric choice reduction at 1 with 375 rule applications. Total rules 620 place count 762 transition count 1398
Iterating global reduction 1 with 375 rules applied. Total rules applied 995 place count 762 transition count 1398
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 1049 place count 762 transition count 1344
Discarding 300 places :
Symmetric choice reduction at 2 with 300 rule applications. Total rules 1349 place count 462 transition count 1044
Iterating global reduction 2 with 300 rules applied. Total rules applied 1649 place count 462 transition count 1044
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1660 place count 462 transition count 1033
Discarding 219 places :
Symmetric choice reduction at 3 with 219 rule applications. Total rules 1879 place count 243 transition count 733
Iterating global reduction 3 with 219 rules applied. Total rules applied 2098 place count 243 transition count 733
Ensure Unique test removed 249 transitions
Reduce isomorphic transitions removed 249 transitions.
Iterating post reduction 3 with 249 rules applied. Total rules applied 2347 place count 243 transition count 484
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 2366 place count 224 transition count 450
Iterating global reduction 4 with 19 rules applied. Total rules applied 2385 place count 224 transition count 450
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 2415 place count 224 transition count 420
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2425 place count 214 transition count 410
Iterating global reduction 5 with 10 rules applied. Total rules applied 2435 place count 214 transition count 410
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2437 place count 214 transition count 408
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 2445 place count 206 transition count 400
Iterating global reduction 6 with 8 rules applied. Total rules applied 2453 place count 206 transition count 400
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2463 place count 206 transition count 390
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2464 place count 205 transition count 388
Iterating global reduction 7 with 1 rules applied. Total rules applied 2465 place count 205 transition count 388
Applied a total of 2465 rules in 293 ms. Remains 205 /1183 variables (removed 978) and now considering 388/2478 (removed 2090) transitions.
// Phase 1: matrix 388 rows 205 cols
[2025-05-30 16:23:59] [INFO ] Computed 2 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:24:00] [INFO ] Implicit Places using invariants in 679 ms returned []
[2025-05-30 16:24:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:24:00] [INFO ] State equation strengthened by 188 read => feed constraints.
[2025-05-30 16:24:03] [INFO ] Implicit Places using invariants and state equation in 3223 ms returned []
Implicit Place search using SMT with State Equation took 3959 ms to find 0 implicit places.
Running 387 sub problems to find dead transitions.
[2025-05-30 16:24:03] [INFO ] Invariant cache hit.
[2025-05-30 16:24:03] [INFO ] State equation strengthened by 188 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (OVERLAPS) 388/593 variables, 205/207 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 188/395 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/593 variables, and 395 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (OVERLAPS) 388/593 variables, 205/207 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 188/395 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 782 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61307ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 61339ms
Starting structural reductions in LTL mode, iteration 1 : 205/1183 places, 388/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65626 ms. Remains : 205/1183 places, 388/2478 transitions.
Support contains 35 out of 205 places after structural reductions.
[2025-05-30 16:25:05] [INFO ] Flatten gal took : 114 ms
[2025-05-30 16:25:05] [INFO ] Flatten gal took : 70 ms
[2025-05-30 16:25:05] [INFO ] Input system was already deterministic with 388 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (9156 resets) in 3975 ms. (10 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4002 steps (174 resets) in 57 ms. (69 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (180 resets) in 42 ms. (93 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (172 resets) in 41 ms. (95 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (386 resets) in 117 ms. (33 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (165 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (207 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (360 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (190 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (180 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (179 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (174 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (372 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (175 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (173 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (357 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (188 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (178 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (187 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (160 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (405 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (167 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (166 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (213 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (167 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (165 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (162 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (185 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (174 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (181 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
Finished probabilistic random walk after 271177 steps, run visited all 29 properties in 1430 ms. (steps per millisecond=189 )
Probabilistic random walk after 271177 steps, saw 106618 distinct states, run finished after 1438 ms. (steps per millisecond=188 ) properties seen :29
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 27 stable transitions
Graph (complete) has 804 edges and 205 vertex of which 204 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 179 transition count 307
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 179 transition count 307
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 179 transition count 302
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 76 place count 160 transition count 282
Iterating global reduction 1 with 19 rules applied. Total rules applied 95 place count 160 transition count 282
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 100 place count 160 transition count 277
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 115 place count 145 transition count 251
Iterating global reduction 2 with 15 rules applied. Total rules applied 130 place count 145 transition count 251
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 141 place count 145 transition count 240
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 152 place count 134 transition count 207
Iterating global reduction 3 with 11 rules applied. Total rules applied 163 place count 134 transition count 207
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 167 place count 134 transition count 203
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 176 place count 125 transition count 176
Iterating global reduction 4 with 9 rules applied. Total rules applied 185 place count 125 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 189 place count 125 transition count 172
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 124 transition count 171
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 124 transition count 171
Applied a total of 191 rules in 109 ms. Remains 124 /205 variables (removed 81) and now considering 171/388 (removed 217) transitions.
// Phase 1: matrix 171 rows 124 cols
[2025-05-30 16:25:09] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:25:10] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-05-30 16:25:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:25:10] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-05-30 16:25:11] [INFO ] Implicit Places using invariants and state equation in 1100 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:25:11] [INFO ] Redundant transitions in 12 ms returned []
Running 170 sub problems to find dead transitions.
[2025-05-30 16:25:11] [INFO ] Invariant cache hit.
[2025-05-30 16:25:11] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/295 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 178 constraints, problems are : Problem set: 0 solved, 170 unsolved in 14275 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/295 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 170/348 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 348 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44487ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 44489ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/205 places, 171/388 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45968 ms. Remains : 124/205 places, 171/388 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-00
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-00 finished in 46348 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 3 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 181 transition count 313
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 181 transition count 313
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 181 transition count 309
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 163 transition count 290
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 163 transition count 290
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 93 place count 163 transition count 285
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 107 place count 149 transition count 261
Iterating global reduction 2 with 14 rules applied. Total rules applied 121 place count 149 transition count 261
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 132 place count 149 transition count 250
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 141 place count 140 transition count 225
Iterating global reduction 3 with 9 rules applied. Total rules applied 150 place count 140 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 155 place count 140 transition count 220
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 163 place count 132 transition count 194
Iterating global reduction 4 with 8 rules applied. Total rules applied 171 place count 132 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 174 place count 132 transition count 191
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 175 place count 131 transition count 190
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 131 transition count 190
Applied a total of 176 rules in 59 ms. Remains 131 /205 variables (removed 74) and now considering 190/388 (removed 198) transitions.
// Phase 1: matrix 190 rows 131 cols
[2025-05-30 16:25:56] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:25:56] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-30 16:25:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:25:56] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-30 16:25:56] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:25:56] [INFO ] Redundant transitions in 8 ms returned []
Running 189 sub problems to find dead transitions.
[2025-05-30 16:25:56] [INFO ] Invariant cache hit.
[2025-05-30 16:25:56] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/321 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 64/197 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:26:07] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 198 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/321 variables, 131/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 189/387 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/321 variables, and 387 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/205 places, 190/388 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61153 ms. Remains : 131/205 places, 190/388 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-01
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-01 finished in 61289 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)))||F((!p1 U (p2||G(!p1))))) U p3) U p4))'
Support contains 7 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 314
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 314
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 183 transition count 309
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 168 transition count 293
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 168 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 83 place count 168 transition count 289
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 157 transition count 270
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 157 transition count 270
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 112 place count 157 transition count 263
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 119 place count 150 transition count 251
Iterating global reduction 3 with 7 rules applied. Total rules applied 126 place count 150 transition count 251
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 131 place count 150 transition count 246
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 138 place count 143 transition count 228
Iterating global reduction 4 with 7 rules applied. Total rules applied 145 place count 143 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 148 place count 143 transition count 225
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 142 transition count 224
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 142 transition count 224
Applied a total of 150 rules in 32 ms. Remains 142 /205 variables (removed 63) and now considering 224/388 (removed 164) transitions.
// Phase 1: matrix 224 rows 142 cols
[2025-05-30 16:26:57] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:26:57] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-05-30 16:26:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:26:57] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-05-30 16:26:59] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 1919 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2025-05-30 16:26:59] [INFO ] Invariant cache hit.
[2025-05-30 16:26:59] [INFO ] State equation strengthened by 91 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 224/366 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 91/235 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 235 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 224/366 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 91/235 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 223/458 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 458 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 60267ms
Starting structural reductions in LTL mode, iteration 1 : 142/205 places, 224/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62221 ms. Remains : 142/205 places, 224/388 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p4), (NOT p3), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-02 finished in 62527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(X(G(!p1))))))'
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 181 transition count 316
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 181 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 181 transition count 311
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 163 transition count 292
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 163 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 93 place count 163 transition count 288
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 108 place count 148 transition count 262
Iterating global reduction 2 with 15 rules applied. Total rules applied 123 place count 148 transition count 262
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 134 place count 148 transition count 251
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 145 place count 137 transition count 218
Iterating global reduction 3 with 11 rules applied. Total rules applied 156 place count 137 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 160 place count 137 transition count 214
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 168 place count 129 transition count 195
Iterating global reduction 4 with 8 rules applied. Total rules applied 176 place count 129 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 180 place count 129 transition count 191
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 181 place count 128 transition count 190
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 128 transition count 190
Applied a total of 182 rules in 28 ms. Remains 128 /205 variables (removed 77) and now considering 190/388 (removed 198) transitions.
// Phase 1: matrix 190 rows 128 cols
[2025-05-30 16:27:59] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:27:59] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-05-30 16:27:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:28:00] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-05-30 16:28:00] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2025-05-30 16:28:00] [INFO ] Invariant cache hit.
[2025-05-30 16:28:00] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/318 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 69/199 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:28:13] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:28:13] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:28:14] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:28:14] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 13 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/318 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:28:18] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:28:18] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:28:18] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:28:18] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:28:18] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 0/318 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 208 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30005 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 190/318 variables, 128/139 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 69/208 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 189/397 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/318 variables, and 397 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 128/205 places, 190/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61205 ms. Remains : 128/205 places, 190/388 transitions.
Stuttering acceptance computed with spot in 188 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-03
Product exploration explored 100000 steps with 26957 reset in 594 ms.
Product exploration explored 100000 steps with 26981 reset in 463 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 468 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (9157 resets) in 611 ms. (65 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1725 resets) in 248 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3875 resets) in 279 ms. (142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1776 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 20870 steps, run visited all 3 properties in 234 ms. (steps per millisecond=89 )
Probabilistic random walk after 20870 steps, saw 10288 distinct states, run finished after 234 ms. (steps per millisecond=89 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 253 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2025-05-30 16:29:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:29:04] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-05-30 16:29:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:29:04] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-05-30 16:29:05] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2025-05-30 16:29:05] [INFO ] Invariant cache hit.
[2025-05-30 16:29:05] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/318 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 69/199 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:29:19] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:29:19] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:29:20] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:29:20] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 14 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/318 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:29:23] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:29:23] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:29:23] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:29:23] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:29:23] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 318/318 variables, and 208 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 190/318 variables, 128/139 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 69/208 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 189/397 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/318 variables, and 397 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Finished structural reductions in LTL mode , in 1 iterations and 61555 ms. Remains : 128/128 places, 190/190 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 468 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 130 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (9153 resets) in 315 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1829 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3886 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1831 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 20870 steps, run visited all 3 properties in 187 ms. (steps per millisecond=111 )
Probabilistic random walk after 20870 steps, saw 10288 distinct states, run finished after 187 ms. (steps per millisecond=111 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 260 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 245 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 26918 reset in 400 ms.
Product exploration explored 100000 steps with 26912 reset in 658 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 255 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 190/190 transitions.
Applied a total of 0 rules in 24 ms. Remains 128 /128 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:30:09] [INFO ] Redundant transitions in 4 ms returned []
Running 189 sub problems to find dead transitions.
[2025-05-30 16:30:09] [INFO ] Invariant cache hit.
[2025-05-30 16:30:09] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/318 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 69/199 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:30:21] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:30:21] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:30:21] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:30:21] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 8 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/318 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:30:24] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:30:24] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:30:24] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:30:24] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:30:25] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 0/318 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 208 constraints, problems are : Problem set: 0 solved, 189 unsolved in 28312 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 190/318 variables, 128/139 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 69/208 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 189/397 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/318 variables, and 397 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58534ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 58535ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58573 ms. Remains : 128/128 places, 190/190 transitions.
Built C files in :
/tmp/ltsmin10072347707280123527
[2025-05-30 16:31:07] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10072347707280123527
Running compilation step : cd /tmp/ltsmin10072347707280123527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 657 ms.
Running link step : cd /tmp/ltsmin10072347707280123527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin10072347707280123527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14494497690673671114.hoa' '--buchi-type=spotba'
LTSmin run took 260 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-03 finished in 188950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(!p1 U (G(!p1)||(!p1&&(p1||G(!p2)))))))'
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 182 transition count 329
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 182 transition count 329
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 182 transition count 323
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 163 transition count 303
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 163 transition count 303
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 95 place count 163 transition count 298
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 110 place count 148 transition count 272
Iterating global reduction 2 with 15 rules applied. Total rules applied 125 place count 148 transition count 272
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 138 place count 148 transition count 259
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 148 place count 138 transition count 233
Iterating global reduction 3 with 10 rules applied. Total rules applied 158 place count 138 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 162 place count 138 transition count 229
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 171 place count 129 transition count 202
Iterating global reduction 4 with 9 rules applied. Total rules applied 180 place count 129 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 184 place count 129 transition count 198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 185 place count 128 transition count 197
Iterating global reduction 5 with 1 rules applied. Total rules applied 186 place count 128 transition count 197
Applied a total of 186 rules in 30 ms. Remains 128 /205 variables (removed 77) and now considering 197/388 (removed 191) transitions.
// Phase 1: matrix 197 rows 128 cols
[2025-05-30 16:31:08] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:31:08] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-30 16:31:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:31:09] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-05-30 16:31:09] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-05-30 16:31:09] [INFO ] Invariant cache hit.
[2025-05-30 16:31:09] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/325 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 76/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 206 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16006 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/325 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 76/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 196/402 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 402 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46222ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 46223ms
Starting structural reductions in LTL mode, iteration 1 : 128/205 places, 197/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47384 ms. Remains : 128/205 places, 197/388 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) p1), true, (NOT p0), p1, (AND p1 p2), p2]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-04
Product exploration explored 100000 steps with 31497 reset in 298 ms.
Product exploration explored 100000 steps with 31522 reset in 319 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 473 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 115 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[true, p2, (AND p2 p1), p1]
RANDOM walk for 40000 steps (9201 resets) in 247 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1833 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1759 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1816 resets) in 255 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1705 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1776 resets) in 279 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1814 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1315528 steps, run timeout after 3001 ms. (steps per millisecond=438 ) properties seen :5 out of 6
Probabilistic random walk after 1315528 steps, saw 551754 distinct states, run finished after 3005 ms. (steps per millisecond=437 ) properties seen :5
[2025-05-30 16:32:00] [INFO ] Invariant cache hit.
[2025-05-30 16:32:00] [INFO ] State equation strengthened by 76 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 138/223 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 17/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 319/325 variables, and 144 constraints, problems are : Problem set: 1 solved, 0 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/128 constraints, ReadFeed: 17/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p2)))), (F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 16 factoid took 278 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[true, p1, p2, (AND p1 p2)]
Stuttering acceptance computed with spot in 114 ms :[true, p1, p2, (AND p1 p2)]
Support contains 3 out of 128 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 197/197 transitions.
Applied a total of 0 rules in 9 ms. Remains 128 /128 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2025-05-30 16:32:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:32:01] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-05-30 16:32:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:32:01] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-05-30 16:32:02] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:32:02] [INFO ] Redundant transitions in 3 ms returned []
Running 196 sub problems to find dead transitions.
[2025-05-30 16:32:02] [INFO ] Invariant cache hit.
[2025-05-30 16:32:02] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/325 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 76/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 206 constraints, problems are : Problem set: 0 solved, 196 unsolved in 13487 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/325 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 76/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 196/402 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 402 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43654ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 43655ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44523 ms. Remains : 128/128 places, 197/197 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 473 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 146 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[true, p1, p2, (AND p1 p2)]
RANDOM walk for 40000 steps (9163 resets) in 364 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1842 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1751 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1783 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1798 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1850 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1159184 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :5 out of 6
Probabilistic random walk after 1159184 steps, saw 484303 distinct states, run finished after 3001 ms. (steps per millisecond=386 ) properties seen :5
[2025-05-30 16:32:49] [INFO ] Invariant cache hit.
[2025-05-30 16:32:49] [INFO ] State equation strengthened by 76 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 138/223 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 17/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 319/325 variables, and 144 constraints, problems are : Problem set: 1 solved, 0 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/128 constraints, ReadFeed: 17/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 196ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p2)))), (F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 14 factoid took 556 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[true, p1, p2, (AND p1 p2)]
Stuttering acceptance computed with spot in 166 ms :[true, p1, p2, (AND p1 p2)]
Stuttering acceptance computed with spot in 164 ms :[true, p1, p2, (AND p1 p2)]
Product exploration explored 100000 steps with 23017 reset in 495 ms.
Product exploration explored 100000 steps with 23045 reset in 402 ms.
Built C files in :
/tmp/ltsmin17683768783064925102
[2025-05-30 16:32:51] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2025-05-30 16:32:51] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 16:32:51] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2025-05-30 16:32:51] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 16:32:51] [INFO ] Computing Do-Not-Accords matrix : 197 transitions.
[2025-05-30 16:32:51] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 16:32:51] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17683768783064925102
Running compilation step : cd /tmp/ltsmin17683768783064925102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 880 ms.
Running link step : cd /tmp/ltsmin17683768783064925102;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17683768783064925102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2257556347004212578.hoa' '--buchi-type=spotba'
LTSmin run took 978 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-04 finished in 104977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||(p1&&G(p2)))))'
Support contains 6 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 182 transition count 316
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 182 transition count 316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 182 transition count 312
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 165 transition count 294
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 165 transition count 294
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 165 transition count 290
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 102 place count 151 transition count 265
Iterating global reduction 2 with 14 rules applied. Total rules applied 116 place count 151 transition count 265
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 127 place count 151 transition count 254
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 135 place count 143 transition count 241
Iterating global reduction 3 with 8 rules applied. Total rules applied 143 place count 143 transition count 241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 147 place count 143 transition count 237
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 154 place count 136 transition count 218
Iterating global reduction 4 with 7 rules applied. Total rules applied 161 place count 136 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 165 place count 136 transition count 214
Applied a total of 165 rules in 11 ms. Remains 136 /205 variables (removed 69) and now considering 214/388 (removed 174) transitions.
// Phase 1: matrix 214 rows 136 cols
[2025-05-30 16:32:53] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:32:53] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-05-30 16:32:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:32:54] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-05-30 16:32:55] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2025-05-30 16:32:55] [INFO ] Invariant cache hit.
[2025-05-30 16:32:55] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/350 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 85/223 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:33:06] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/350 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 224 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/350 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 85/224 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 213/437 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 437 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in LTL mode, iteration 1 : 136/205 places, 214/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61773 ms. Remains : 136/205 places, 214/388 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-05
Product exploration explored 100000 steps with 22982 reset in 559 ms.
Product exploration explored 100000 steps with 22951 reset in 601 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 505 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p1 p2)), (X (AND p2 p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 p2))), (X (X (AND p2 p0))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 186 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (9118 resets) in 377 ms. (105 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3817 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1829 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3728 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3803 resets) in 186 ms. (213 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1742 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1813 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1784 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3749 resets) in 215 ms. (185 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 30376 steps, run visited all 8 properties in 333 ms. (steps per millisecond=91 )
Probabilistic random walk after 30376 steps, saw 14080 distinct states, run finished after 333 ms. (steps per millisecond=91 ) properties seen :8
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p1 p2)), (X (AND p2 p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 p2))), (X (X (AND p2 p0))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (NOT (AND p2 p0))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p2 p0)))
Knowledge based reduction with 19 factoid took 330 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-05 finished in 64830 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(X(X(F(p1)))))))))'
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 311
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 180 transition count 306
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 162 transition count 287
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 162 transition count 287
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 96 place count 162 transition count 282
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 110 place count 148 transition count 257
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 148 transition count 257
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 135 place count 148 transition count 246
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 145 place count 138 transition count 214
Iterating global reduction 3 with 10 rules applied. Total rules applied 155 place count 138 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 159 place count 138 transition count 210
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 167 place count 130 transition count 185
Iterating global reduction 4 with 8 rules applied. Total rules applied 175 place count 130 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 179 place count 130 transition count 181
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 180 place count 129 transition count 180
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 129 transition count 180
Applied a total of 181 rules in 15 ms. Remains 129 /205 variables (removed 76) and now considering 180/388 (removed 208) transitions.
// Phase 1: matrix 180 rows 129 cols
[2025-05-30 16:33:58] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:33:58] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-05-30 16:33:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:33:58] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-30 16:33:59] [INFO ] Implicit Places using invariants and state equation in 1244 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2025-05-30 16:33:59] [INFO ] Invariant cache hit.
[2025-05-30 16:33:59] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/309 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 55/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 186 constraints, problems are : Problem set: 0 solved, 179 unsolved in 15944 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/309 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 55/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 309/309 variables, and 365 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46108ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 46108ms
Starting structural reductions in LTL mode, iteration 1 : 129/205 places, 180/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47528 ms. Remains : 129/205 places, 180/388 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-06 finished in 47763 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 3 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 181 transition count 316
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 181 transition count 316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 181 transition count 312
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 163 transition count 293
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 163 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 92 place count 163 transition count 289
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 106 place count 149 transition count 264
Iterating global reduction 2 with 14 rules applied. Total rules applied 120 place count 149 transition count 264
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 131 place count 149 transition count 253
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 141 place count 139 transition count 222
Iterating global reduction 3 with 10 rules applied. Total rules applied 151 place count 139 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 154 place count 139 transition count 219
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 162 place count 131 transition count 200
Iterating global reduction 4 with 8 rules applied. Total rules applied 170 place count 131 transition count 200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 174 place count 131 transition count 196
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 175 place count 130 transition count 195
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 130 transition count 195
Applied a total of 176 rules in 39 ms. Remains 130 /205 variables (removed 75) and now considering 195/388 (removed 193) transitions.
// Phase 1: matrix 195 rows 130 cols
[2025-05-30 16:34:46] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:34:46] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-05-30 16:34:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:34:46] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-30 16:34:47] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:34:47] [INFO ] Redundant transitions in 2 ms returned []
Running 194 sub problems to find dead transitions.
[2025-05-30 16:34:47] [INFO ] Invariant cache hit.
[2025-05-30 16:34:47] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:34:50] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/325 variables, 130/133 constraints. Problems are: Problem set: 0 solved, 194 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 71/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 204 constraints, problems are : Problem set: 0 solved, 194 unsolved in 16940 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/325 variables, 130/133 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 71/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 194/398 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 398 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47083ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 47085ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/205 places, 195/388 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47961 ms. Remains : 130/205 places, 195/388 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-08 finished in 48085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(G((F(p0) U (p2 U X(p3))))&&p1))))'
Support contains 6 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 321
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 321
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 183 transition count 316
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 65 place count 167 transition count 300
Iterating global reduction 1 with 16 rules applied. Total rules applied 81 place count 167 transition count 300
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 167 transition count 296
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 98 place count 154 transition count 273
Iterating global reduction 2 with 13 rules applied. Total rules applied 111 place count 154 transition count 273
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 120 place count 154 transition count 264
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 129 place count 145 transition count 239
Iterating global reduction 3 with 9 rules applied. Total rules applied 138 place count 145 transition count 239
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 143 place count 145 transition count 234
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 150 place count 138 transition count 215
Iterating global reduction 4 with 7 rules applied. Total rules applied 157 place count 138 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 160 place count 138 transition count 212
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 161 place count 137 transition count 211
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 137 transition count 211
Applied a total of 162 rules in 19 ms. Remains 137 /205 variables (removed 68) and now considering 211/388 (removed 177) transitions.
// Phase 1: matrix 211 rows 137 cols
[2025-05-30 16:35:34] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:35:34] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-30 16:35:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:35:34] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-05-30 16:35:36] [INFO ] Implicit Places using invariants and state equation in 2056 ms returned []
Implicit Place search using SMT with State Equation took 2288 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2025-05-30 16:35:36] [INFO ] Invariant cache hit.
[2025-05-30 16:35:36] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/348 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 82/221 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 221 constraints, problems are : Problem set: 0 solved, 210 unsolved in 24473 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/348 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 82/221 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 210/431 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 431 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54706ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 54707ms
Starting structural reductions in LTL mode, iteration 1 : 137/205 places, 211/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57017 ms. Remains : 137/205 places, 211/388 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p0), false, (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-09 finished in 57386 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((p1||X(p2))) U X(!p1))))'
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 181 transition count 315
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 181 transition count 315
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 181 transition count 310
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 70 place count 164 transition count 292
Iterating global reduction 1 with 17 rules applied. Total rules applied 87 place count 164 transition count 292
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 92 place count 164 transition count 287
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 105 place count 151 transition count 265
Iterating global reduction 2 with 13 rules applied. Total rules applied 118 place count 151 transition count 265
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 127 place count 151 transition count 256
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 136 place count 142 transition count 225
Iterating global reduction 3 with 9 rules applied. Total rules applied 145 place count 142 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 151 place count 142 transition count 219
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 158 place count 135 transition count 194
Iterating global reduction 4 with 7 rules applied. Total rules applied 165 place count 135 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 167 place count 135 transition count 192
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 168 place count 134 transition count 191
Iterating global reduction 5 with 1 rules applied. Total rules applied 169 place count 134 transition count 191
Applied a total of 169 rules in 15 ms. Remains 134 /205 variables (removed 71) and now considering 191/388 (removed 197) transitions.
// Phase 1: matrix 191 rows 134 cols
[2025-05-30 16:36:31] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:36:31] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-30 16:36:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:36:32] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-05-30 16:36:32] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2025-05-30 16:36:32] [INFO ] Invariant cache hit.
[2025-05-30 16:36:32] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/325 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 62/198 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:36:41] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:36:41] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:36:42] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:36:49] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:36:50] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:36:50] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:36:50] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:36:51] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:36:51] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 8 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/325 variables, 6/207 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:36:55] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:36:55] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 325/325 variables, and 209 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 191/325 variables, 134/147 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 62/209 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 190/399 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 399 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Starting structural reductions in LTL mode, iteration 1 : 134/205 places, 191/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61237 ms. Remains : 134/205 places, 191/388 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) p1), (NOT p0), (AND p1 (NOT p2)), p1, true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-10
Stuttering criterion allowed to conclude after 8 steps with 3 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-10 finished in 61481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(p1 U p2))))'
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 182 transition count 314
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 182 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 182 transition count 310
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 165 transition count 292
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 165 transition count 292
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 89 place count 165 transition count 287
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 152 transition count 267
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 152 transition count 267
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 126 place count 152 transition count 256
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 134 place count 144 transition count 233
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 144 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 144 transition count 232
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 148 place count 139 transition count 226
Iterating global reduction 4 with 5 rules applied. Total rules applied 153 place count 139 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 155 place count 139 transition count 224
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 156 place count 138 transition count 223
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 138 transition count 223
Applied a total of 157 rules in 17 ms. Remains 138 /205 variables (removed 67) and now considering 223/388 (removed 165) transitions.
// Phase 1: matrix 223 rows 138 cols
[2025-05-30 16:37:33] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:37:33] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-05-30 16:37:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:37:33] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-30 16:37:34] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2025-05-30 16:37:34] [INFO ] Invariant cache hit.
[2025-05-30 16:37:34] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 87/227 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 227 constraints, problems are : Problem set: 0 solved, 222 unsolved in 18748 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 87/227 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 222/449 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 449 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48940ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 48941ms
Starting structural reductions in LTL mode, iteration 1 : 138/205 places, 223/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50105 ms. Remains : 138/205 places, 223/388 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (NOT p0), true, (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-12 finished in 50285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 181 transition count 323
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 181 transition count 323
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 181 transition count 316
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 163 transition count 297
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 163 transition count 297
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 96 place count 163 transition count 292
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 110 place count 149 transition count 268
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 149 transition count 268
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 137 place count 149 transition count 255
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 147 place count 139 transition count 223
Iterating global reduction 3 with 10 rules applied. Total rules applied 157 place count 139 transition count 223
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 162 place count 139 transition count 218
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 170 place count 131 transition count 192
Iterating global reduction 4 with 8 rules applied. Total rules applied 178 place count 131 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 181 place count 131 transition count 189
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 182 place count 130 transition count 188
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 130 transition count 188
Applied a total of 183 rules in 14 ms. Remains 130 /205 variables (removed 75) and now considering 188/388 (removed 200) transitions.
// Phase 1: matrix 188 rows 130 cols
[2025-05-30 16:38:23] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:38:23] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-05-30 16:38:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:38:23] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-30 16:38:24] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2025-05-30 16:38:24] [INFO ] Invariant cache hit.
[2025-05-30 16:38:24] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/318 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 187 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/318 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 196 constraints, problems are : Problem set: 0 solved, 187 unsolved in 13813 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/318 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 187/383 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/318 variables, and 383 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43991ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 43992ms
Starting structural reductions in LTL mode, iteration 1 : 130/205 places, 188/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44728 ms. Remains : 130/205 places, 188/388 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 316 ms.
Product exploration explored 100000 steps with 33333 reset in 342 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-13 finished in 45519 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 U (G(!p0)||(!p0&&G(!p1)))))))'
Support contains 3 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 181 transition count 312
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 181 transition count 312
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 181 transition count 307
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 70 place count 164 transition count 289
Iterating global reduction 1 with 17 rules applied. Total rules applied 87 place count 164 transition count 289
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 92 place count 164 transition count 284
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 105 place count 151 transition count 261
Iterating global reduction 2 with 13 rules applied. Total rules applied 118 place count 151 transition count 261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 125 place count 151 transition count 254
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 132 place count 144 transition count 242
Iterating global reduction 3 with 7 rules applied. Total rules applied 139 place count 144 transition count 242
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 144 place count 144 transition count 237
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 152 place count 136 transition count 211
Iterating global reduction 4 with 8 rules applied. Total rules applied 160 place count 136 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 163 place count 136 transition count 208
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 135 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 135 transition count 207
Applied a total of 165 rules in 30 ms. Remains 135 /205 variables (removed 70) and now considering 207/388 (removed 181) transitions.
// Phase 1: matrix 207 rows 135 cols
[2025-05-30 16:39:09] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:39:09] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-05-30 16:39:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:39:09] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-05-30 16:39:10] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:39:10] [INFO ] Redundant transitions in 2 ms returned []
Running 206 sub problems to find dead transitions.
[2025-05-30 16:39:10] [INFO ] Invariant cache hit.
[2025-05-30 16:39:10] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/342 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 81/218 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:39:18] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:39:18] [INFO ] Deduced a trap composed of 60 places in 169 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:39:19] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:39:19] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:39:28] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:39:29] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:39:29] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:39:29] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:39:29] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:39:30] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 17 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/342 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:39:33] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/342 variables, and 229 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 207/342 variables, 135/148 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 81/229 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 206/435 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/342 variables, and 435 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 60272ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/205 places, 207/388 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61387 ms. Remains : 135/205 places, 207/388 transitions.
Stuttering acceptance computed with spot in 124 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-14
Product exploration explored 100000 steps with 23108 reset in 276 ms.
Product exploration explored 100000 steps with 22959 reset in 304 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 497 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 123 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[p0, p0, (AND p0 p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9172 resets) in 304 ms. (131 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1747 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1811 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1823 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1812 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1693 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1721 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1242489 steps, run timeout after 3001 ms. (steps per millisecond=414 ) properties seen :5 out of 6
Probabilistic random walk after 1242489 steps, saw 504052 distinct states, run finished after 3001 ms. (steps per millisecond=414 ) properties seen :5
[2025-05-30 16:40:14] [INFO ] Invariant cache hit.
[2025-05-30 16:40:14] [INFO ] State equation strengthened by 81 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 140/230 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 342/342 variables, and 151 constraints, problems are : Problem set: 1 solved, 0 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 14/81 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 231ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 437 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 141 ms :[p0, p0, (AND p0 p1)]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 207/207 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2025-05-30 16:40:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:40:15] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-05-30 16:40:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:40:16] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-05-30 16:40:16] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:40:16] [INFO ] Redundant transitions in 2 ms returned []
Running 206 sub problems to find dead transitions.
[2025-05-30 16:40:16] [INFO ] Invariant cache hit.
[2025-05-30 16:40:16] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/342 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 81/218 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:40:26] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:40:26] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:40:27] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:40:27] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:40:36] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:40:36] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:40:37] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:40:37] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:40:37] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:40:38] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 10 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/342 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:40:41] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/342 variables, and 229 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 207/342 variables, 135/148 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 81/229 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 206/435 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/342 variables, and 435 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61402 ms. Remains : 135/135 places, 207/207 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 497 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 170 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[p0, p0, (AND p0 p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9279 resets) in 433 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1811 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1786 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1807 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1814 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1815 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1739 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1206996 steps, run timeout after 3001 ms. (steps per millisecond=402 ) properties seen :5 out of 6
Probabilistic random walk after 1206996 steps, saw 488182 distinct states, run finished after 3001 ms. (steps per millisecond=402 ) properties seen :5
[2025-05-30 16:41:20] [INFO ] Invariant cache hit.
[2025-05-30 16:41:20] [INFO ] State equation strengthened by 81 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 140/230 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 342/342 variables, and 151 constraints, problems are : Problem set: 1 solved, 0 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 14/81 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 390 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 128 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 152 ms :[p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 23091 reset in 446 ms.
Product exploration explored 100000 steps with 22913 reset in 461 ms.
Built C files in :
/tmp/ltsmin13387856108182095015
[2025-05-30 16:41:22] [INFO ] Computing symmetric may disable matrix : 207 transitions.
[2025-05-30 16:41:22] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 16:41:22] [INFO ] Computing symmetric may enable matrix : 207 transitions.
[2025-05-30 16:41:22] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 16:41:22] [INFO ] Computing Do-Not-Accords matrix : 207 transitions.
[2025-05-30 16:41:22] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 16:41:22] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13387856108182095015
Running compilation step : cd /tmp/ltsmin13387856108182095015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 900 ms.
Running link step : cd /tmp/ltsmin13387856108182095015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13387856108182095015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6639591985577691625.hoa' '--buchi-type=spotba'
LTSmin run took 1469 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-14 finished in 136061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 388/388 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 315
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 315
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 180 transition count 310
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 74 place count 161 transition count 290
Iterating global reduction 1 with 19 rules applied. Total rules applied 93 place count 161 transition count 290
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 98 place count 161 transition count 285
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 113 place count 146 transition count 259
Iterating global reduction 2 with 15 rules applied. Total rules applied 128 place count 146 transition count 259
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 139 place count 146 transition count 248
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 150 place count 135 transition count 215
Iterating global reduction 3 with 11 rules applied. Total rules applied 161 place count 135 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 165 place count 135 transition count 211
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 174 place count 126 transition count 184
Iterating global reduction 4 with 9 rules applied. Total rules applied 183 place count 126 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 187 place count 126 transition count 180
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 125 transition count 179
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 125 transition count 179
Applied a total of 189 rules in 19 ms. Remains 125 /205 variables (removed 80) and now considering 179/388 (removed 209) transitions.
// Phase 1: matrix 179 rows 125 cols
[2025-05-30 16:41:25] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:41:25] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-05-30 16:41:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:41:25] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-30 16:41:25] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:41:25] [INFO ] Redundant transitions in 2 ms returned []
Running 178 sub problems to find dead transitions.
[2025-05-30 16:41:25] [INFO ] Invariant cache hit.
[2025-05-30 16:41:25] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:41:35] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:41:42] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:41:43] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/304 variables, and 190 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 179/304 variables, 125/130 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 60/190 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 178/368 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 368 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/205 places, 179/388 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61053 ms. Remains : 125/205 places, 179/388 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-15
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-15 finished in 61108 ms.
All properties solved by simple procedures.
Total runtime 1107682 ms.
BK_STOP 1748623346245
--------------------
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="DBSingleClientW-PT-d2m08"
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 DBSingleClientW-PT-d2m08, 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 r058-smll-174854063600148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m08.tgz
mv DBSingleClientW-PT-d2m08 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 ;