About the Execution of ITS-Tools for DES-PT-01b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 504388.00 | 0.00 | 0.00 | FFFFFFFTFFFFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063800244.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 DES-PT-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063800244
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 68K 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 DES-PT-01b-LTLFireability-00
FORMULA_NAME DES-PT-01b-LTLFireability-01
FORMULA_NAME DES-PT-01b-LTLFireability-02
FORMULA_NAME DES-PT-01b-LTLFireability-03
FORMULA_NAME DES-PT-01b-LTLFireability-04
FORMULA_NAME DES-PT-01b-LTLFireability-05
FORMULA_NAME DES-PT-01b-LTLFireability-06
FORMULA_NAME DES-PT-01b-LTLFireability-07
FORMULA_NAME DES-PT-01b-LTLFireability-08
FORMULA_NAME DES-PT-01b-LTLFireability-09
FORMULA_NAME DES-PT-01b-LTLFireability-10
FORMULA_NAME DES-PT-01b-LTLFireability-11
FORMULA_NAME DES-PT-01b-LTLFireability-12
FORMULA_NAME DES-PT-01b-LTLFireability-13
FORMULA_NAME DES-PT-01b-LTLFireability-14
FORMULA_NAME DES-PT-01b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748662525922
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 03:35:28] [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-31 03:35:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 03:35:28] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2025-05-31 03:35:28] [INFO ] Transformed 284 places.
[2025-05-31 03:35:28] [INFO ] Transformed 235 transitions.
[2025-05-31 03:35:28] [INFO ] Found NUPN structural information;
[2025-05-31 03:35:28] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 432 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-01b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 281 transition count 235
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 259 transition count 213
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 259 transition count 213
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 59 place count 247 transition count 201
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 247 transition count 201
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 81 place count 247 transition count 191
Applied a total of 81 rules in 154 ms. Remains 247 /284 variables (removed 37) and now considering 191/235 (removed 44) transitions.
// Phase 1: matrix 191 rows 247 cols
[2025-05-31 03:35:29] [INFO ] Computed 62 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:35:29] [INFO ] Implicit Places using invariants in 674 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 761 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/284 places, 191/235 transitions.
Applied a total of 0 rules in 24 ms. Remains 245 /245 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 970 ms. Remains : 245/284 places, 191/235 transitions.
Support contains 37 out of 245 places after structural reductions.
[2025-05-31 03:35:30] [INFO ] Flatten gal took : 82 ms
[2025-05-31 03:35:30] [INFO ] Flatten gal took : 38 ms
[2025-05-31 03:35:30] [INFO ] Input system was already deterministic with 191 transitions.
RANDOM walk for 40000 steps (409 resets) in 2282 ms. (17 steps per ms) remains 1/31 properties
BEST_FIRST walk for 40001 steps (79 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
// Phase 1: matrix 191 rows 245 cols
[2025-05-31 03:35:31] [INFO ] Computed 60 invariants in 9 ms
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) 41/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/165 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:31] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/219 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:32] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 11 ms to minimize.
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 219/436 variables, and 59 constraints, problems are : Problem set: 1 solved, 0 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/245 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 582ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DES-PT-01b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DES-PT-01b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-01b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 433 edges and 245 vertex of which 238 are kept as prefixes of interest. Removing 7 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' '!((p0 U (p1||G(((p2 U p0) U X(X(p1)))))))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 191/191 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 185
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 239 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 236 transition count 180
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 236 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 236 transition count 178
Applied a total of 22 rules in 46 ms. Remains 236 /245 variables (removed 9) and now considering 178/191 (removed 13) transitions.
// Phase 1: matrix 178 rows 236 cols
[2025-05-31 03:35:32] [INFO ] Computed 60 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:35:33] [INFO ] Implicit Places using invariants in 345 ms returned []
[2025-05-31 03:35:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:35:33] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-31 03:35:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:40] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:40] [INFO ] Deduced a trap composed of 16 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-31 03:35:40] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:40] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:40] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:40] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:40] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:40] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:40] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:41] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:41] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:41] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:41] [INFO ] Deduced a trap composed of 22 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-31 03:35:41] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:41] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:41] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:41] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:41] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:41] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:41] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:42] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:42] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:42] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:42] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:43] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:43] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:43] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:43] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:43] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:44] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:44] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:44] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:44] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:44] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:44] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:44] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:44] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:44] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:44] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:44] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:45] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:45] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:45] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:45] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:45] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:45] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:45] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:45] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/344 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:48] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:49] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:49] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:49] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:50] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:50] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:50] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:52] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:52] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:53] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:55] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:55] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:57] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:35:58] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:02] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:02] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 360 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 64/124 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:06] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:07] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:07] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:08] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:09] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:09] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/366 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 177/543 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:15] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:15] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:15] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/546 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:22] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:23] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 548 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 236/245 places, 178/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61094 ms. Remains : 236/245 places, 178/191 transitions.
Stuttering acceptance computed with spot in 704 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA DES-PT-01b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-01 finished in 61926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F((p0&&F((G(p1)||(p1&&F(G(p2)))))))))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 191/191 transitions.
Graph (complete) has 433 edges and 245 vertex of which 238 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 237 transition count 171
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 223 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 221 transition count 169
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 33 place count 221 transition count 156
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 59 place count 208 transition count 156
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 63 place count 204 transition count 152
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 204 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 71 place count 204 transition count 148
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 74 place count 202 transition count 147
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 75 place count 201 transition count 146
Iterating global reduction 5 with 1 rules applied. Total rules applied 76 place count 201 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 77 place count 201 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 77 place count 201 transition count 144
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 79 place count 200 transition count 144
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 144 rules applied. Total rules applied 223 place count 128 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 227 place count 126 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 229 place count 124 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 230 place count 123 transition count 72
Applied a total of 230 rules in 98 ms. Remains 123 /245 variables (removed 122) and now considering 72/191 (removed 119) transitions.
// Phase 1: matrix 72 rows 123 cols
[2025-05-31 03:36:34] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:34] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-05-31 03:36:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:35] [INFO ] Implicit Places using invariants and state equation in 209 ms returned [7, 30, 34, 36, 40, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 97, 118]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 341 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/245 places, 72/191 transitions.
Graph (complete) has 222 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 96 transition count 59
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 86 transition count 59
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 59 place count 60 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 61 place count 59 transition count 46
Applied a total of 61 rules in 18 ms. Remains 59 /100 variables (removed 41) and now considering 46/72 (removed 26) transitions.
// Phase 1: matrix 46 rows 59 cols
[2025-05-31 03:36:35] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:35] [INFO ] Implicit Places using invariants in 64 ms returned [39, 45, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/245 places, 46/191 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 55 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 54 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 54 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 53 transition count 42
Applied a total of 6 rules in 7 ms. Remains 53 /56 variables (removed 3) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 53 cols
[2025-05-31 03:36:35] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:35] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-05-31 03:36:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:35] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 53/245 places, 42/191 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 680 ms. Remains : 53/245 places, 42/191 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-01b-LTLFireability-02
Product exploration explored 100000 steps with 10862 reset in 462 ms.
Product exploration explored 100000 steps with 10675 reset in 284 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Graph (complete) has 149 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/53 stabilizing places and 4/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 200 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 24434 steps (2620 resets) in 138 ms. (175 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 15 factoid took 699 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 42/42 transitions.
Applied a total of 0 rules in 6 ms. Remains 53 /53 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2025-05-31 03:36:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:37] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-31 03:36:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:38] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 03:36:38] [INFO ] Redundant transitions in 1 ms returned []
Running 34 sub problems to find dead transitions.
[2025-05-31 03:36:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 3/51 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 2/53 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 42/95 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:39] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/95 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 70 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2052 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 3/51 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 2/53 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 42/95 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 34/104 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/95 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/95 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 104 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2353 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4414ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 4415ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4635 ms. Remains : 53/53 places, 42/42 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Graph (complete) has 149 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/53 stabilizing places and 4/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 289 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 33248 steps (3536 resets) in 205 ms. (161 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 15 factoid took 862 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 10738 reset in 281 ms.
Product exploration explored 100000 steps with 10733 reset in 415 ms.
Built C files in :
/tmp/ltsmin12049819831343022891
[2025-05-31 03:36:45] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2025-05-31 03:36:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 03:36:45] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2025-05-31 03:36:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 03:36:45] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2025-05-31 03:36:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 03:36:45] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12049819831343022891
Running compilation step : cd /tmp/ltsmin12049819831343022891;'/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 439 ms.
Running link step : cd /tmp/ltsmin12049819831343022891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin12049819831343022891;'/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/stateBased4479524305988382321.hoa' '--buchi-type=spotba'
LTSmin run took 954 ms.
FORMULA DES-PT-01b-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-02 finished in 12281 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 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 191/191 transitions.
Graph (complete) has 433 edges and 245 vertex of which 238 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 237 transition count 168
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 220 transition count 168
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 35 place count 220 transition count 155
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 61 place count 207 transition count 155
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 204 transition count 152
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 204 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 204 transition count 148
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 202 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 201 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 201 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 201 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 77 place count 201 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 79 place count 200 transition count 144
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 225 place count 127 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 125 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 123 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 233 place count 121 transition count 71
Applied a total of 233 rules in 56 ms. Remains 121 /245 variables (removed 124) and now considering 71/191 (removed 120) transitions.
// Phase 1: matrix 71 rows 121 cols
[2025-05-31 03:36:47] [INFO ] Computed 56 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:47] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-05-31 03:36:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:47] [INFO ] Implicit Places using invariants and state equation in 320 ms returned [7, 29, 33, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 94, 116]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 467 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/245 places, 71/191 transitions.
Graph (complete) has 231 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 96 transition count 58
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 86 transition count 58
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 59 place count 60 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 58 transition count 45
Applied a total of 62 rules in 13 ms. Remains 58 /100 variables (removed 42) and now considering 45/71 (removed 26) transitions.
// Phase 1: matrix 45 rows 58 cols
[2025-05-31 03:36:47] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:47] [INFO ] Implicit Places using invariants in 95 ms returned [32, 43, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 97 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/245 places, 45/191 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 53 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 53 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 52 transition count 41
Applied a total of 6 rules in 10 ms. Remains 52 /55 variables (removed 3) and now considering 41/45 (removed 4) transitions.
// Phase 1: matrix 41 rows 52 cols
[2025-05-31 03:36:47] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:47] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-31 03:36:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:47] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 52/245 places, 41/191 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 878 ms. Remains : 52/245 places, 41/191 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-03 finished in 945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(X(X(X(p1)))))) U G(p2)))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 191/191 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 185
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 239 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 236 transition count 180
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 236 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 236 transition count 178
Applied a total of 22 rules in 21 ms. Remains 236 /245 variables (removed 9) and now considering 178/191 (removed 13) transitions.
// Phase 1: matrix 178 rows 236 cols
[2025-05-31 03:36:47] [INFO ] Computed 60 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:48] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-05-31 03:36:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:36:48] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-31 03:36:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:55] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:55] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:55] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:55] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:55] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:55] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:56] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:56] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:56] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:56] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:56] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:56] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:57] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:57] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:57] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:57] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:57] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:57] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:57] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:57] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:58] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:58] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:58] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:59] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:59] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:59] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:59] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:36:59] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:00] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:00] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:01] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:01] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:01] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:01] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:01] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:01] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:01] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:02] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:02] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:02] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:02] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:02] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:02] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:02] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:03] [INFO ] Deduced a trap composed of 30 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-31 03:37:03] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:03] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:03] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/344 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:08] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:09] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:09] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:09] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:10] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:10] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:10] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:12] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:12] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:13] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:14] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:14] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:16] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:17] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 358 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 62/122 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:20] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:20] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:21] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:21] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:22] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:22] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/364 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 177/541 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:31] [INFO ] Deduced a trap along path composed of 3 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:32] [INFO ] Deduced a trap along path composed of 3 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:37] [INFO ] Deduced a trap along path composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/544 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 544 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 236/245 places, 178/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60904 ms. Remains : 236/245 places, 178/191 transitions.
Stuttering acceptance computed with spot in 416 ms :[(NOT p2), (NOT p1), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DES-PT-01b-LTLFireability-04
Product exploration explored 100000 steps with 25018 reset in 180 ms.
Product exploration explored 100000 steps with 24970 reset in 212 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Detected a total of 51/236 stabilizing places and 47/178 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 204 ms. Reduced automaton from 12 states, 22 edges and 3 AP (stutter sensitive) to 12 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 402 ms :[(NOT p2), (NOT p1), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 8197 steps (86 resets) in 40 ms. (199 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT (OR p0 (NOT p2)))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 10 factoid took 547 ms. Reduced automaton from 12 states, 22 edges and 3 AP (stutter sensitive) to 12 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 406 ms :[(NOT p2), (NOT p1), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 407 ms :[(NOT p2), (NOT p1), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
[2025-05-31 03:37:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 03:37:51] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2025-05-31 03:37:51] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 63 ms returned sat
[2025-05-31 03:37:52] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2025-05-31 03:37:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 03:37:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 20 ms returned sat
[2025-05-31 03:37:52] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 44 ms returned sat
[2025-05-31 03:37:53] [INFO ] [Nat]Absence check using state equation in 897 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:37:53] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 8 ms to minimize.
[2025-05-31 03:37:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2025-05-31 03:37:53] [INFO ] Computed and/alt/rep : 176/289/176 causal constraints (skipped 1 transitions) in 15 ms.
[2025-05-31 03:37:55] [INFO ] Added : 124 causal constraints over 25 iterations in 1880 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2025-05-31 03:37:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:37:56] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-05-31 03:37:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:37:56] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-31 03:37:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:01] [INFO ] Deduced a trap composed of 12 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-31 03:38:01] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:02] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:02] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:02] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:02] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:02] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:02] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:02] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:03] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:03] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:03] [INFO ] Deduced a trap composed of 27 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-31 03:38:03] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:03] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:03] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:03] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:03] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:03] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:04] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:04] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:04] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:04] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:04] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:05] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:05] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:05] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:05] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:05] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:06] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:06] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:06] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:06] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:06] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:06] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:07] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:07] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:07] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:07] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:07] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:07] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:07] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:07] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:07] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:07] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:08] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:08] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:08] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:08] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/344 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:12] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:12] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:13] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:13] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:13] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:13] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:13] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:16] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:16] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:17] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:19] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:22] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:23] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 358 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 62/122 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:28] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:29] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:30] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:30] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:30] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:30] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/364 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 177/541 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:38] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:38] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:38:42] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/544 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 544 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Finished structural reductions in LTL mode , in 1 iterations and 60778 ms. Remains : 236/236 places, 178/178 transitions.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Detected a total of 51/236 stabilizing places and 47/178 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 233 ms. Reduced automaton from 12 states, 22 edges and 3 AP (stutter sensitive) to 12 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[(NOT p2), (NOT p1), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 10723 steps (112 resets) in 41 ms. (255 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT (OR p0 (NOT p2)))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 10 factoid took 542 ms. Reduced automaton from 12 states, 22 edges and 3 AP (stutter sensitive) to 12 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[(NOT p2), (NOT p1), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 431 ms :[(NOT p2), (NOT p1), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
[2025-05-31 03:38:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 03:38:58] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2025-05-31 03:38:58] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 64 ms returned sat
[2025-05-31 03:38:59] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2025-05-31 03:38:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 03:38:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 20 ms returned sat
[2025-05-31 03:38:59] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 41 ms returned sat
[2025-05-31 03:39:00] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:00] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 10 ms to minimize.
[2025-05-31 03:39:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2025-05-31 03:39:00] [INFO ] Computed and/alt/rep : 176/289/176 causal constraints (skipped 1 transitions) in 14 ms.
[2025-05-31 03:39:02] [INFO ] Added : 124 causal constraints over 25 iterations in 1281 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 412 ms :[(NOT p2), (NOT p1), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 25042 reset in 135 ms.
Product exploration explored 100000 steps with 25142 reset in 152 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 413 ms :[(NOT p2), (NOT p1), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 178/178 transitions.
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 231 transition count 175
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 19 place count 231 transition count 177
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 28 place count 231 transition count 177
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 224 transition count 170
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 224 transition count 170
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 112 place count 224 transition count 170
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 121 place count 215 transition count 161
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 130 place count 215 transition count 161
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 135 place count 215 transition count 181
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 213 transition count 175
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 213 transition count 175
Deduced a syphon composed of 84 places in 0 ms
Applied a total of 139 rules in 51 ms. Remains 213 /236 variables (removed 23) and now considering 175/178 (removed 3) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 03:39:03] [INFO ] Redundant transitions in 7 ms returned []
Running 174 sub problems to find dead transitions.
// Phase 1: matrix 175 rows 213 cols
[2025-05-31 03:39:03] [INFO ] Computed 58 invariants in 2 ms
[2025-05-31 03:39:03] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/213 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:07] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:07] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:07] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 5 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:07] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 6 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:07] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 7 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:07] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 7 ms to minimize.
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:07] [INFO ] Deduced a trap composed of 3 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-31 03:39:08] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:08] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:08] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:08] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:08] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:08] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:08] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:08] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 7 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:08] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:08] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:08] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 7 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:08] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 6 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 20/78 constraints. Problems are: Problem set: 76 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:09] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 6 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:09] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:09] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:09] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:09] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 3 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 7/85 constraints. Problems are: Problem set: 89 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/85 constraints. Problems are: Problem set: 89 solved, 85 unsolved
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
At refinement iteration 7 (OVERLAPS) 175/388 variables, 213/298 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 8/306 constraints. Problems are: Problem set: 101 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:11] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 1/307 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/307 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/388 variables, 0/307 constraints. Problems are: Problem set: 101 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 307 constraints, problems are : Problem set: 101 solved, 73 unsolved in 9892 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 213/213 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 101 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 12/12 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/12 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 64/192 variables, 33/45 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 28/73 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/73 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 15/207 variables, 13/86 constraints. Problems are: Problem set: 101 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:14] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 2/88 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/88 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 173/380 variables, 207/295 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 8/303 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 73/376 constraints. Problems are: Problem set: 101 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:20] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:20] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:20] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 3/379 constraints. Problems are: Problem set: 101 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:25] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 1/380 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/380 constraints. Problems are: Problem set: 101 solved, 73 unsolved
At refinement iteration 14 (OVERLAPS) 8/388 variables, 6/386 constraints. Problems are: Problem set: 101 solved, 73 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 386 constraints, problems are : Problem set: 101 solved, 73 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 213/213 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 73/174 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 39955ms problems are : Problem set: 101 solved, 73 unsolved
Search for dead transitions found 101 dead transitions in 39956ms
Found 101 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 101 transitions
Dead transitions reduction (with SMT) removed 101 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 213/236 places, 74/178 transitions.
Graph (complete) has 427 edges and 213 vertex of which 129 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.1 ms
Discarding 84 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 129 /213 variables (removed 84) and now considering 74/74 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/236 places, 74/178 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40029 ms. Remains : 129/236 places, 74/178 transitions.
Built C files in :
/tmp/ltsmin12031458028563769353
[2025-05-31 03:39:43] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12031458028563769353
Running compilation step : cd /tmp/ltsmin12031458028563769353;'/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 491 ms.
Running link step : cd /tmp/ltsmin12031458028563769353;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12031458028563769353;'/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/stateBased4605764405107262799.hoa' '--buchi-type=spotba'
LTSmin run took 181 ms.
FORMULA DES-PT-01b-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-04 finished in 176438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(p1))))))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 191/191 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 185
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 239 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 236 transition count 180
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 236 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 236 transition count 178
Applied a total of 22 rules in 12 ms. Remains 236 /245 variables (removed 9) and now considering 178/191 (removed 13) transitions.
// Phase 1: matrix 178 rows 236 cols
[2025-05-31 03:39:44] [INFO ] Computed 60 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:39:44] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-05-31 03:39:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:39:44] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-31 03:39:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:48] [INFO ] Deduced a trap composed of 12 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-31 03:39:49] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:49] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:49] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:49] [INFO ] Deduced a trap composed of 22 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-31 03:39:49] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:49] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:49] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:49] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:49] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:49] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:49] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:50] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:50] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:50] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:50] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:50] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:50] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:50] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:50] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:50] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:51] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:51] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:51] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:51] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:51] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:51] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:51] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:52] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:52] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:52] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:52] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:52] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:52] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:53] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:53] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:53] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:53] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:53] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:53] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:53] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:53] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:53] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:53] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:53] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:53] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:53] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:54] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/344 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:57] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:57] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:58] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:58] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:58] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:58] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:39:58] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:00] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:01] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:01] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:02] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:03] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:04] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:05] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:08] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:08] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:11] [INFO ] Deduced a trap along path composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/414 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:13] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:13] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:14] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/414 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 364 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 67/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:15] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:15] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:16] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:16] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/414 variables, 236/367 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 177/544 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:20] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:20] [INFO ] Deduced a trap composed of 13 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-31 03:40:20] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:29] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 177 unsolved
SMT process timed out in 60041ms, After SMT, problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Starting structural reductions in LTL mode, iteration 1 : 236/245 places, 178/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60654 ms. Remains : 236/245 places, 178/191 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-01b-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 83 ms.
Product exploration explored 100000 steps with 33333 reset in 89 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Detected a total of 51/236 stabilizing places and 47/178 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-01b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-01b-LTLFireability-07 finished in 61024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))&&((p2 U (p3||G(p2))) U p4)))'
Support contains 6 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 191/191 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 241 transition count 187
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 241 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 241 transition count 186
Applied a total of 9 rules in 9 ms. Remains 241 /245 variables (removed 4) and now considering 186/191 (removed 5) transitions.
// Phase 1: matrix 186 rows 241 cols
[2025-05-31 03:40:45] [INFO ] Computed 60 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:40:45] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-05-31 03:40:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:40:46] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2025-05-31 03:40:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:50] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:50] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:50] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:50] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:50] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:50] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:50] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:50] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:51] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:51] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:51] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:51] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:51] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:51] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:51] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:51] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:51] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:51] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:51] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:52] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:52] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:52] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:52] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:52] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:53] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:53] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:53] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:53] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:54] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:54] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:56] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:57] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:57] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:57] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:57] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:57] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:59] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:59] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:59] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:59] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:59] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:59] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:59] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:59] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:59] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:40:59] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:02] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (OVERLAPS) 186/427 variables, 241/348 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:06] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:06] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:06] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:07] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:07] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:07] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:07] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:07] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:07] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:07] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:07] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:08] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 12/360 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:09] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:09] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:13] [INFO ] Deduced a trap along path composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/427 variables, and 363 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 61/121 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 186/427 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 185/547 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:22] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:31] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 185 unsolved
SMT process timed out in 60039ms, After SMT, problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 60040ms
Starting structural reductions in LTL mode, iteration 1 : 241/245 places, 186/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60691 ms. Remains : 241/245 places, 186/191 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p4)), true, (NOT p1), (AND (NOT p3) (NOT p2)), (NOT p4)]
Running random walk in product with property : DES-PT-01b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-08 finished in 60912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)||G(!p1))) U ((X((X(p0)||G(!p1)))&&(!p1 U (p2||G(!p1))))||X(G((X(p0)||G(!p1)))))))'
Support contains 5 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 191/191 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 240 transition count 186
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 240 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 240 transition count 185
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 238 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 238 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 238 transition count 182
Applied a total of 16 rules in 14 ms. Remains 238 /245 variables (removed 7) and now considering 182/191 (removed 9) transitions.
// Phase 1: matrix 182 rows 238 cols
[2025-05-31 03:41:46] [INFO ] Computed 60 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:41:46] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-05-31 03:41:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:41:46] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-05-31 03:41:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:51] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:51] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:51] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:51] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:51] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:51] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:51] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:51] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:51] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:52] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:52] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:52] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:52] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:52] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:52] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:52] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:52] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:52] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:53] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:53] [INFO ] Deduced a trap composed of 19 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-31 03:41:53] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:54] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:54] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:55] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:55] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:55] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:55] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:55] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:55] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:55] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:55] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:55] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:56] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/420 variables, 238/331 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:59] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:59] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:41:59] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:00] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:00] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:00] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:00] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:00] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:00] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:00] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:00] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:00] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:00] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:01] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:01] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:01] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:01] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 17/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:04] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:04] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:04] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:04] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:04] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:04] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:04] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:04] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:04] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:04] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:05] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:05] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:05] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:05] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 14/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:09] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:12] [INFO ] Deduced a trap along path composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/420 variables, and 364 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 64/124 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/420 variables, 238/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:21] [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-31 03:42:21] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:21] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 3/546 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:30] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
SMT process timed out in 60043ms, After SMT, problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60044ms
Starting structural reductions in LTL mode, iteration 1 : 238/245 places, 182/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60677 ms. Remains : 238/245 places, 182/191 transitions.
Stuttering acceptance computed with spot in 446 ms :[(AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0), (AND p1 (NOT p0)), true, (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1), p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 786 steps with 8 reset in 2 ms.
FORMULA DES-PT-01b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-09 finished in 61161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(!p1||X(G(p2))))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 191/191 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 185
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 239 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 237 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 237 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 237 transition count 180
Applied a total of 19 rules in 11 ms. Remains 237 /245 variables (removed 8) and now considering 180/191 (removed 11) transitions.
// Phase 1: matrix 180 rows 237 cols
[2025-05-31 03:42:47] [INFO ] Computed 60 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:42:47] [INFO ] Implicit Places using invariants in 233 ms returned []
[2025-05-31 03:42:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:42:48] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2025-05-31 03:42:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:52] [INFO ] Deduced a trap composed of 12 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-31 03:42:52] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:52] [INFO ] Deduced a trap composed of 21 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-31 03:42:52] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:52] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:52] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:52] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:52] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:52] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:52] [INFO ] Deduced a trap composed of 18 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-31 03:42:53] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:53] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:53] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:53] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:53] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:53] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:53] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:53] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:53] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:53] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:54] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:54] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:54] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:54] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:54] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:54] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:54] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:54] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:54] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:54] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:54] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:54] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:54] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:55] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:55] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:55] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:55] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:55] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:55] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:55] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:56] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:56] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:56] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:56] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:56] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:56] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:56] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 7/107 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:58] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:58] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:59] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:59] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:42:59] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 180/417 variables, 237/349 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:03] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:03] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:04] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:04] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:04] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:04] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:05] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:06] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:06] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:10] [INFO ] Deduced a trap along path composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:16] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/417 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/417 variables, and 360 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 2/2 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/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 61/121 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:19] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:19] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 180/417 variables, 237/360 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 179/539 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:21] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:30] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:30] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:43:31] [INFO ] Deduced a trap composed of 18 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-31 03:43:32] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 4/544 constraints. Problems are: Problem set: 0 solved, 179 unsolved
SMT process timed out in 60050ms, After SMT, problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 237/245 places, 180/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60684 ms. Remains : 237/245 places, 180/191 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p2)]
Running random walk in product with property : DES-PT-01b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-10 finished in 60833 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(((F(p1) U p2)&&p0)))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 191/191 transitions.
Graph (complete) has 433 edges and 245 vertex of which 240 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 239 transition count 170
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 222 transition count 170
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 222 transition count 158
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 210 transition count 158
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 206 transition count 154
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 206 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 206 transition count 150
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 204 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 203 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 203 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 203 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 77 place count 203 transition count 146
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 79 place count 202 transition count 146
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 223 place count 130 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 227 place count 128 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 126 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 230 place count 125 transition count 74
Applied a total of 230 rules in 39 ms. Remains 125 /245 variables (removed 120) and now considering 74/191 (removed 117) transitions.
// Phase 1: matrix 74 rows 125 cols
[2025-05-31 03:43:48] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:43:48] [INFO ] Implicit Places using invariants in 166 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 167 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/245 places, 74/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 124/245 places, 74/191 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : DES-PT-01b-LTLFireability-11
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-11 finished in 349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 191/191 transitions.
Graph (complete) has 433 edges and 245 vertex of which 238 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 237 transition count 169
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 221 transition count 169
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 33 place count 221 transition count 156
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 208 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 204 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 204 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 204 transition count 148
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 202 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 201 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 201 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 201 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 77 place count 201 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 79 place count 200 transition count 144
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 225 place count 127 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 125 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 123 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 233 place count 121 transition count 71
Applied a total of 233 rules in 36 ms. Remains 121 /245 variables (removed 124) and now considering 71/191 (removed 120) transitions.
// Phase 1: matrix 71 rows 121 cols
[2025-05-31 03:43:48] [INFO ] Computed 56 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:43:48] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-05-31 03:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:43:49] [INFO ] Implicit Places using invariants and state equation in 257 ms returned [7, 30, 34, 38, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 95, 116]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 418 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/245 places, 71/191 transitions.
Graph (complete) has 244 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 100 transition count 60
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 20 place count 89 transition count 60
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 54 place count 66 transition count 49
Applied a total of 54 rules in 5 ms. Remains 66 /104 variables (removed 38) and now considering 49/71 (removed 22) transitions.
// Phase 1: matrix 49 rows 66 cols
[2025-05-31 03:43:49] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:43:49] [INFO ] Implicit Places using invariants in 72 ms returned [36, 40, 43, 46, 52, 55]
[2025-05-31 03:43:49] [INFO ] Actually due to overlaps returned [36, 43, 46, 52, 55]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 78 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/245 places, 49/191 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 59 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 59 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 58 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 57 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 57 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 56 transition count 44
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 56 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 54 transition count 42
Applied a total of 13 rules in 6 ms. Remains 54 /61 variables (removed 7) and now considering 42/49 (removed 7) transitions.
// Phase 1: matrix 42 rows 54 cols
[2025-05-31 03:43:49] [INFO ] Computed 17 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:43:49] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-31 03:43:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:43:49] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 54/245 places, 42/191 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 726 ms. Remains : 54/245 places, 42/191 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-12
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-12 finished in 851 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(F(!p0))||(F(!p0)&&(p1||X(p0))))))'
Support contains 1 out of 245 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 : 245/245 places, 191/191 transitions.
Graph (complete) has 433 edges and 245 vertex of which 238 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 237 transition count 169
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 221 transition count 169
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 33 place count 221 transition count 156
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 208 transition count 156
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 205 transition count 153
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 205 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 205 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 204 transition count 151
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 203 transition count 150
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 203 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 203 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 71 place count 203 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 202 transition count 148
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 217 place count 130 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 221 place count 128 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 225 place count 128 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 126 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 229 place count 124 transition count 75
Applied a total of 229 rules in 27 ms. Remains 124 /245 variables (removed 121) and now considering 75/191 (removed 116) transitions.
// Phase 1: matrix 75 rows 124 cols
[2025-05-31 03:43:49] [INFO ] Computed 56 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:43:49] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-05-31 03:43:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:43:49] [INFO ] Implicit Places using invariants and state equation in 268 ms returned [7, 36, 40, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 96, 119]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 435 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/245 places, 75/191 transitions.
Graph (complete) has 234 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 99 transition count 62
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 89 transition count 62
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 57 place count 64 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 62 transition count 50
Applied a total of 60 rules in 6 ms. Remains 62 /103 variables (removed 41) and now considering 50/75 (removed 25) transitions.
// Phase 1: matrix 50 rows 62 cols
[2025-05-31 03:43:49] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:43:50] [INFO ] Implicit Places using invariants in 64 ms returned [48, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/245 places, 50/191 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 57 transition count 46
Applied a total of 6 rules in 5 ms. Remains 57 /60 variables (removed 3) and now considering 46/50 (removed 4) transitions.
// Phase 1: matrix 46 rows 57 cols
[2025-05-31 03:43:50] [INFO ] Computed 17 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:43:50] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-05-31 03:43:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:43:50] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 57/245 places, 46/191 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 727 ms. Remains : 57/245 places, 46/191 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : DES-PT-01b-LTLFireability-13
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-13 TRUE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-13 finished in 778 ms.
All properties solved by simple procedures.
Total runtime 502110 ms.
BK_STOP 1748663030310
--------------------
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="DES-PT-01b"
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 DES-PT-01b, 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-174854063800244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-01b.tgz
mv DES-PT-01b 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 ;