About the Execution of ITS-Tools for SemanticWebServices-PT-S064P18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FF?FFFFFFFTF?FFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889265000876.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 SemanticWebServices-PT-S064P18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889265000876
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 173K 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 SemanticWebServices-PT-S064P18-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749233013164
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 18:03:34] [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-06 18:03:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 18:03:34] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2025-06-06 18:03:34] [INFO ] Transformed 154 places.
[2025-06-06 18:03:34] [INFO ] Transformed 236 transitions.
[2025-06-06 18:03:34] [INFO ] Parsed PT model containing 154 places and 236 transitions and 1265 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 122 transitions
Reduce redundant transitions removed 122 transitions.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 112/112 transitions.
Ensure Unique test removed 33 places
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 117 transition count 112
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 112 transition count 107
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 112 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 112 transition count 106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 109 transition count 103
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 109 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 108 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 108 transition count 102
Applied a total of 54 rules in 46 ms. Remains 108 /152 variables (removed 44) and now considering 102/112 (removed 10) transitions.
[2025-06-06 18:03:34] [INFO ] Flow matrix only has 93 transitions (discarded 9 similar events)
// Phase 1: matrix 93 rows 108 cols
[2025-06-06 18:03:34] [INFO ] Computed 17 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:03:35] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-06-06 18:03:35] [INFO ] Flow matrix only has 93 transitions (discarded 9 similar events)
[2025-06-06 18:03:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:03:35] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-06-06 18:03:35] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2025-06-06 18:03:35] [INFO ] Flow matrix only has 93 transitions (discarded 9 similar events)
[2025-06-06 18:03:35] [INFO ] Invariant cache hit.
[2025-06-06 18:03:35] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 93/201 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 84/209 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 209 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2522 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 93/201 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 84/209 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 98/307 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 307 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2615 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5173ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5184ms
Starting structural reductions in LTL mode, iteration 1 : 108/152 places, 102/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5551 ms. Remains : 108/152 places, 102/112 transitions.
Support contains 44 out of 108 places after structural reductions.
[2025-06-06 18:03:40] [INFO ] Flatten gal took : 19 ms
[2025-06-06 18:03:40] [INFO ] Flatten gal took : 10 ms
[2025-06-06 18:03:40] [INFO ] Input system was already deterministic with 102 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (8 resets) in 1740 ms. (22 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
[2025-06-06 18:03:41] [INFO ] Flow matrix only has 93 transitions (discarded 9 similar events)
[2025-06-06 18:03:41] [INFO ] Invariant cache hit.
[2025-06-06 18:03:41] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/19 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/25 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/27 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/47 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 26/73 variables, 26/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/73 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/73 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/92 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/92 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 22/114 variables, 22/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/114 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/114 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 20/134 variables, 19/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/134 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 25/159 variables, 25/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/159 variables, 5/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/159 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/179 variables, 19/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/179 variables, 10/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/179 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 22/201 variables, 22/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/201 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/201 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/201 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/19 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/25 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/27 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/47 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 26/73 variables, 26/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/73 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/73 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/73 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 19/92 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/92 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/114 variables, 22/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/114 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/114 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/134 variables, 19/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/134 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 25/159 variables, 25/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/159 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/159 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 20/179 variables, 19/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/179 variables, 10/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/179 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 22/201 variables, 22/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/201 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/201 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/201 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 7 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 271 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(p0)||G(X(!p0))))||G(p1))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Ensure Unique test removed 15 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 93 transition count 102
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 23 place count 85 transition count 94
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 85 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 79 transition count 88
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 79 transition count 88
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 75 transition count 84
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 75 transition count 84
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 71 transition count 80
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 71 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 69 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 69 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 68 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 68 transition count 77
Applied a total of 65 rules in 17 ms. Remains 68 /108 variables (removed 40) and now considering 77/102 (removed 25) transitions.
[2025-06-06 18:03:41] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
// Phase 1: matrix 68 rows 68 cols
[2025-06-06 18:03:41] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:03:41] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-06 18:03:41] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2025-06-06 18:03:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:03:42] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-06 18:03:42] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2025-06-06 18:03:42] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2025-06-06 18:03:42] [INFO ] Invariant cache hit.
[2025-06-06 18:03:42] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 68/136 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 129 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1114 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 68/136 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 73/202 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 202 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1244 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2378ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2378ms
Starting structural reductions in LTL mode, iteration 1 : 68/108 places, 77/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2479 ms. Remains : 68/108 places, 77/102 transitions.
Stuttering acceptance computed with spot in 449 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1), false, false, false, false, false, false]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-02
Product exploration explored 100000 steps with 127 reset in 252 ms.
Product exploration explored 100000 steps with 1703 reset in 225 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 145 edges and 68 vertex of which 62 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, false, p0, false, false, false]
RANDOM walk for 3601 steps (1 resets) in 16 ms. (211 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, false, p0, false, false, false]
Stuttering acceptance computed with spot in 196 ms :[true, false, p0, false, false, false]
Support contains 2 out of 68 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2025-06-06 18:03:46] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2025-06-06 18:03:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:03:46] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 18:03:46] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2025-06-06 18:03:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:03:46] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-06 18:03:46] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2025-06-06 18:03:46] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2025-06-06 18:03:46] [INFO ] Invariant cache hit.
[2025-06-06 18:03:46] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 68/136 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 129 constraints, problems are : Problem set: 0 solved, 73 unsolved in 999 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 68/136 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 73/202 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 202 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1257 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2265ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2265ms
Finished structural reductions in LTL mode , in 1 iterations and 2349 ms. Remains : 68/68 places, 77/77 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 145 edges and 68 vertex of which 62 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, false, p0, false, false, false]
RANDOM walk for 13415 steps (5 resets) in 41 ms. (319 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, false, p0, false, false, false]
Stuttering acceptance computed with spot in 182 ms :[true, false, p0, false, false, false]
Stuttering acceptance computed with spot in 182 ms :[true, false, p0, false, false, false]
Product exploration explored 100000 steps with 2594 reset in 268 ms.
Product exploration explored 100000 steps with 1232 reset in 190 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 161 ms :[true, false, p0, false, false, false]
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 77/77 transitions.
Graph (complete) has 145 edges and 68 vertex of which 62 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 60 transition count 72
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 60 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 8 place count 57 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 57 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 14 place count 54 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 54 transition count 66
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 20 place count 51 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 23 place count 51 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 25 place count 51 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 50 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 50 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 49 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 49 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 48 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 48 transition count 58
Applied a total of 31 rules in 24 ms. Remains 48 /68 variables (removed 20) and now considering 58/77 (removed 19) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:03:50] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2025-06-06 18:03:50] [INFO ] Flow matrix only has 50 transitions (discarded 8 similar events)
// Phase 1: matrix 50 rows 48 cols
[2025-06-06 18:03:50] [INFO ] Computed 1 invariants in 0 ms
[2025-06-06 18:03:50] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 49/95 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 43/90 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 2/97 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 1/98 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 93 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1040 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 49/95 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 43/90 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 54/144 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 2/97 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 1/98 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/98 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 147 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1037 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2082ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2082ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/68 places, 58/77 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2113 ms. Remains : 48/68 places, 58/77 transitions.
Built C files in :
/tmp/ltsmin4452699359006920373
[2025-06-06 18:03:52] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4452699359006920373
Running compilation step : cd /tmp/ltsmin4452699359006920373;'/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 251 ms.
Running link step : cd /tmp/ltsmin4452699359006920373;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4452699359006920373;'/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/stateBased836463392480179965.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 77/77 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 67 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 65 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 65 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 63 transition count 72
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 63 transition count 72
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 61 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 61 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 61 transition count 68
Applied a total of 16 rules in 10 ms. Remains 61 /68 variables (removed 7) and now considering 68/77 (removed 9) transitions.
[2025-06-06 18:04:07] [INFO ] Flow matrix only has 61 transitions (discarded 7 similar events)
// Phase 1: matrix 61 rows 61 cols
[2025-06-06 18:04:07] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:04:07] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 18:04:07] [INFO ] Flow matrix only has 61 transitions (discarded 7 similar events)
[2025-06-06 18:04:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:04:07] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-06 18:04:07] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-06 18:04:07] [INFO ] Flow matrix only has 61 transitions (discarded 7 similar events)
[2025-06-06 18:04:07] [INFO ] Invariant cache hit.
[2025-06-06 18:04:07] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 61/122 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 115 constraints, problems are : Problem set: 0 solved, 64 unsolved in 819 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 61/122 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 64/179 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 179 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1010 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1841ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1841ms
Starting structural reductions in LTL mode, iteration 1 : 61/68 places, 68/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1931 ms. Remains : 61/68 places, 68/77 transitions.
Built C files in :
/tmp/ltsmin1888998433264699209
[2025-06-06 18:04:09] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1888998433264699209
Running compilation step : cd /tmp/ltsmin1888998433264699209;'/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 120 ms.
Running link step : cd /tmp/ltsmin1888998433264699209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1888998433264699209;'/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/stateBased5175218735492775299.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 18:04:24] [INFO ] Flatten gal took : 3 ms
[2025-06-06 18:04:24] [INFO ] Flatten gal took : 3 ms
[2025-06-06 18:04:24] [INFO ] Time to serialize gal into /tmp/LTL1254571429195002487.gal : 1 ms
[2025-06-06 18:04:24] [INFO ] Time to serialize properties into /tmp/LTL15115557900230967955.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1254571429195002487.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12959977718842522118.hoa' '-atoms' '/tmp/LTL15115557900230967955.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15115557900230967955.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12959977718842522118.hoa
Detected timeout of ITS tools.
[2025-06-06 18:04:39] [INFO ] Flatten gal took : 3 ms
[2025-06-06 18:04:39] [INFO ] Flatten gal took : 3 ms
[2025-06-06 18:04:39] [INFO ] Time to serialize gal into /tmp/LTL8883240676888647224.gal : 2 ms
[2025-06-06 18:04:39] [INFO ] Time to serialize properties into /tmp/LTL13561993879790776329.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8883240676888647224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13561993879790776329.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X((X("((p42<1)||(p105<1))"))||(G(X("((p42>=1)&&(p105>=1))")))))||(G("(p74>=1)")))))
Formula 0 simplified : X(F!"(p74>=1)" & XX(!"((p42<1)||(p105<1))" & F!"((p42>=1)&&(p105>=1))"))
Detected timeout of ITS tools.
[2025-06-06 18:04:54] [INFO ] Flatten gal took : 7 ms
[2025-06-06 18:04:54] [INFO ] Applying decomposition
[2025-06-06 18:04:54] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4338904592313529372.txt' '-o' '/tmp/graph4338904592313529372.bin' '-w' '/tmp/graph4338904592313529372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4338904592313529372.bin' '-l' '-1' '-v' '-w' '/tmp/graph4338904592313529372.weights' '-q' '0' '-e' '0.001'
[2025-06-06 18:04:54] [INFO ] Decomposing Gal with order
[2025-06-06 18:04:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 18:04:54] [INFO ] Removed a total of 15 redundant transitions.
[2025-06-06 18:04:54] [INFO ] Flatten gal took : 34 ms
[2025-06-06 18:04:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 2 ms.
[2025-06-06 18:04:54] [INFO ] Time to serialize gal into /tmp/LTL11210893004907849250.gal : 2 ms
[2025-06-06 18:04:54] [INFO ] Time to serialize properties into /tmp/LTL544566994365181854.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11210893004907849250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL544566994365181854.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((X((X("((i7.u24.p42<1)||(i7.u24.p105<1))"))||(G(X("((i7.u24.p42>=1)&&(i7.u24.p105>=1))")))))||(G("(i2.u6.p74>=1)")))))
Formula 0 simplified : X(F!"(i2.u6.p74>=1)" & XX(!"((i7.u24.p42<1)||(i7.u24.p105<1))" & F!"((i7.u24.p42>=1)&&(i7.u24.p105>=1))"))
Detected timeout of ITS tools.
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-02 finished in 88001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (F(!p1) U p2)) U p3))'
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 271 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 13 places
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 80 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 80 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 26 place count 73 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 33 place count 73 transition count 83
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 38 place count 68 transition count 78
Iterating global reduction 0 with 5 rules applied. Total rules applied 43 place count 68 transition count 78
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 48 place count 63 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 53 place count 63 transition count 73
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 57 place count 59 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 61 place count 59 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 65 place count 55 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 69 place count 55 transition count 65
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 73 place count 51 transition count 61
Iterating global reduction 0 with 4 rules applied. Total rules applied 77 place count 51 transition count 61
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 80 place count 48 transition count 58
Iterating global reduction 0 with 3 rules applied. Total rules applied 83 place count 48 transition count 58
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 86 place count 48 transition count 55
Applied a total of 86 rules in 17 ms. Remains 48 /108 variables (removed 60) and now considering 55/102 (removed 47) transitions.
[2025-06-06 18:05:09] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
// Phase 1: matrix 48 rows 48 cols
[2025-06-06 18:05:09] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:09] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 18:05:09] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
[2025-06-06 18:05:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-06 18:05:10] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:05:10] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-06 18:05:10] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
[2025-06-06 18:05:10] [INFO ] Invariant cache hit.
[2025-06-06 18:05:10] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 47/93 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 41/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 2/95 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 1/96 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 93 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1023 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 48/48 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 47/93 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 41/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 51/141 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 2/95 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 1/96 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 144 constraints, problems are : Problem set: 0 solved, 51 unsolved in 989 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 48/48 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2015ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2016ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/108 places, 55/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2143 ms. Remains : 48/108 places, 55/102 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p3), p1, (NOT p2), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-04
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-04 finished in 2333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Ensure Unique test removed 15 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 93 transition count 102
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 23 place count 85 transition count 94
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 85 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 79 transition count 88
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 79 transition count 88
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 75 transition count 84
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 75 transition count 84
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 71 transition count 80
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 71 transition count 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 68 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 68 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 66 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 66 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 64 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 64 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 62 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 62 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 79 place count 62 transition count 69
Applied a total of 79 rules in 14 ms. Remains 62 /108 variables (removed 46) and now considering 69/102 (removed 33) transitions.
[2025-06-06 18:05:12] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
// Phase 1: matrix 62 rows 62 cols
[2025-06-06 18:05:12] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:12] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 18:05:12] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
[2025-06-06 18:05:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:12] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 18:05:12] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2025-06-06 18:05:12] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
[2025-06-06 18:05:12] [INFO ] Invariant cache hit.
[2025-06-06 18:05:12] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 2/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 62/124 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 117 constraints, problems are : Problem set: 0 solved, 65 unsolved in 842 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 2/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 62/124 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 65/182 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 182 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1040 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1889ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 1889ms
Starting structural reductions in LTL mode, iteration 1 : 62/108 places, 69/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1980 ms. Remains : 62/108 places, 69/102 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-05 finished in 2146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0)) U (F(p1)||G(p2))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Ensure Unique test removed 15 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 93 transition count 102
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 22 place count 86 transition count 95
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 86 transition count 95
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 81 transition count 90
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 81 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 78 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 78 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 75 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 75 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 74 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 74 transition count 83
Applied a total of 53 rules in 10 ms. Remains 74 /108 variables (removed 34) and now considering 83/102 (removed 19) transitions.
[2025-06-06 18:05:14] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 74 cols
[2025-06-06 18:05:14] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:14] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 18:05:14] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2025-06-06 18:05:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:14] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-06 18:05:14] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2025-06-06 18:05:14] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2025-06-06 18:05:14] [INFO ] Invariant cache hit.
[2025-06-06 18:05:14] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 74/148 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 65/141 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 141 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1107 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 74/148 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 65/141 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 79/220 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/148 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 220 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1425 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2552ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 2552ms
Starting structural reductions in LTL mode, iteration 1 : 74/108 places, 83/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2668 ms. Remains : 74/108 places, 83/102 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-06
Product exploration explored 100000 steps with 4 reset in 188 ms.
Product exploration explored 100000 steps with 0 reset in 185 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 157 edges and 74 vertex of which 68 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 704 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
RANDOM walk for 27246 steps (7 resets) in 160 ms. (169 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p2))), (F p1), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 906 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 3 out of 74 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 : 74/74 places, 83/83 transitions.
Graph (complete) has 157 edges and 74 vertex of which 68 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 67 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 67 transition count 79
Applied a total of 3 rules in 8 ms. Remains 67 /74 variables (removed 7) and now considering 79/83 (removed 4) transitions.
[2025-06-06 18:05:19] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
// Phase 1: matrix 69 rows 67 cols
[2025-06-06 18:05:19] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:19] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-06 18:05:19] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2025-06-06 18:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:19] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-06-06 18:05:19] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:05:19] [INFO ] Redundant transitions in 1 ms returned []
Running 75 sub problems to find dead transitions.
[2025-06-06 18:05:19] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2025-06-06 18:05:19] [INFO ] Invariant cache hit.
[2025-06-06 18:05:19] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 68/133 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 62/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 2/135 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 1/136 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 131 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1872 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 68/133 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 62/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 75/203 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 2/135 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/136 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 206 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1843 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3720ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3720ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/74 places, 79/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3826 ms. Remains : 67/74 places, 79/83 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 7 factoid took 416 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
RANDOM walk for 34099 steps (9 resets) in 296 ms. (114 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F p1), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 7 factoid took 548 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-06 finished in 11160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F((F(!p0)&&X(p1))) U p2) U X((G(p2)&&p3))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 95 transition count 102
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 20 place count 88 transition count 95
Iterating global reduction 1 with 7 rules applied. Total rules applied 27 place count 88 transition count 95
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 82 transition count 89
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 82 transition count 89
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 78 transition count 85
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 78 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 75 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 75 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 72 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 72 transition count 79
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 69 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 69 transition count 76
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 66 transition count 73
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 66 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 64 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 64 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 77 place count 64 transition count 69
Applied a total of 77 rules in 4 ms. Remains 64 /108 variables (removed 44) and now considering 69/102 (removed 33) transitions.
[2025-06-06 18:05:25] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
// Phase 1: matrix 62 rows 64 cols
[2025-06-06 18:05:25] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 18:05:25] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
[2025-06-06 18:05:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:25] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 18:05:25] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2025-06-06 18:05:25] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
[2025-06-06 18:05:25] [INFO ] Invariant cache hit.
[2025-06-06 18:05:25] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 62/126 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 121 constraints, problems are : Problem set: 0 solved, 65 unsolved in 867 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 64/64 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 62/126 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 65/186 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 186 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1070 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 64/64 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1951ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 1951ms
Starting structural reductions in LTL mode, iteration 1 : 64/108 places, 69/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2030 ms. Remains : 64/108 places, 69/102 transitions.
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p2))), (OR (NOT p2) (NOT p3)), (AND p0 p2 p1 (NOT p3)), (NOT p1), p0, (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-07
Product exploration explored 100000 steps with 1 reset in 140 ms.
Product exploration explored 100000 steps with 1 reset in 255 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 141 edges and 64 vertex of which 58 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (OR (AND (NOT p2) p0) (AND p0 (NOT p1) (NOT p3))))), (X (NOT p3)), (X (NOT (AND p2 p0 p1 p3))), (X (NOT (AND p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (OR (NOT p2) (AND (NOT p1) (NOT p3)))), (X (NOT (AND p2 p0 (NOT p1) p3))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1) p3))), (X (NOT (AND p2 p0 p1 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (OR (AND (NOT p2) p0) (AND p0 (NOT p1) (NOT p3)))))), (X (X (NOT p3))), (X (X (NOT (AND p2 p0 p1 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT p1))), (X (X (OR (NOT p2) (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND p2 p0 p1 (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 30 factoid took 390 ms. Reduced automaton from 9 states, 26 edges and 4 AP (stutter sensitive) to 9 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p2))), (OR (NOT p2) (NOT p3)), (AND p0 p2 (NOT p3) p1), (NOT p1), p0, (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 19 to 14
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
[2025-06-06 18:05:29] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
[2025-06-06 18:05:29] [INFO ] Invariant cache hit.
[2025-06-06 18:05:29] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
After SMT solving in domain Real declared 6/126 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/64 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (OR (AND (NOT p2) p0) (AND p0 (NOT p1) (NOT p3))))), (X (NOT p3)), (X (NOT (AND p2 p0 p1 p3))), (X (NOT (AND p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (OR (NOT p2) (AND (NOT p1) (NOT p3)))), (X (NOT (AND p2 p0 (NOT p1) p3))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1) p3))), (X (NOT (AND p2 p0 p1 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (OR (AND (NOT p2) p0) (AND p0 (NOT p1) (NOT p3)))))), (X (X (NOT p3))), (X (X (NOT (AND p2 p0 p1 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT p1))), (X (X (OR (NOT p2) (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND p2 p0 p1 (NOT p3))))), (X (X (NOT p0))), (G (OR (NOT p2) p3 (NOT p1) (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (OR (NOT p2) p1 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3) p1))), (F (NOT (AND (OR p2 (NOT p0)) (OR p3 p1 (NOT p0))))), (F (NOT (OR (NOT p2) (NOT p3) p1 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p2 p1 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F p2), (F p1), (F (NOT (OR (NOT p2) p1))), (F p3), (F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) (AND (NOT p3) (NOT p1))))), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 31 factoid took 1094 ms. Reduced automaton from 9 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 24 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND p0 (NOT p3)) (AND p0 (NOT p2))), (OR (NOT p2) (NOT p3)), false, (NOT p1), p0, (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND p0 (NOT p3)) (AND p0 (NOT p2))), (OR (NOT p2) (NOT p3)), false, (NOT p1), p0, (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
[2025-06-06 18:05:31] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
[2025-06-06 18:05:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p2)
[2025-06-06 18:05:31] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
[2025-06-06 18:05:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:05:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-06 18:05:31] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-06 18:05:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:05:31] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-06 18:05:31] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-06 18:05:31] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 18:05:31] [INFO ] [Nat]Added 53 Read/Feed constraints in 3 ms returned unsat
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (OR (AND (NOT p2) p0) (AND p0 (NOT p1) (NOT p3))))), (X (NOT p3)), (X (NOT (AND p2 p0 p1 p3))), (X (NOT (AND p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (OR (NOT p2) (AND (NOT p1) (NOT p3)))), (X (NOT (AND p2 p0 (NOT p1) p3))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1) p3))), (X (NOT (AND p2 p0 p1 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (OR (AND (NOT p2) p0) (AND p0 (NOT p1) (NOT p3)))))), (X (X (NOT p3))), (X (X (NOT (AND p2 p0 p1 p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT p1))), (X (X (OR (NOT p2) (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND p2 p0 p1 (NOT p3))))), (X (X (NOT p0))), (G (OR (NOT p2) p3 (NOT p1) (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (OR (NOT p2) p1 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3) p1))), (F (NOT (AND (OR p2 (NOT p0)) (OR p3 p1 (NOT p0))))), (F (NOT (OR (NOT p2) (NOT p3) p1 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p2 p1 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F p2), (F p1), (F (NOT (OR (NOT p2) p1))), (F p3), (F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) (AND (NOT p3) (NOT p1))))), (F (NOT (OR p2 (NOT p0)))), (G (NOT p2)), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 31 factoid took 1140 ms. Reduced automaton from 9 states, 24 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-07 finished in 6944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 271 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 16 places
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 77 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 77 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 26 place count 70 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 33 place count 70 transition count 83
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 37 place count 66 transition count 79
Iterating global reduction 0 with 4 rules applied. Total rules applied 41 place count 66 transition count 79
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 45 place count 62 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 49 place count 62 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 52 place count 59 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 55 place count 59 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 58 place count 56 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 61 place count 56 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 64 place count 53 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 67 place count 53 transition count 66
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 70 place count 50 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 73 place count 50 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 76 place count 50 transition count 60
Applied a total of 76 rules in 18 ms. Remains 50 /108 variables (removed 58) and now considering 60/102 (removed 42) transitions.
[2025-06-06 18:05:32] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
// Phase 1: matrix 53 rows 50 cols
[2025-06-06 18:05:32] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:32] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 18:05:32] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2025-06-06 18:05:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:32] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-06 18:05:32] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:05:32] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-06 18:05:32] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2025-06-06 18:05:32] [INFO ] Invariant cache hit.
[2025-06-06 18:05:32] [INFO ] State equation strengthened by 47 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, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 52/100 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 46/94 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 2/102 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 999 ms.
Refiners :[State Equation: 50/50 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 52/100 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 46/94 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 56/150 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 2/102 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1145 ms.
Refiners :[State Equation: 50/50 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2149ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2150ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/108 places, 60/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2252 ms. Remains : 50/108 places, 60/102 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-08
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-08 finished in 2298 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||((p1 U G(!p0)) U p2)))))'
Support contains 3 out of 108 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 : 108/108 places, 102/102 transitions.
Graph (complete) has 271 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 15 places
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 79 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 79 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 23 place count 73 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 73 transition count 85
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 69 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 69 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 41 place count 65 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 45 place count 65 transition count 77
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 49 place count 61 transition count 73
Iterating global reduction 0 with 4 rules applied. Total rules applied 53 place count 61 transition count 73
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 57 place count 57 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 61 place count 57 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 65 place count 53 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 69 place count 53 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 72 place count 50 transition count 62
Iterating global reduction 0 with 3 rules applied. Total rules applied 75 place count 50 transition count 62
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 78 place count 50 transition count 59
Applied a total of 78 rules in 13 ms. Remains 50 /108 variables (removed 58) and now considering 59/102 (removed 43) transitions.
[2025-06-06 18:05:34] [INFO ] Flow matrix only has 52 transitions (discarded 7 similar events)
// Phase 1: matrix 52 rows 50 cols
[2025-06-06 18:05:34] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-06 18:05:34] [INFO ] Flow matrix only has 52 transitions (discarded 7 similar events)
[2025-06-06 18:05:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:34] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-06 18:05:34] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:05:34] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-06 18:05:34] [INFO ] Flow matrix only has 52 transitions (discarded 7 similar events)
[2025-06-06 18:05:34] [INFO ] Invariant cache hit.
[2025-06-06 18:05:34] [INFO ] State equation strengthened by 46 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, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 51/99 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 45/94 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 1/102 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 97 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1132 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 51/99 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 45/94 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 55/149 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 2/101 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 1/102 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 152 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1072 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2212ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/108 places, 59/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2288 ms. Remains : 50/108 places, 59/102 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-09
Product exploration explored 100000 steps with 2 reset in 144 ms.
Product exploration explored 100000 steps with 1 reset in 210 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Detected a total of 6/50 stabilizing places and 8/59 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 17121 steps (5 resets) in 61 ms. (276 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p2), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 4 factoid took 343 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 50 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 : 50/50 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2025-06-06 18:05:38] [INFO ] Flow matrix only has 52 transitions (discarded 7 similar events)
[2025-06-06 18:05:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:38] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-06 18:05:38] [INFO ] Flow matrix only has 52 transitions (discarded 7 similar events)
[2025-06-06 18:05:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:38] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-06 18:05:38] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:05:38] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-06 18:05:38] [INFO ] Flow matrix only has 52 transitions (discarded 7 similar events)
[2025-06-06 18:05:38] [INFO ] Invariant cache hit.
[2025-06-06 18:05:38] [INFO ] State equation strengthened by 46 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, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 51/99 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 45/94 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 1/102 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 97 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1107 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 51/99 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 45/94 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 55/149 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 2/101 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 1/102 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 152 constraints, problems are : Problem set: 0 solved, 55 unsolved in 993 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2107ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2107ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2184 ms. Remains : 50/50 places, 59/59 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Detected a total of 6/50 stabilizing places and 8/59 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 274 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 7092 steps (2 resets) in 17 ms. (394 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p2), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 4 factoid took 418 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-09 finished in 6779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (!p1&&X(F(!p2)))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 94 transition count 102
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 22 place count 86 transition count 94
Iterating global reduction 1 with 8 rules applied. Total rules applied 30 place count 86 transition count 94
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 81 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 81 transition count 89
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 77 transition count 85
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 77 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 73 transition count 81
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 73 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 71 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 71 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 70 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 70 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 69 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 69 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 68 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 68 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 68 transition count 75
Applied a total of 67 rules in 5 ms. Remains 68 /108 variables (removed 40) and now considering 75/102 (removed 27) transitions.
[2025-06-06 18:05:41] [INFO ] Flow matrix only has 67 transitions (discarded 8 similar events)
// Phase 1: matrix 67 rows 68 cols
[2025-06-06 18:05:41] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-06 18:05:41] [INFO ] Flow matrix only has 67 transitions (discarded 8 similar events)
[2025-06-06 18:05:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-06 18:05:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2025-06-06 18:05:41] [INFO ] Flow matrix only has 67 transitions (discarded 8 similar events)
[2025-06-06 18:05:41] [INFO ] Invariant cache hit.
[2025-06-06 18:05:41] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 67/135 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 58/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 129 constraints, problems are : Problem set: 0 solved, 71 unsolved in 980 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 67/135 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 58/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 71/200 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 200 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1201 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2196ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2196ms
Starting structural reductions in LTL mode, iteration 1 : 68/108 places, 75/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2269 ms. Remains : 68/108 places, 75/102 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR p2 p1), true, p0, p2]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 147 edges and 68 vertex of which 62 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 14 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-10 finished in 2601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 271 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 15 places
Reduce places removed 16 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 79 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 79 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 20 place count 74 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 25 place count 74 transition count 86
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 29 place count 70 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 70 transition count 82
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 37 place count 66 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 41 place count 66 transition count 78
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 43 place count 64 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 45 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 46 place count 63 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 48 place count 62 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 50 place count 61 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 61 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 52 place count 61 transition count 72
Applied a total of 52 rules in 21 ms. Remains 61 /108 variables (removed 47) and now considering 72/102 (removed 30) transitions.
[2025-06-06 18:05:44] [INFO ] Flow matrix only has 63 transitions (discarded 9 similar events)
// Phase 1: matrix 63 rows 61 cols
[2025-06-06 18:05:44] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:44] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-06 18:05:44] [INFO ] Flow matrix only has 63 transitions (discarded 9 similar events)
[2025-06-06 18:05:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:44] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-06 18:05:44] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:05:44] [INFO ] Redundant transitions in 0 ms returned []
Running 58 sub problems to find dead transitions.
[2025-06-06 18:05:44] [INFO ] Flow matrix only has 63 transitions (discarded 9 similar events)
[2025-06-06 18:05:44] [INFO ] Invariant cache hit.
[2025-06-06 18:05:44] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 61/120 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 47/107 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 1/121 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/122 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/124 variables, and 109 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1616 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/61 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 61/120 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 47/107 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 48/155 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 1/121 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 1/122 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 1/123 variables, 10/167 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 1/124 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (OVERLAPS) 0/124 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 168 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1889 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3513ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3513ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/108 places, 72/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3625 ms. Remains : 61/108 places, 72/102 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-11
Stuttering criterion allowed to conclude after 91 steps with 1 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-11 finished in 3743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 271 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 15 places
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 78 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 78 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 26 place count 71 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 33 place count 71 transition count 83
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 38 place count 66 transition count 78
Iterating global reduction 0 with 5 rules applied. Total rules applied 43 place count 66 transition count 78
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 48 place count 61 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 53 place count 61 transition count 73
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 57 place count 57 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 61 place count 57 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 65 place count 53 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 69 place count 53 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 72 place count 50 transition count 62
Iterating global reduction 0 with 3 rules applied. Total rules applied 75 place count 50 transition count 62
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 78 place count 47 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 81 place count 47 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 84 place count 47 transition count 56
Applied a total of 84 rules in 19 ms. Remains 47 /108 variables (removed 61) and now considering 56/102 (removed 46) transitions.
[2025-06-06 18:05:47] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 47 cols
[2025-06-06 18:05:47] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:47] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-06 18:05:47] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2025-06-06 18:05:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 18:05:47] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:05:47] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-06 18:05:47] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2025-06-06 18:05:47] [INFO ] Invariant cache hit.
[2025-06-06 18:05:47] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 48/93 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 42/88 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 2/95 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 1/96 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 91 constraints, problems are : Problem set: 0 solved, 52 unsolved in 984 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 48/93 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 42/88 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 52/140 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 2/95 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 1/96 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 143 constraints, problems are : Problem set: 0 solved, 52 unsolved in 969 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1961ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1962ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/108 places, 56/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2049 ms. Remains : 47/108 places, 56/102 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 209 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36738 steps (8 resets) in 62 ms. (583 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 99 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-06 18:05:50] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2025-06-06 18:05:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:50] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 18:05:50] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2025-06-06 18:05:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:05:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 18:05:50] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:05:50] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-06 18:05:50] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2025-06-06 18:05:50] [INFO ] Invariant cache hit.
[2025-06-06 18:05:50] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 48/93 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 42/88 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 2/95 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 1/96 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 91 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1001 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 48/93 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 42/88 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 52/140 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 2/95 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 1/96 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 143 constraints, problems are : Problem set: 0 solved, 52 unsolved in 973 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1989ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1990ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2064 ms. Remains : 47/47 places, 56/56 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23345 steps (5 resets) in 51 ms. (448 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 96 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 234 ms.
Built C files in :
/tmp/ltsmin8140066870067583107
[2025-06-06 18:05:53] [INFO ] Computing symmetric may disable matrix : 56 transitions.
[2025-06-06 18:05:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:05:53] [INFO ] Computing symmetric may enable matrix : 56 transitions.
[2025-06-06 18:05:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:05:53] [INFO ] Computing Do-Not-Accords matrix : 56 transitions.
[2025-06-06 18:05:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:05:53] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8140066870067583107
Running compilation step : cd /tmp/ltsmin8140066870067583107;'/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 132 ms.
Running link step : cd /tmp/ltsmin8140066870067583107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8140066870067583107;'/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/stateBased5192910211244421095.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 56/56 transitions.
Applied a total of 0 rules in 12 ms. Remains 47 /47 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-06 18:06:08] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2025-06-06 18:06:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:06:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 18:06:08] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2025-06-06 18:06:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:06:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 18:06:08] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:06:08] [INFO ] Redundant transitions in 0 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-06 18:06:08] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2025-06-06 18:06:08] [INFO ] Invariant cache hit.
[2025-06-06 18:06:08] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 48/93 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 42/88 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 2/95 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 1/96 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 91 constraints, problems are : Problem set: 0 solved, 52 unsolved in 996 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 48/93 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 42/88 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 52/140 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 2/95 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 1/96 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 143 constraints, problems are : Problem set: 0 solved, 52 unsolved in 950 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1950ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1950ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2039 ms. Remains : 47/47 places, 56/56 transitions.
Built C files in :
/tmp/ltsmin6953500566232655540
[2025-06-06 18:06:10] [INFO ] Computing symmetric may disable matrix : 56 transitions.
[2025-06-06 18:06:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:06:10] [INFO ] Computing symmetric may enable matrix : 56 transitions.
[2025-06-06 18:06:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:06:10] [INFO ] Computing Do-Not-Accords matrix : 56 transitions.
[2025-06-06 18:06:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:06:10] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6953500566232655540
Running compilation step : cd /tmp/ltsmin6953500566232655540;'/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 132 ms.
Running link step : cd /tmp/ltsmin6953500566232655540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6953500566232655540;'/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/stateBased3534660733938585901.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 18:06:25] [INFO ] Flatten gal took : 5 ms
[2025-06-06 18:06:25] [INFO ] Flatten gal took : 2 ms
[2025-06-06 18:06:25] [INFO ] Time to serialize gal into /tmp/LTL8566898932133409094.gal : 1 ms
[2025-06-06 18:06:25] [INFO ] Time to serialize properties into /tmp/LTL9217983906440538013.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8566898932133409094.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2162546962774409564.hoa' '-atoms' '/tmp/LTL9217983906440538013.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9217983906440538013.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2162546962774409564.hoa
Detected timeout of ITS tools.
[2025-06-06 18:06:41] [INFO ] Flatten gal took : 2 ms
[2025-06-06 18:06:41] [INFO ] Flatten gal took : 2 ms
[2025-06-06 18:06:41] [INFO ] Time to serialize gal into /tmp/LTL1681169201758261584.gal : 1 ms
[2025-06-06 18:06:41] [INFO ] Time to serialize properties into /tmp/LTL16004584783635999121.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1681169201758261584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16004584783635999121.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p81<1)||(p24<1))||(p114<1))"))))
Formula 0 simplified : FG!"(((p81<1)||(p24<1))||(p114<1))"
Detected timeout of ITS tools.
[2025-06-06 18:06:56] [INFO ] Flatten gal took : 4 ms
[2025-06-06 18:06:56] [INFO ] Applying decomposition
[2025-06-06 18:06:56] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4480639701289034643.txt' '-o' '/tmp/graph4480639701289034643.bin' '-w' '/tmp/graph4480639701289034643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4480639701289034643.bin' '-l' '-1' '-v' '-w' '/tmp/graph4480639701289034643.weights' '-q' '0' '-e' '0.001'
[2025-06-06 18:06:56] [INFO ] Decomposing Gal with order
[2025-06-06 18:06:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 18:06:56] [INFO ] Removed a total of 10 redundant transitions.
[2025-06-06 18:06:56] [INFO ] Flatten gal took : 4 ms
[2025-06-06 18:06:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 1 ms.
[2025-06-06 18:06:56] [INFO ] Time to serialize gal into /tmp/LTL17982876848069957855.gal : 1 ms
[2025-06-06 18:06:56] [INFO ] Time to serialize properties into /tmp/LTL11570570251144961428.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17982876848069957855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11570570251144961428.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i2.u6.p81<1)||(i2.u13.p24<1))||(i2.u13.p114<1))"))))
Formula 0 simplified : FG!"(((i2.u6.p81<1)||(i2.u13.p24<1))||(i2.u13.p114<1))"
Detected timeout of ITS tools.
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-12 finished in 83238 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((X(p0)&&((!p0 U (p1||G(!p0))) U p2)))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Ensure Unique test removed 15 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 93 transition count 102
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 22 place count 86 transition count 95
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 86 transition count 95
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 81 transition count 90
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 81 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 78 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 78 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 75 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 75 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 73 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 73 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 71 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 71 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 69 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 69 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 68 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 68 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 68 transition count 76
Applied a total of 66 rules in 6 ms. Remains 68 /108 variables (removed 40) and now considering 76/102 (removed 26) transitions.
[2025-06-06 18:07:11] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 68 cols
[2025-06-06 18:07:11] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:07:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 18:07:11] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2025-06-06 18:07:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:07:11] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-06 18:07:11] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-06-06 18:07:11] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2025-06-06 18:07:11] [INFO ] Invariant cache hit.
[2025-06-06 18:07:11] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 68/136 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 129 constraints, problems are : Problem set: 0 solved, 72 unsolved in 962 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 68/136 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 72/201 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 201 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1230 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2195ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2199ms
Starting structural reductions in LTL mode, iteration 1 : 68/108 places, 76/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2289 ms. Remains : 68/108 places, 76/102 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) p0), (NOT p2), false]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-13
Product exploration explored 100000 steps with 1 reset in 136 ms.
Product exploration explored 100000 steps with 0 reset in 213 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 144 edges and 68 vertex of which 62 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (OR p2 p1 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR p2 p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 269 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND p0 (NOT p2) (NOT p1)), (NOT p2), false]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 36821 steps (8 resets) in 104 ms. (350 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (OR p2 p1 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR p2 p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 580 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND p0 (NOT p2) (NOT p1)), (NOT p2), false]
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND p0 (NOT p2) (NOT p1)), (NOT p2), false]
[2025-06-06 18:07:15] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2025-06-06 18:07:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:07:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-06 18:07:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-06 18:07:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:07:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-06 18:07:15] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-06 18:07:15] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-06 18:07:15] [INFO ] [Nat]Added 59 Read/Feed constraints in 4 ms returned unsat
Proved EG (NOT p2)
[2025-06-06 18:07:15] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2025-06-06 18:07:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:07:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-06 18:07:15] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-06 18:07:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:07:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-06 18:07:15] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-06 18:07:15] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-06 18:07:15] [INFO ] [Nat]Added 59 Read/Feed constraints in 4 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (OR p2 p1 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR p2 p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F p0), (F (NOT p1)), (G (NOT p2)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 17 factoid took 583 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-13 finished in 5397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 271 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 15 places
Reduce places removed 16 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 78 transition count 90
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 78 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 23 place count 72 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 72 transition count 84
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 68 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 68 transition count 80
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 41 place count 64 transition count 76
Iterating global reduction 0 with 4 rules applied. Total rules applied 45 place count 64 transition count 76
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 49 place count 60 transition count 72
Iterating global reduction 0 with 4 rules applied. Total rules applied 53 place count 60 transition count 72
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 57 place count 56 transition count 68
Iterating global reduction 0 with 4 rules applied. Total rules applied 61 place count 56 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 65 place count 52 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 69 place count 52 transition count 64
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 72 place count 49 transition count 61
Iterating global reduction 0 with 3 rules applied. Total rules applied 75 place count 49 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 78 place count 49 transition count 58
Applied a total of 78 rules in 15 ms. Remains 49 /108 variables (removed 59) and now considering 58/102 (removed 44) transitions.
[2025-06-06 18:07:16] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 49 cols
[2025-06-06 18:07:16] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:07:16] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-06 18:07:16] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2025-06-06 18:07:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:07:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-06 18:07:16] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:07:16] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2025-06-06 18:07:16] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2025-06-06 18:07:16] [INFO ] Invariant cache hit.
[2025-06-06 18:07:16] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 49/96 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 37/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/97 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/98 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/100 variables, and 87 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1026 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/49 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 49/96 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 37/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 38/123 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/97 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/98 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 1/99 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 1/100 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/100 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 14 (OVERLAPS) 0/100 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 134 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1284 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2313ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2313ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/108 places, 58/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2389 ms. Remains : 49/108 places, 58/102 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-14
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-14 finished in 2425 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(p1) U p2)&&G(!p1))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 271 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 15 places
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 78 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 78 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 26 place count 71 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 33 place count 71 transition count 83
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 38 place count 66 transition count 78
Iterating global reduction 0 with 5 rules applied. Total rules applied 43 place count 66 transition count 78
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 48 place count 61 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 53 place count 61 transition count 73
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 56 place count 58 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 59 place count 58 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 62 place count 55 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 55 transition count 67
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 68 place count 52 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 71 place count 52 transition count 64
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 73 place count 50 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 75 place count 50 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 77 place count 50 transition count 60
Applied a total of 77 rules in 9 ms. Remains 50 /108 variables (removed 58) and now considering 60/102 (removed 42) transitions.
[2025-06-06 18:07:18] [INFO ] Flow matrix only has 52 transitions (discarded 8 similar events)
// Phase 1: matrix 52 rows 50 cols
[2025-06-06 18:07:18] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:07:18] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-06 18:07:18] [INFO ] Flow matrix only has 52 transitions (discarded 8 similar events)
[2025-06-06 18:07:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:07:19] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-06 18:07:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:07:19] [INFO ] Redundant transitions in 0 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-06 18:07:19] [INFO ] Flow matrix only has 52 transitions (discarded 8 similar events)
[2025-06-06 18:07:19] [INFO ] Invariant cache hit.
[2025-06-06 18:07:19] [INFO ] State equation strengthened by 46 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, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 51/99 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 45/94 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 1/102 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1163 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 51/99 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 45/94 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 56/150 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 2/101 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 1/102 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1124 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2290ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2290ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/108 places, 60/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2365 ms. Remains : 50/108 places, 60/102 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-15
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-15 finished in 2492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(p0)||G(X(!p0))))||G(p1))))'
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)))'
[2025-06-06 18:07:21] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
[2025-06-06 18:07:21] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin9914790160778751751
[2025-06-06 18:07:21] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2025-06-06 18:07:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:07:21] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2025-06-06 18:07:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:07:21] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2025-06-06 18:07:21] [INFO ] Flatten gal took : 8 ms
[2025-06-06 18:07:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:07:21] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9914790160778751751
Running compilation step : cd /tmp/ltsmin9914790160778751751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13590731253431973359.txt' '-o' '/tmp/graph13590731253431973359.bin' '-w' '/tmp/graph13590731253431973359.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13590731253431973359.bin' '-l' '-1' '-v' '-w' '/tmp/graph13590731253431973359.weights' '-q' '0' '-e' '0.001'
[2025-06-06 18:07:21] [INFO ] Decomposing Gal with order
[2025-06-06 18:07:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 18:07:21] [INFO ] Removed a total of 18 redundant transitions.
[2025-06-06 18:07:21] [INFO ] Flatten gal took : 6 ms
[2025-06-06 18:07:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 1 ms.
[2025-06-06 18:07:21] [INFO ] Time to serialize gal into /tmp/LTLFireability14153535930661160841.gal : 2 ms
[2025-06-06 18:07:21] [INFO ] Time to serialize properties into /tmp/LTLFireability8170404251385129600.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14153535930661160841.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8170404251385129600.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X((X((X("((i5.u11.p42<1)||(i5.u11.p105<1))"))||(G(X("((i5.u11.p42>=1)&&(i5.u11.p105>=1))")))))||(G("(i8.i0.u29.p74>=1)")))))
Formula 0 simplified : X(F!"(i8.i0.u29.p74>=1)" & XX(!"((i5.u11.p42<1)||(i5.u11.p105<1))" & F!"((i5.u11.p42>=1)&&(i5.u11.p105>=1))"))
Compilation finished in 186 ms.
Running link step : cd /tmp/ltsmin9914790160778751751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9914790160778751751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((X((LTLAPp0==true))||[](X(!(LTLAPp0==true)))))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: LTL layer: formula: X((X((X((LTLAPp0==true))||[](X(!(LTLAPp0==true)))))||[]((LTLAPp1==true))))
pins2lts-mc-linux64( 7/ 8), 0.004: "X((X((X((LTLAPp0==true))||[](X(!(LTLAPp0==true)))))||[]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.082: DFS-FIFO for weak LTL, using special progress label 106
pins2lts-mc-linux64( 0/ 8), 0.082: There are 107 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.082: State length is 109, there are 120 groups
pins2lts-mc-linux64( 0/ 8), 0.082: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.082: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.082: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.082: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.530: ~1 levels ~960 states ~2712 transitions
pins2lts-mc-linux64( 6/ 8), 2.222: ~1 levels ~1920 states ~31432 transitions
pins2lts-mc-linux64( 6/ 8), 3.139: ~1 levels ~3840 states ~64680 transitions
pins2lts-mc-linux64( 0/ 8), 3.435: ~1 levels ~7680 states ~115632 transitions
pins2lts-mc-linux64( 7/ 8), 3.655: ~1 levels ~15360 states ~239304 transitions
pins2lts-mc-linux64( 0/ 8), 4.081: ~1 levels ~30720 states ~502120 transitions
pins2lts-mc-linux64( 6/ 8), 4.762: ~1 levels ~61440 states ~1067992 transitions
pins2lts-mc-linux64( 3/ 8), 5.593: ~1 levels ~122880 states ~1954840 transitions
pins2lts-mc-linux64( 4/ 8), 6.667: ~1 levels ~245760 states ~4359896 transitions
pins2lts-mc-linux64( 1/ 8), 8.437: ~1 levels ~491520 states ~8570424 transitions
pins2lts-mc-linux64( 1/ 8), 11.858: ~1 levels ~983040 states ~17622760 transitions
pins2lts-mc-linux64( 3/ 8), 18.636: ~1 levels ~1966080 states ~33792680 transitions
pins2lts-mc-linux64( 3/ 8), 33.418: ~1 levels ~3932160 states ~69837344 transitions
pins2lts-mc-linux64( 6/ 8), 62.814: ~1 levels ~7864320 states ~142458480 transitions
pins2lts-mc-linux64( 6/ 8), 126.748: ~1 levels ~15728640 states ~292569544 transitions
pins2lts-mc-linux64( 3/ 8), 249.452: ~1 levels ~31457280 states ~576491712 transitions
pins2lts-mc-linux64( 0/ 8), 286.814: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 286.874:
pins2lts-mc-linux64( 0/ 8), 286.874: mean standard work distribution: 1.3% (states) 0.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 286.874:
pins2lts-mc-linux64( 0/ 8), 286.874: Explored 33218211 states 634003804 transitions, fanout: 19.086
pins2lts-mc-linux64( 0/ 8), 286.874: Total exploration time 286.750 sec (286.710 sec minimum, 286.724 sec on average)
pins2lts-mc-linux64( 0/ 8), 286.874: States per second: 115844, Transitions per second: 2210998
pins2lts-mc-linux64( 0/ 8), 286.874:
pins2lts-mc-linux64( 0/ 8), 286.874: Progress states detected: 134217221
pins2lts-mc-linux64( 0/ 8), 286.874: Redundant explorations: -75.2504
pins2lts-mc-linux64( 0/ 8), 286.874:
pins2lts-mc-linux64( 0/ 8), 286.874: Queue width: 8B, total height: 153589119, memory: 1171.79MB
pins2lts-mc-linux64( 0/ 8), 286.874: Tree memory: 1135.0MB, 8.9 B/state, compr.: 2.0%
pins2lts-mc-linux64( 0/ 8), 286.874: Tree fill ratio (roots/leafs): 99.0%/43.0%
pins2lts-mc-linux64( 0/ 8), 286.874: Stored 103 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 286.874: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 286.874: Est. total memory use: 2306.8MB (~2195.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9914790160778751751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((X((LTLAPp0==true))||[](X(!(LTLAPp0==true)))))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9914790160778751751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((X((LTLAPp0==true))||[](X(!(LTLAPp0==true)))))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-06 18:28:37] [INFO ] Flatten gal took : 3 ms
[2025-06-06 18:28:37] [INFO ] Time to serialize gal into /tmp/LTLFireability6057524171382630906.gal : 1 ms
[2025-06-06 18:28:37] [INFO ] Time to serialize properties into /tmp/LTLFireability2930134024469026766.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6057524171382630906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2930134024469026766.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((X((X((X("((p42<1)||(p105<1))"))||(G(X("((p42>=1)&&(p105>=1))")))))||(G("(p74>=1)")))))
Formula 0 simplified : X(F!"(p74>=1)" & XX(!"((p42<1)||(p105<1))" & F!"((p42>=1)&&(p105>=1))"))
Detected timeout of ITS tools.
[2025-06-06 18:49:53] [INFO ] Flatten gal took : 8 ms
[2025-06-06 18:49:53] [INFO ] Input system was already deterministic with 102 transitions.
[2025-06-06 18:49:53] [INFO ] Transformed 108 places.
[2025-06-06 18:49:53] [INFO ] Transformed 102 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-06 18:49:53] [INFO ] Time to serialize gal into /tmp/LTLFireability16678226691342242871.gal : 1 ms
[2025-06-06 18:49:53] [INFO ] Time to serialize properties into /tmp/LTLFireability12280631968399141075.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16678226691342242871.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12280631968399141075.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((X((X("((p42<1)||(p105<1))"))||(G(X("((p42>=1)&&(p105>=1))")))))||(G("(p74>=1)")))))
Formula 0 simplified : X(F!"(p74>=1)" & XX(!"((p42<1)||(p105<1))" & F!"((p42>=1)&&(p105>=1))"))
BK_TIME_CONFINEMENT_REACHED
--------------------
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="SemanticWebServices-PT-S064P18"
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 SemanticWebServices-PT-S064P18, 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 r184-tall-174889265000876"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S064P18.tgz
mv SemanticWebServices-PT-S064P18 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 ;