About the Execution of ITS-Tools for DatabaseWithMutex-COL-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 207222.00 | 0.00 | 0.00 | TTFFFFFTFFTFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854029100796.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 DatabaseWithMutex-COL-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854029100796
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K 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 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 21K 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 DatabaseWithMutex-COL-04-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-COL-04-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748657627730
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-05-31 02:13:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 02:13:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 02:13:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-05-31 02:13:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-31 02:13:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 544 ms
[2025-05-31 02:13:49] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 140 PT places and 128.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2025-05-31 02:13:49] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 5 ms.
[2025-05-31 02:13:49] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 5 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 182 steps (0 resets) in 11 ms. (15 steps per ms) remains 0/5 properties
[2025-05-31 02:13:49] [INFO ] Flatten gal took : 14 ms
[2025-05-31 02:13:49] [INFO ] Flatten gal took : 3 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2025-05-31 02:13:49] [INFO ] Unfolded HLPN to a Petri net with 140 places and 128 transitions 416 arcs in 15 ms.
[2025-05-31 02:13:49] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
[2025-05-31 02:13:49] [INFO ] Reduced 12 identical enabling conditions.
[2025-05-31 02:13:49] [INFO ] Reduced 12 identical enabling conditions.
[2025-05-31 02:13:49] [INFO ] Reduced 12 identical enabling conditions.
[2025-05-31 02:13:49] [INFO ] Reduced 12 identical enabling conditions.
[2025-05-31 02:13:49] [INFO ] Reduced 12 identical enabling conditions.
[2025-05-31 02:13:49] [INFO ] Reduced 12 identical enabling conditions.
[2025-05-31 02:13:49] [INFO ] Reduced 12 identical enabling conditions.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 140 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2025-05-31 02:13:50] [INFO ] Computed 28 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:13:50] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-05-31 02:13:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:13:50] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-05-31 02:13:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4640 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5488 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10176ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 10188ms
Finished structural reductions in LTL mode , in 1 iterations and 10539 ms. Remains : 140/140 places, 128/128 transitions.
Support contains 140 out of 140 places after structural reductions.
[2025-05-31 02:14:00] [INFO ] Flatten gal took : 17 ms
[2025-05-31 02:14:00] [INFO ] Flatten gal took : 18 ms
[2025-05-31 02:14:01] [INFO ] Input system was already deterministic with 128 transitions.
Reduction of identical properties reduced properties to check from 16 to 9
RANDOM walk for 157 steps (0 resets) in 13 ms. (11 steps per ms) remains 0/9 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U ((p2 U p3)&&X(!p4))))'
Support contains 56 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-05-31 02:14:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:14:01] [INFO ] Implicit Places using invariants in 88 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 91 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 493 ms :[(OR (NOT p3) p4), true, p4, (NOT p1), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p1) p2 p4) (AND (NOT p1) p3 p4)), p4]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 405 ms.
Product exploration explored 100000 steps with 50000 reset in 363 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p0 (NOT p1) (NOT p4)), (X (NOT p2)), (X p3), (X (NOT p4)), (X (NOT (AND (NOT p3) p2 p0 p4))), (X (NOT (OR (AND p3 (NOT p0) p4) (AND p2 (NOT p0) p4)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1) p4))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (OR (AND p3 (NOT p1) p4) (AND p2 (NOT p1) p4) (AND (NOT p0) (NOT p1) p4)))), (X (NOT (OR (AND p3 p0 (NOT p1) p4) (AND p2 p0 (NOT p1) p4)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) p2 (NOT p0) p4))), (X (OR (AND p3 p0 (NOT p1)) (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) p0 p4))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (OR (AND p3 p0) (AND p2 p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p4))), (X (NOT (OR (AND p3 p0 p4) (AND p2 p0 p4)))), (X p0), (X (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (AND (NOT p3) p2 p0 p4)))), (X (X (NOT (OR (AND p3 (NOT p0) p4) (AND p2 (NOT p0) p4))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1) p4)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p1) p4) (AND p2 (NOT p1) p4) (AND (NOT p0) (NOT p1) p4))))), (X (X (NOT (OR (AND p3 p0 (NOT p1) p4) (AND p2 p0 (NOT p1) p4))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p4)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p4)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (OR (AND p3 p0) (AND p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p4)))), (X (X (NOT (OR (AND p3 p0 p4) (AND p2 p0 p4))))), (X (X p0)), (X (X (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0))))))]
False Knowledge obtained : [(X (X (OR (AND p3 p0 (NOT p1)) (AND p2 p0 (NOT p1))))), (X (X (NOT (OR (AND p3 p0 (NOT p1)) (AND p2 p0 (NOT p1)))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 47 factoid took 135 ms. Reduced automaton from 8 states, 27 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-00 finished in 1586 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)))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-05-31 02:14:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:14:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-31 02:14:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:14:03] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-05-31 02:14:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4182 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5417 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9629ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 9631ms
Finished structural reductions in LTL mode , in 1 iterations and 9795 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) p1), p1, (NOT p0), true]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-01
Product exploration explored 100000 steps with 5294 reset in 366 ms.
Product exploration explored 100000 steps with 5355 reset in 204 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 137 steps (0 resets) in 22 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 90 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2025-05-31 02:14:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 02:14:14] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2025-05-31 02:14:14] [INFO ] [Real]Absence check using 11 positive and 17 generalized place invariants in 32 ms returned sat
[2025-05-31 02:14:14] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2025-05-31 02:14:14] [INFO ] Computed and/alt/rep : 112/192/112 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-31 02:14:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 02:14:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-05-31 02:14:14] [INFO ] [Nat]Absence check using 11 positive and 17 generalized place invariants in 19 ms returned sat
[2025-05-31 02:14:14] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2025-05-31 02:14:14] [INFO ] Computed and/alt/rep : 112/192/112 causal constraints (skipped 0 transitions) in 8 ms.
[2025-05-31 02:14:15] [INFO ] Added : 54 causal constraints over 11 iterations in 160 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 32 out of 140 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 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 10 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-05-31 02:14:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:14:15] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-05-31 02:14:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:14:15] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:14:15] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
[2025-05-31 02:14:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4163 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5211 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9389ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 9390ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9544 ms. Remains : 140/140 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 145 steps (0 resets) in 8 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
[2025-05-31 02:14:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 02:14:25] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2025-05-31 02:14:25] [INFO ] [Real]Absence check using 11 positive and 17 generalized place invariants in 34 ms returned sat
[2025-05-31 02:14:25] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2025-05-31 02:14:25] [INFO ] Computed and/alt/rep : 112/192/112 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-31 02:14:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 02:14:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-31 02:14:25] [INFO ] [Nat]Absence check using 11 positive and 17 generalized place invariants in 20 ms returned sat
[2025-05-31 02:14:25] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2025-05-31 02:14:25] [INFO ] Computed and/alt/rep : 112/192/112 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 02:14:25] [INFO ] Added : 54 causal constraints over 11 iterations in 160 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2804 reset in 268 ms.
Product exploration explored 100000 steps with 2819 reset in 244 ms.
Built C files in :
/tmp/ltsmin5084192278880415104
[2025-05-31 02:14:26] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2025-05-31 02:14:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 02:14:26] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2025-05-31 02:14:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 02:14:26] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2025-05-31 02:14:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 02:14:26] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5084192278880415104
Running compilation step : cd /tmp/ltsmin5084192278880415104;'/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 398 ms.
Running link step : cd /tmp/ltsmin5084192278880415104;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5084192278880415104;'/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/stateBased1545726877543208948.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 36 rules applied. Total rules applied 52 place count 120 transition count 96
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 68 place count 104 transition count 96
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 68 place count 104 transition count 80
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Applied a total of 100 rules in 26 ms. Remains 88 /140 variables (removed 52) and now considering 80/128 (removed 48) transitions.
// Phase 1: matrix 80 rows 88 cols
[2025-05-31 02:14:41] [INFO ] Computed 24 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:14:41] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-05-31 02:14:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:14:41] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:14:41] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2025-05-31 02:14:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 4/88 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 80/168 variables, 88/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 112 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1646 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 88/88 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/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 4/88 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 80/168 variables, 88/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 64/176 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 176 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2455 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4123ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 4123ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/140 places, 80/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4288 ms. Remains : 88/140 places, 80/128 transitions.
Built C files in :
/tmp/ltsmin13035088110188739713
[2025-05-31 02:14:46] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2025-05-31 02:14:46] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 02:14:46] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2025-05-31 02:14:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 02:14:46] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2025-05-31 02:14:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 02:14:46] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13035088110188739713
Running compilation step : cd /tmp/ltsmin13035088110188739713;'/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 187 ms.
Running link step : cd /tmp/ltsmin13035088110188739713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13035088110188739713;'/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/stateBased7060426206020007426.hoa' '--buchi-type=spotba'
LTSmin run took 3633 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-01 finished in 46851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||F((G(!p1)||G(p2))))))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2025-05-31 02:14:49] [INFO ] Computed 28 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:14:50] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-31 02:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:14:50] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-05-31 02:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4173 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5332 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9515ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 9515ms
Finished structural reductions in LTL mode , in 1 iterations and 9686 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 231 ms.
Stack based approach found an accepted trace after 2175 steps with 0 reset with depth 2176 and stack size 2176 in 6 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-02 finished in 10070 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&&(X(F(!p0))||p1)))))'
Support contains 24 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 52 rules applied. Total rules applied 68 place count 120 transition count 80
Reduce places removed 32 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 48 rules applied. Total rules applied 116 place count 88 transition count 64
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 132 place count 72 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 132 place count 72 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 164 place count 56 transition count 48
Applied a total of 164 rules in 13 ms. Remains 56 /140 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 56 cols
[2025-05-31 02:15:00] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:15:00] [INFO ] Implicit Places using invariants in 65 ms returned [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]
[2025-05-31 02:15:00] [INFO ] Actually due to overlaps returned [24, 25, 26, 27, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 70 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/140 places, 48/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 48/140 places, 48/128 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 282 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-05 finished in 452 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 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 36 rules applied. Total rules applied 52 place count 120 transition count 96
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 68 place count 104 transition count 96
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 68 place count 104 transition count 80
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Applied a total of 100 rules in 11 ms. Remains 88 /140 variables (removed 52) and now considering 80/128 (removed 48) transitions.
// Phase 1: matrix 80 rows 88 cols
[2025-05-31 02:15:00] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:15:00] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-31 02:15:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:15:00] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:15:00] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2025-05-31 02:15:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 4/88 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 80/168 variables, 88/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 112 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1582 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 88/88 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/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 4/88 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 80/168 variables, 88/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 64/176 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 176 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2499 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4089ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 4089ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/140 places, 80/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4192 ms. Remains : 88/140 places, 80/128 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 227 ms.
Stack based approach found an accepted trace after 243 steps with 0 reset with depth 244 and stack size 244 in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-08 finished in 4566 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(p1))||p0) U !p2)&&F(G((X(p4)||p3)))))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2025-05-31 02:15:05] [INFO ] Computed 28 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:15:05] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-31 02:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:15:05] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-05-31 02:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4091 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5469 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9568ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 9569ms
Finished structural reductions in LTL mode , in 1 iterations and 9730 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR p2 (AND (NOT p3) (NOT p4))), (NOT p1), (NOT p1), p2, (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-09
Product exploration explored 100000 steps with 1898 reset in 164 ms.
Stack based approach found an accepted trace after 10064 steps with 199 reset with depth 98 and stack size 98 in 18 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-09 finished in 10239 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((X(X(X(p0)))&&F(!p1)))||(((X(X(X(p0)))&&F(!p1))||X(X(X(G(p0)))))&&p2))))'
Support contains 36 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 9 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-05-31 02:15:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:15:15] [INFO ] Implicit Places using invariants in 77 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 78 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 1461 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-10
Product exploration explored 100000 steps with 25000 reset in 539 ms.
Product exploration explored 100000 steps with 25000 reset in 544 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 211 ms. Reduced automaton from 29 states, 98 edges and 3 AP (stutter sensitive) to 29 states, 97 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1485 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1))]
Reduction of identical properties reduced properties to check from 13 to 6
RANDOM walk for 40000 steps (8 resets) in 743 ms. (53 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 351 ms. (113 steps per ms) remains 2/2 properties
// Phase 1: matrix 128 rows 124 cols
[2025-05-31 02:15:20] [INFO ] Computed 12 invariants in 2 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 36/252 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/124 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p2) (NOT p1))), (G (OR p0 (NOT p2))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) p2))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2))), (F p1), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 27 factoid took 532 ms. Reduced automaton from 29 states, 97 edges and 3 AP (stutter sensitive) to 25 states, 49 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1143 ms :[(NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 1116 ms :[(NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 36 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-05-31 02:15:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:15:22] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-31 02:15:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:15:23] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-05-31 02:15:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:24] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:24] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:24] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:24] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 4/124 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:25] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:25] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:25] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:26] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:26] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:26] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 160 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5622 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 112/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 272 constraints, problems are : Problem set: 0 solved, 112 unsolved in 16045 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21684ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 21685ms
Finished structural reductions in LTL mode , in 1 iterations and 21865 ms. Remains : 124/124 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X p2), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 153 ms. Reduced automaton from 25 states, 49 edges and 2 AP (stutter sensitive) to 25 states, 49 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1214 ms :[(NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
RANDOM walk for 75 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X p2), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 9 factoid took 318 ms. Reduced automaton from 25 states, 49 edges and 2 AP (stutter sensitive) to 25 states, 49 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1199 ms :[(NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 1179 ms :[(NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 1197 ms :[(NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 25000 reset in 254 ms.
Product exploration explored 100000 steps with 25000 reset in 261 ms.
Applying partial POR strategy [false, true, false, true, true, false, true, false, false, true, true, false, true, false, true, false, true, false, false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 1293 ms :[(NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 36 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 124 transition count 128
Deduced a syphon composed of 16 places in 1 ms
Applied a total of 16 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:15:52] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 124 cols
[2025-05-31 02:15:52] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:52] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:52] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:52] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:52] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:52] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:52] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:52] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:52] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/15 constraints. Problems are: Problem set: 12 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:52] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:53] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:53] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:53] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:53] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/20 constraints. Problems are: Problem set: 12 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:53] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:53] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:53] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 3/23 constraints. Problems are: Problem set: 12 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/23 constraints. Problems are: Problem set: 12 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 4/124 variables, 3/26 constraints. Problems are: Problem set: 12 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 2/28 constraints. Problems are: Problem set: 12 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:54] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:54] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:54] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:54] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:54] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:54] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 7/35 constraints. Problems are: Problem set: 16 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:15:55] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/160 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/252 variables, 0/160 constraints. Problems are: Problem set: 16 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 160 constraints, problems are : Problem set: 16 solved, 96 unsolved in 5669 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 24/28 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/28 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 20/124 variables, 6/34 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/36 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 96/256 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/256 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/256 constraints. Problems are: Problem set: 16 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 256 constraints, problems are : Problem set: 16 solved, 96 unsolved in 12154 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/112 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17840ms problems are : Problem set: 16 solved, 96 unsolved
Search for dead transitions found 16 dead transitions in 17842ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 112/128 transitions.
Graph (complete) has 240 edges and 124 vertex of which 108 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 108 /124 variables (removed 16) and now considering 112/112 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/124 places, 112/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17866 ms. Remains : 108/124 places, 112/128 transitions.
Built C files in :
/tmp/ltsmin9376461337927634079
[2025-05-31 02:16:10] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9376461337927634079
Running compilation step : cd /tmp/ltsmin9376461337927634079;'/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 246 ms.
Running link step : cd /tmp/ltsmin9376461337927634079;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9376461337927634079;'/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/stateBased9870976999930400045.hoa' '--buchi-type=spotba'
LTSmin run took 77 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-10 finished in 55150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(((X(!p3)||p2)&&p1)))))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2025-05-31 02:16:10] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:16:10] [INFO ] Implicit Places using invariants in 70 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 71 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-12
Product exploration explored 100000 steps with 8061 reset in 431 ms.
Product exploration explored 100000 steps with 8069 reset in 438 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 109 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (8 resets) in 248 ms. (160 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
// Phase 1: matrix 128 rows 124 cols
[2025-05-31 02:16:12] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 52/252 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/124 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (OR p0 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F p3), (F (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F p2), (F (NOT (OR p0 p1))), (F (NOT (AND (OR p0 p1) (OR p0 (NOT p3))))), (F p0), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 352 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3))]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3))]
Support contains 52 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-05-31 02:16:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:16:12] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-05-31 02:16:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:16:12] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-05-31 02:16:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:13] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:14] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 4/124 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:15] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:15] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:15] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:15] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:15] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:16] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 160 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5704 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 112/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 272 constraints, problems are : Problem set: 0 solved, 112 unsolved in 15820 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21535ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 21535ms
Finished structural reductions in LTL mode , in 1 iterations and 21699 ms. Remains : 124/124 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3))))), (X (X (NOT p3))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3))]
RANDOM walk for 55 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3))))), (X (X (NOT p3))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F p3), (F (NOT (AND (NOT p0) (NOT p3) p1))), (F (NOT (AND (OR p0 (NOT p3)) (OR p0 p1))))]
Knowledge based reduction with 6 factoid took 263 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3))]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3))]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3))]
Product exploration explored 100000 steps with 8076 reset in 309 ms.
Product exploration explored 100000 steps with 8088 reset in 325 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3))]
Support contains 52 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 124 transition count 128
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 16 rules in 10 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:16:36] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 124 cols
[2025-05-31 02:16:36] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:36] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:36] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:36] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:37] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:37] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:37] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:37] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:37] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/15 constraints. Problems are: Problem set: 12 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:37] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:37] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:37] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:37] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:37] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/20 constraints. Problems are: Problem set: 12 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:37] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:37] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:37] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 3/23 constraints. Problems are: Problem set: 12 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/23 constraints. Problems are: Problem set: 12 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 4/124 variables, 3/26 constraints. Problems are: Problem set: 12 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 2/28 constraints. Problems are: Problem set: 12 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:38] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:38] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:39] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:39] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:39] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:39] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:39] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 7/35 constraints. Problems are: Problem set: 16 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:16:39] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/160 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/252 variables, 0/160 constraints. Problems are: Problem set: 16 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 160 constraints, problems are : Problem set: 16 solved, 96 unsolved in 5661 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 24/28 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/28 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 20/124 variables, 6/34 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/36 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 96/256 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/256 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/256 constraints. Problems are: Problem set: 16 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 256 constraints, problems are : Problem set: 16 solved, 96 unsolved in 12618 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/112 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18291ms problems are : Problem set: 16 solved, 96 unsolved
Search for dead transitions found 16 dead transitions in 18292ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 112/128 transitions.
Graph (complete) has 240 edges and 124 vertex of which 108 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 108 /124 variables (removed 16) and now considering 112/112 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/124 places, 112/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18323 ms. Remains : 108/124 places, 112/128 transitions.
Built C files in :
/tmp/ltsmin5125473829120775141
[2025-05-31 02:16:54] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5125473829120775141
Running compilation step : cd /tmp/ltsmin5125473829120775141;'/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 238 ms.
Running link step : cd /tmp/ltsmin5125473829120775141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5125473829120775141;'/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/stateBased12636498910777495823.hoa' '--buchi-type=spotba'
LTSmin run took 9278 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-12 finished in 54025 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)&&(X((X(X(p2)) U (p3&&X(X(p2)))))||p1))))'
Support contains 56 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2025-05-31 02:17:04] [INFO ] Computed 28 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:17:04] [INFO ] Implicit Places using invariants in 64 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 66 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2), true]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-13
Entered a terminal (fully accepting) state of product in 17 steps with 1 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-13 finished in 355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(((p0 U p1)&&F(X(X(p2))))) U p0))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-05-31 02:17:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:17:04] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-31 02:17:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:17:04] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-05-31 02:17:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4206 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5436 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9652ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 9652ms
Finished structural reductions in LTL mode , in 1 iterations and 9804 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 303 ms :[true, p0, p2, (AND p1 p2), p1, p2, (AND p2 p1 p0), (AND p1 p2)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-15
Entered a terminal (fully accepting) state of product in 46 steps with 2 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-15 finished in 10129 ms.
All properties solved by simple procedures.
Total runtime 206022 ms.
BK_STOP 1748657834952
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="DatabaseWithMutex-COL-04"
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 DatabaseWithMutex-COL-04, 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 r044-tall-174854029100796"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-04.tgz
mv DatabaseWithMutex-COL-04 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 ;