About the Execution of ITS-Tools for MedleyA-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 510185.00 | 0.00 | 0.00 | FFFFFFFFFFFFFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100164.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 MedleyA-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100164
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 99K 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 MedleyA-PT-09-LTLFireability-00
FORMULA_NAME MedleyA-PT-09-LTLFireability-01
FORMULA_NAME MedleyA-PT-09-LTLFireability-02
FORMULA_NAME MedleyA-PT-09-LTLFireability-03
FORMULA_NAME MedleyA-PT-09-LTLFireability-04
FORMULA_NAME MedleyA-PT-09-LTLFireability-05
FORMULA_NAME MedleyA-PT-09-LTLFireability-06
FORMULA_NAME MedleyA-PT-09-LTLFireability-07
FORMULA_NAME MedleyA-PT-09-LTLFireability-08
FORMULA_NAME MedleyA-PT-09-LTLFireability-09
FORMULA_NAME MedleyA-PT-09-LTLFireability-10
FORMULA_NAME MedleyA-PT-09-LTLFireability-11
FORMULA_NAME MedleyA-PT-09-LTLFireability-12
FORMULA_NAME MedleyA-PT-09-LTLFireability-13
FORMULA_NAME MedleyA-PT-09-LTLFireability-14
FORMULA_NAME MedleyA-PT-09-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748855588125
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 09:13:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 09:13:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:13:11] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2025-06-02 09:13:11] [INFO ] Transformed 147 places.
[2025-06-02 09:13:11] [INFO ] Transformed 315 transitions.
[2025-06-02 09:13:11] [INFO ] Found NUPN structural information;
[2025-06-02 09:13:11] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 466 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-09-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 313/313 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 313
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 31 place count 114 transition count 281
Iterating global reduction 1 with 29 rules applied. Total rules applied 60 place count 114 transition count 281
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 113 transition count 279
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 113 transition count 279
Applied a total of 62 rules in 80 ms. Remains 113 /145 variables (removed 32) and now considering 279/313 (removed 34) transitions.
// Phase 1: matrix 279 rows 113 cols
[2025-06-02 09:13:11] [INFO ] Computed 10 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:13:12] [INFO ] Implicit Places using invariants in 341 ms returned []
[2025-06-02 09:13:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:13:12] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2025-06-02 09:13:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/113 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:17] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:17] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:18] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:18] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 4/14 constraints. Problems are: Problem set: 64 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 64 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 279/392 variables, 113/127 constraints. Problems are: Problem set: 64 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:23] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:23] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:23] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 3/130 constraints. Problems are: Problem set: 64 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:28] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 1/131 constraints. Problems are: Problem set: 64 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:32] [INFO ] Deduced a trap along path composed of 3 places in 54 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 1/132 constraints. Problems are: Problem set: 64 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:37] [INFO ] Deduced a trap along path composed of 2 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:37] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 2/134 constraints. Problems are: Problem set: 64 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:41] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 1/135 constraints. Problems are: Problem set: 64 solved, 214 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/392 variables, and 135 constraints, problems are : Problem set: 64 solved, 214 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 64 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 6/6 constraints. Problems are: Problem set: 64 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 64 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 9/19 constraints. Problems are: Problem set: 64 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:44] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:44] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/21 constraints. Problems are: Problem set: 64 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/21 constraints. Problems are: Problem set: 64 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 279/392 variables, 113/134 constraints. Problems are: Problem set: 64 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 214/348 constraints. Problems are: Problem set: 64 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:51] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:52] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:53] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:53] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 4/352 constraints. Problems are: Problem set: 64 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:14:04] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:14:05] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 354 constraints, problems are : Problem set: 64 solved, 214 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 214/278 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60871ms problems are : Problem set: 64 solved, 214 unsolved
Search for dead transitions found 64 dead transitions in 60907ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 113/145 places, 215/313 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61847 ms. Remains : 113/145 places, 215/313 transitions.
Support contains 41 out of 113 places after structural reductions.
[2025-06-02 09:14:13] [INFO ] Flatten gal took : 78 ms
[2025-06-02 09:14:13] [INFO ] Flatten gal took : 33 ms
[2025-06-02 09:14:13] [INFO ] Input system was already deterministic with 215 transitions.
Support contains 40 out of 113 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (1307 resets) in 2815 ms. (14 steps per ms) remains 19/35 properties
BEST_FIRST walk for 4004 steps (27 resets) in 45 ms. (87 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (26 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (26 resets) in 72 ms. (54 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (28 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (28 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (29 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (27 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (28 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (22 resets) in 48 ms. (81 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (24 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (28 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (29 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (27 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (28 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (28 resets) in 43 ms. (90 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (26 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (26 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (25 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (26 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
// Phase 1: matrix 215 rows 113 cols
[2025-06-02 09:14:15] [INFO ] Computed 10 invariants in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 1 (OVERLAPS) 42/65 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 3 (OVERLAPS) 34/99 variables, 6/10 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 204/303 variables, 99/109 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/109 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 14/317 variables, 8/117 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/117 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 10/327 variables, 5/122 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 0/122 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 1/328 variables, 1/123 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/123 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/123 constraints. Problems are: Problem set: 6 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 123 constraints, problems are : Problem set: 6 solved, 13 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 13 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 44/63 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 32/95 variables, 5/9 constraints. Problems are: Problem set: 8 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:14:16] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/10 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 202/297 variables, 95/105 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 6/111 constraints. Problems are: Problem set: 8 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:14:16] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:14:16] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 2/113 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/113 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 16/313 variables, 10/123 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 1/124 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 5/129 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/313 variables, 0/129 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 11/324 variables, 6/135 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/324 variables, 0/135 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 4/328 variables, 2/137 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/328 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 0/328 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 137 constraints, problems are : Problem set: 8 solved, 11 unsolved in 4119 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 11/19 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5093ms problems are : Problem set: 8 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 9 properties in 3071 ms.
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 215/215 transitions.
Graph (complete) has 386 edges and 113 vertex of which 111 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 111 transition count 193
Reduce places removed 19 places and 0 transitions.
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 1 with 23 rules applied. Total rules applied 44 place count 92 transition count 189
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 90 transition count 187
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 48 place count 90 transition count 180
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 62 place count 83 transition count 180
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 67 place count 78 transition count 172
Iterating global reduction 3 with 5 rules applied. Total rules applied 72 place count 78 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 72 place count 78 transition count 171
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 77 transition count 171
Performed 24 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 122 place count 53 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 53 transition count 143
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 52 transition count 141
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 52 transition count 141
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 138 place count 46 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 146 place count 46 transition count 157
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 44 transition count 180
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 154 place count 44 transition count 176
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 158 place count 40 transition count 176
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 160 place count 40 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 162 place count 38 transition count 174
Applied a total of 162 rules in 105 ms. Remains 38 /113 variables (removed 75) and now considering 174/215 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 38/113 places, 174/215 transitions.
RANDOM walk for 10506 steps (2382 resets) in 103 ms. (101 steps per ms) remains 0/2 properties
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-09-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 15 stabilizing places and 16 stable transitions
Graph (complete) has 386 edges and 113 vertex of which 111 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
FORMULA MedleyA-PT-09-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 215/215 transitions.
Graph (complete) has 386 edges and 113 vertex of which 111 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 110 transition count 194
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 92 transition count 191
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 91 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 45 place count 90 transition count 188
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 45 place count 90 transition count 181
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 59 place count 83 transition count 181
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 66 place count 76 transition count 171
Iterating global reduction 4 with 7 rules applied. Total rules applied 73 place count 76 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 73 place count 76 transition count 170
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 75 transition count 170
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 121 place count 51 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 123 place count 51 transition count 144
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 50 transition count 142
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 50 transition count 142
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 137 place count 44 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 147 place count 44 transition count 156
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 151 place count 42 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 41 transition count 178
Applied a total of 152 rules in 69 ms. Remains 41 /113 variables (removed 72) and now considering 178/215 (removed 37) transitions.
// Phase 1: matrix 178 rows 41 cols
[2025-06-02 09:14:23] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:14:23] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-02 09:14:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:14:24] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 09:14:24] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:14:24] [INFO ] Redundant transitions in 11 ms returned []
Running 174 sub problems to find dead transitions.
[2025-06-02 09:14:24] [INFO ] Invariant cache hit.
[2025-06-02 09:14:24] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 178/219 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 96/145 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 145 constraints, problems are : Problem set: 0 solved, 174 unsolved in 8077 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 178/219 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 96/145 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 174/319 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 319 constraints, problems are : Problem set: 0 solved, 174 unsolved in 23916 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32226ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 32228ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/113 places, 178/215 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32614 ms. Remains : 41/113 places, 178/215 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-00
Product exploration explored 100000 steps with 15843 reset in 732 ms.
Product exploration explored 100000 steps with 15844 reset in 410 ms.
Computed a total of 8 stabilizing places and 101 stable transitions
Computed a total of 8 stabilizing places and 101 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33780 steps (5332 resets) in 263 ms. (127 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 41 /41 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2025-06-02 09:14:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:14:58] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-02 09:14:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:14:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 09:14:58] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:14:58] [INFO ] Redundant transitions in 6 ms returned []
Running 174 sub problems to find dead transitions.
[2025-06-02 09:14:58] [INFO ] Invariant cache hit.
[2025-06-02 09:14:58] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 178/219 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 96/145 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 145 constraints, problems are : Problem set: 0 solved, 174 unsolved in 8483 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 178/219 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 96/145 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 174/319 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 319 constraints, problems are : Problem set: 0 solved, 174 unsolved in 25950 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34643ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 34643ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34959 ms. Remains : 41/41 places, 178/178 transitions.
Computed a total of 8 stabilizing places and 101 stable transitions
Computed a total of 8 stabilizing places and 101 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 34718 steps (5484 resets) in 303 ms. (114 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15884 reset in 425 ms.
Product exploration explored 100000 steps with 15843 reset in 297 ms.
Built C files in :
/tmp/ltsmin16915904810434691614
[2025-06-02 09:15:35] [INFO ] Computing symmetric may disable matrix : 178 transitions.
[2025-06-02 09:15:35] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 09:15:35] [INFO ] Computing symmetric may enable matrix : 178 transitions.
[2025-06-02 09:15:35] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 09:15:35] [INFO ] Computing Do-Not-Accords matrix : 178 transitions.
[2025-06-02 09:15:35] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 09:15:35] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16915904810434691614
Running compilation step : cd /tmp/ltsmin16915904810434691614;'/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 891 ms.
Running link step : cd /tmp/ltsmin16915904810434691614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin16915904810434691614;'/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/stateBased5927033241877907085.hoa' '--buchi-type=spotba'
LTSmin run took 651 ms.
FORMULA MedleyA-PT-09-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-09-LTLFireability-00 finished in 73176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)||X(p2)))))'
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 215/215 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 106 transition count 208
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 106 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 206
Applied a total of 16 rules in 18 ms. Remains 105 /113 variables (removed 8) and now considering 206/215 (removed 9) transitions.
// Phase 1: matrix 206 rows 105 cols
[2025-06-02 09:15:36] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:15:37] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 09:15:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:15:37] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2025-06-02 09:15:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:39] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:39] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:40] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:40] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:40] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:40] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:40] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:40] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/311 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:44] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:45] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:45] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:48] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:51] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:57] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 11 (OVERLAPS) 0/311 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 129 constraints, problems are : Problem set: 0 solved, 205 unsolved in 26925 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/311 variables, 105/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 205/332 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:08] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:15] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:20] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 337 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 57037ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 57039ms
Starting structural reductions in LTL mode, iteration 1 : 105/113 places, 206/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57371 ms. Remains : 105/113 places, 206/215 transitions.
Stuttering acceptance computed with spot in 285 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-01
Entered a terminal (fully accepting) state of product in 83 steps with 2 reset in 2 ms.
FORMULA MedleyA-PT-09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLFireability-01 finished in 57690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((X((p1||G(p2))) U (p0&&X((p1||G(p2)))))))))'
Support contains 1 out of 113 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 : 113/113 places, 215/215 transitions.
Graph (complete) has 386 edges and 113 vertex of which 111 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 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 110 transition count 195
Reduce places removed 17 places and 0 transitions.
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 1 with 21 rules applied. Total rules applied 39 place count 93 transition count 191
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 44 place count 91 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 90 transition count 188
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 45 place count 90 transition count 182
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 57 place count 84 transition count 182
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 63 place count 78 transition count 173
Iterating global reduction 4 with 6 rules applied. Total rules applied 69 place count 78 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 69 place count 78 transition count 172
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 77 transition count 172
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 45 rules applied. Total rules applied 116 place count 54 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 118 place count 54 transition count 146
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 53 transition count 144
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 53 transition count 144
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 132 place count 47 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 144 place count 47 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 146 place count 46 transition count 177
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 46 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 45 transition count 176
Applied a total of 148 rules in 74 ms. Remains 45 /113 variables (removed 68) and now considering 176/215 (removed 39) transitions.
// Phase 1: matrix 176 rows 45 cols
[2025-06-02 09:16:34] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:16:34] [INFO ] Implicit Places using invariants in 72 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/113 places, 176/215 transitions.
Applied a total of 0 rules in 7 ms. Remains 44 /44 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 44/113 places, 176/215 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-02
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLFireability-02 finished in 232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 215/215 transitions.
Graph (complete) has 386 edges and 113 vertex of which 111 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 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 110 transition count 196
Reduce places removed 16 places and 0 transitions.
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 1 with 20 rules applied. Total rules applied 37 place count 94 transition count 192
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 92 transition count 190
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 41 place count 92 transition count 184
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 53 place count 86 transition count 184
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 59 place count 80 transition count 175
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 80 transition count 175
Performed 23 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 112 place count 56 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 114 place count 56 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 55 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 55 transition count 146
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 128 place count 49 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 136 place count 49 transition count 162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 140 place count 47 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 46 transition count 184
Applied a total of 141 rules in 43 ms. Remains 46 /113 variables (removed 67) and now considering 184/215 (removed 31) transitions.
// Phase 1: matrix 184 rows 46 cols
[2025-06-02 09:16:34] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:16:34] [INFO ] Implicit Places using invariants in 64 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/113 places, 184/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 45/113 places, 184/215 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-04
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLFireability-04 finished in 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U (G(!p0) U X(p1)))))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 215/215 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 105 transition count 206
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 105 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 204
Applied a total of 18 rules in 5 ms. Remains 104 /113 variables (removed 9) and now considering 204/215 (removed 11) transitions.
// Phase 1: matrix 204 rows 104 cols
[2025-06-02 09:16:35] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:16:35] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-02 09:16:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:16:35] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-06-02 09:16:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:38] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:38] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:38] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:38] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:38] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:39] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:42] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:43] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:43] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:43] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:46] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:47] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 126 constraints, problems are : Problem set: 0 solved, 203 unsolved in 19774 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/327 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:59] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:00] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:00] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 332 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 49880ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 49881ms
Starting structural reductions in LTL mode, iteration 1 : 104/113 places, 204/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50211 ms. Remains : 104/113 places, 204/215 transitions.
Stuttering acceptance computed with spot in 439 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) (NOT p0)), (NOT p0), false, (NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-05
Product exploration explored 100000 steps with 3346 reset in 266 ms.
Product exploration explored 100000 steps with 3346 reset in 401 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 367 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 154 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) (NOT p0)), (NOT p0), false, (NOT p0)]
RANDOM walk for 543 steps (15 resets) in 13 ms. (38 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 6 factoid took 327 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 423 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) (NOT p0)), (NOT p0), false, (NOT p0)]
Stuttering acceptance computed with spot in 416 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) (NOT p0)), (NOT p0), false, (NOT p0)]
[2025-06-02 09:17:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 09:17:28] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 09:17:28] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-02 09:17:28] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2025-06-02 09:17:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 09:17:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 09:17:28] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-02 09:17:28] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2025-06-02 09:17:29] [INFO ] Computed and/alt/rep : 175/670/175 causal constraints (skipped 28 transitions) in 29 ms.
[2025-06-02 09:17:29] [INFO ] Added : 90 causal constraints over 18 iterations in 599 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-06-02 09:17:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:17:29] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 09:17:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:17:29] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-06-02 09:17:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:33] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:33] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:33] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:33] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:33] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:33] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:37] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:37] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:37] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:38] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:42] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:44] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 126 constraints, problems are : Problem set: 0 solved, 203 unsolved in 24194 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/327 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:59] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:59] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:00] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 332 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54388ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 54390ms
Finished structural reductions in LTL mode , in 1 iterations and 54758 ms. Remains : 104/104 places, 204/204 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 367 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) (NOT p0)), (NOT p0), false, (NOT p0)]
RANDOM walk for 138 steps (1 resets) in 5 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) (NOT p0)), (NOT p0), false, (NOT p0)]
Stuttering acceptance computed with spot in 402 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) (NOT p0)), (NOT p0), false, (NOT p0)]
[2025-06-02 09:18:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 09:18:26] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 09:18:26] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-02 09:18:26] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2025-06-02 09:18:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 09:18:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:26] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-02 09:18:26] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2025-06-02 09:18:26] [INFO ] Computed and/alt/rep : 175/670/175 causal constraints (skipped 28 transitions) in 25 ms.
[2025-06-02 09:18:27] [INFO ] Added : 90 causal constraints over 18 iterations in 570 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 371 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) (NOT p0)), (NOT p0), false, (NOT p0)]
Product exploration explored 100000 steps with 3341 reset in 192 ms.
Product exploration explored 100000 steps with 3336 reset in 236 ms.
Applying partial POR strategy [false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 397 ms :[(NOT p1), (NOT p1), (NOT p1), false, (AND (NOT p1) (NOT p0)), (NOT p0), false, (NOT p0)]
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 204/204 transitions.
Graph (complete) has 367 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 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 102 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 4 rules applied. Total rules applied 19 place count 102 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 102 transition count 198
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 21 place count 102 transition count 200
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 26 place count 102 transition count 200
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 34 place count 94 transition count 190
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 42 place count 94 transition count 190
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 3 with 22 rules applied. Total rules applied 64 place count 94 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 68 place count 94 transition count 193
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 76 place count 86 transition count 183
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 84 place count 86 transition count 183
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 91 place count 86 transition count 221
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 94 place count 83 transition count 215
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 83 transition count 215
Deduced a syphon composed of 33 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 109 place count 83 transition count 203
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 109 rules in 48 ms. Remains 83 /104 variables (removed 21) and now considering 203/204 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:18:28] [INFO ] Redundant transitions in 5 ms returned []
Running 202 sub problems to find dead transitions.
// Phase 1: matrix 203 rows 83 cols
[2025-06-02 09:18:28] [INFO ] Computed 10 invariants in 3 ms
[2025-06-02 09:18:28] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:31] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:31] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:31] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 5 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:31] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 4 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:31] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:31] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 7 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 6/16 constraints. Problems are: Problem set: 39 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/16 constraints. Problems are: Problem set: 39 solved, 163 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
At refinement iteration 5 (OVERLAPS) 203/286 variables, 83/99 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 57/156 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/156 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/286 variables, 0/156 constraints. Problems are: Problem set: 43 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 156 constraints, problems are : Problem set: 43 solved, 159 unsolved in 9508 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 43 solved, 159 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 17/66 variables, 4/6 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/12 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 14/80 variables, 4/16 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 202/282 variables, 80/96 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 57/153 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 159/312 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/312 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 4/286 variables, 3/315 constraints. Problems are: Problem set: 43 solved, 159 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/315 constraints. Problems are: Problem set: 43 solved, 159 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/286 variables, and 315 constraints, problems are : Problem set: 43 solved, 159 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 159/202 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39751ms problems are : Problem set: 43 solved, 159 unsolved
Search for dead transitions found 43 dead transitions in 39752ms
Found 43 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 43 transitions
Dead transitions reduction (with SMT) removed 43 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 83/104 places, 160/204 transitions.
Graph (complete) has 290 edges and 83 vertex of which 50 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.2 ms
Discarding 33 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 48 transition count 187
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 11 ms. Remains 48 /83 variables (removed 35) and now considering 187/160 (removed -27) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/104 places, 187/204 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39824 ms. Remains : 48/104 places, 187/204 transitions.
Built C files in :
/tmp/ltsmin15275224206082200231
[2025-06-02 09:19:08] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15275224206082200231
Running compilation step : cd /tmp/ltsmin15275224206082200231;'/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 690 ms.
Running link step : cd /tmp/ltsmin15275224206082200231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15275224206082200231;'/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/stateBased8197728464671293247.hoa' '--buchi-type=spotba'
LTSmin run took 316 ms.
FORMULA MedleyA-PT-09-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-09-LTLFireability-05 finished in 154779 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(G(p0))&&F(p1)) U (p2 U X(p3)))))'
Support contains 8 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 215/215 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 106 transition count 207
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 106 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 205
Applied a total of 16 rules in 3 ms. Remains 105 /113 variables (removed 8) and now considering 205/215 (removed 10) transitions.
// Phase 1: matrix 205 rows 105 cols
[2025-06-02 09:19:09] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:19:09] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 09:19:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:19:10] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-02 09:19:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:13] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:13] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:13] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:14] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:14] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:14] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:18] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:18] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:18] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:19] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:27] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:29] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/310 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 127 constraints, problems are : Problem set: 0 solved, 204 unsolved in 27777 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 204/329 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:41] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:42] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:43] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 334 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 57928ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 57930ms
Starting structural reductions in LTL mode, iteration 1 : 105/113 places, 205/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58281 ms. Remains : 105/113 places, 205/215 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p3), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-09
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLFireability-09 finished in 58645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1))&&(F(p2) U p3))))'
Support contains 8 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 215/215 transitions.
Graph (complete) has 386 edges and 113 vertex of which 111 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 110 transition count 197
Reduce places removed 15 places and 0 transitions.
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 1 with 19 rules applied. Total rules applied 35 place count 95 transition count 193
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 93 transition count 191
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 39 place count 93 transition count 184
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 53 place count 86 transition count 184
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 60 place count 79 transition count 174
Iterating global reduction 3 with 7 rules applied. Total rules applied 67 place count 79 transition count 174
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 107 place count 58 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 58 transition count 151
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 57 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 57 transition count 149
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 123 place count 51 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 127 place count 51 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 50 transition count 189
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 131 place count 50 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 49 transition count 188
Applied a total of 132 rules in 30 ms. Remains 49 /113 variables (removed 64) and now considering 188/215 (removed 27) transitions.
// Phase 1: matrix 188 rows 49 cols
[2025-06-02 09:20:08] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:20:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 09:20:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:20:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 09:20:08] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:20:08] [INFO ] Redundant transitions in 3 ms returned []
Running 186 sub problems to find dead transitions.
[2025-06-02 09:20:08] [INFO ] Invariant cache hit.
[2025-06-02 09:20:08] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 188/237 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 77 constraints, problems are : Problem set: 0 solved, 186 unsolved in 7285 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 188/237 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 186/263 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:23] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 264 constraints, problems are : Problem set: 0 solved, 186 unsolved in 27423 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34998ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 34999ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/113 places, 188/215 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35247 ms. Remains : 49/113 places, 188/215 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (NOT p1), (OR (NOT p3) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-10
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLFireability-10 finished in 35540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U p1))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 215/215 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 106 transition count 207
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 106 transition count 207
Applied a total of 14 rules in 4 ms. Remains 106 /113 variables (removed 7) and now considering 207/215 (removed 8) transitions.
// Phase 1: matrix 207 rows 106 cols
[2025-06-02 09:20:44] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:20:44] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-02 09:20:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:20:44] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2025-06-02 09:20: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/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:47] [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-06-02 09:20:47] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:48] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:48] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:48] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:48] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/313 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:52] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:52] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:52] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:53] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:58] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:20:58] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (OVERLAPS) 0/313 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 128 constraints, problems are : Problem set: 0 solved, 206 unsolved in 23461 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/313 variables, 106/126 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 206/332 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:21:12] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:21:12] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:21:21] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:21:21] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:21:22] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 339 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53644ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 53645ms
Starting structural reductions in LTL mode, iteration 1 : 106/113 places, 207/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54036 ms. Remains : 106/113 places, 207/215 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLFireability-11 finished in 54245 ms.
All properties solved by simple procedures.
Total runtime 507563 ms.
BK_STOP 1748856098310
--------------------
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="MedleyA-PT-09"
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 MedleyA-PT-09, 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 r128-smll-174876524100164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-09.tgz
mv MedleyA-PT-09 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 ;