About the Execution of ITS-Tools for CryptoMiner-COL-D03N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 2783978.00 | 0.00 | 0.00 | TTFFTFTFFFFFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028700564.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 CryptoMiner-COL-D03N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028700564
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K 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 96K 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 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 13K 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 CryptoMiner-COL-D03N100-LTLFireability-00
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-01
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-02
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-03
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-04
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-05
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-06
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-07
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-08
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-09
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-10
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-11
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-12
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-13
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-14
FORMULA_NAME CryptoMiner-COL-D03N100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748616610296
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D03N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-05-30 14:50:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 14:50:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 14:50:11] [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-30 14:50:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-30 14:50:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 534 ms
[2025-05-30 14:50:12] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 12 PT places and 20.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2025-05-30 14:50:12] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 5 ms.
[2025-05-30 14:50:12] [INFO ] Skeletonized 7 HLPN properties in 1 ms. Removed 9 properties that had guard overlaps.
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 2 properties that can be checked using skeleton over-approximation.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N100-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2025-05-30 14:50:12] [INFO ] Flatten gal took : 20 ms
[2025-05-30 14:50:12] [INFO ] Flatten gal took : 1 ms
Arc [0:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2025-05-30 14:50:12] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 34 arcs in 12 ms.
[2025-05-30 14:50:12] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N100-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 10 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2025-05-30 14:50:12] [INFO ] Computed 0 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:12] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-30 14:50:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:12] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:12] [INFO ] Invariant cache hit.
[2025-05-30 14:50:12] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 169 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 141 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 335ms
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 568 ms. Remains : 11/12 places, 12/12 transitions.
Support contains 8 out of 11 places after structural reductions.
[2025-05-30 14:50:13] [INFO ] Flatten gal took : 3 ms
[2025-05-30 14:50:13] [INFO ] Flatten gal took : 3 ms
[2025-05-30 14:50:13] [INFO ] Input system was already deterministic with 12 transitions.
Reduction of identical properties reduced properties to check from 9 to 5
RANDOM walk for 30666 steps (7 resets) in 69 ms. (438 steps per ms) remains 0/5 properties
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F((X(!p0)&&p1)))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:50:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:13] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-05-30 14:50:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:13] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:13] [INFO ] Invariant cache hit.
[2025-05-30 14:50:13] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 109 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 138 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 255ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 256ms
Finished structural reductions in LTL mode , in 1 iterations and 316 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), p0, (AND (NOT p1) (NOT p0)), (OR (NOT p1) p0)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-00
Product exploration explored 100000 steps with 42910 reset in 170 ms.
Product exploration explored 100000 steps with 42842 reset in 112 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 314 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[false, p0, false, false, (OR (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40078 steps (12 resets) in 27 ms. (1431 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
[2025-05-30 14:50:15] [INFO ] Invariant cache hit.
[2025-05-30 14:50:15] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
After SMT solving in domain Real declared 2/23 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[State Equation: 0/11 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 395 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[false, (AND p1 p0), p0, false, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 221 ms :[false, (AND p1 p0), p0, false, (OR (NOT p1) p0)]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:50:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:16] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-30 14:50:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:16] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:16] [INFO ] Invariant cache hit.
[2025-05-30 14:50:16] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 90 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 96 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 192ms
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND p1 p0), false, p0, false, (OR (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 304 steps (0 resets) in 4 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 247 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND p1 p0), false, p0, false, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 215 ms :[(AND p1 p0), false, p0, false, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 222 ms :[(AND p1 p0), false, p0, false, (OR (NOT p1) p0)]
Product exploration explored 100000 steps with 42777 reset in 51 ms.
Product exploration explored 100000 steps with 42789 reset in 49 ms.
Built C files in :
/tmp/ltsmin5189107994013447732
[2025-05-30 14:50:17] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5189107994013447732
Running compilation step : cd /tmp/ltsmin5189107994013447732;'/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 207 ms.
Running link step : cd /tmp/ltsmin5189107994013447732;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin5189107994013447732;'/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/stateBased16955090498451764421.hoa' '--buchi-type=spotba'
LTSmin run took 529 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-00 finished in 5155 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 G(!p1)) U X(p1))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:50:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:18] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-05-30 14:50:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:18] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:18] [INFO ] Invariant cache hit.
[2025-05-30 14:50:18] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 89 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 122 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 216ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 217ms
Finished structural reductions in LTL mode , in 1 iterations and 271 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), false, false, true, p1, p1]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 66 ms.
Product exploration explored 100000 steps with 33333 reset in 68 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT (OR (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N100-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-01 finished in 786 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||X(X(F(!p1)))) U (G((p0||X(X(F(!p1)))))||((p0||X(X(F(!p1))))&&X(X(p0)))))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:50:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:19] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-05-30 14:50:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:19] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:19] [INFO ] Invariant cache hit.
[2025-05-30 14:50:19] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 82 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 122 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 209ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 209ms
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-02
Product exploration explored 100000 steps with 2 reset in 68 ms.
Stack based approach found an accepted trace after 67 steps with 11 reset with depth 23 and stack size 23 in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-02 finished in 620 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&&X((F(G(p2))&&p1)))))'
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:50:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:20] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-05-30 14:50:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:20] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:20] [INFO ] Invariant cache hit.
[2025-05-30 14:50:20] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 86 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 111 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 201ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 202ms
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-03 finished in 482 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))||G(!p1)))'
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 5 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:50:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:20] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-05-30 14:50:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:20] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:50:20] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:20] [INFO ] Invariant cache hit.
[2025-05-30 14:50:20] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 91 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 130 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 224ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 225ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 278 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 112 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 1 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-05 finished in 463 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&&G(!p1)))||F((F(!p1)&&p2))))'
Support contains 8 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:50:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:21] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 14:50:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:21] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:21] [INFO ] Invariant cache hit.
[2025-05-30 14:50:21] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 156 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 114 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 272ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 272ms
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 206 ms :[p1, (OR (NOT p2) p1), (OR p1 (AND (NOT p0) (NOT p2))), (OR p1 (AND (NOT p0) (NOT p2))), p1]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 65 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-07 finished in 654 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&&X(X(p1))&&(p1 U !p2))))'
Support contains 7 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 6 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:50:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:21] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-05-30 14:50:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:21] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:21] [INFO ] Invariant cache hit.
[2025-05-30 14:50:21] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 251 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 111 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 366ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 367ms
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) p2 p0), (OR (NOT p1) p0 p2), true, (NOT p1), p2, (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-08
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-08 finished in 676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Graph (trivial) has 4 edges and 11 vertex of which 4 / 11 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 6 ms. Remains 8 /11 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 8 cols
[2025-05-30 14:50:22] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-05-30 14:50:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:22] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:50:22] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-05-30 14:50:22] [INFO ] Invariant cache hit.
[2025-05-30 14:50:22] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/15 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/16 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 11 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/15 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 17 constraints, problems are : Problem set: 0 solved, 6 unsolved in 75 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/11 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 213 ms. Remains : 8/11 places, 9/12 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-09 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0)||(!p1 U !p2)) U X(!p1)))'
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2025-05-30 14:50:22] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-30 14:50:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:22] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:22] [INFO ] Invariant cache hit.
[2025-05-30 14:50:22] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 83 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 111 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 197ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 197ms
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 335 ms :[p1, p1, p1, (AND p0 p2 p1), (AND p0 p1), (AND p2 p1), true, p0]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-10
Product exploration explored 100000 steps with 9016 reset in 122 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-10 finished in 729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(!p1)||p0)))))'
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:50:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:23] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-30 14:50:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:23] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:23] [INFO ] Invariant cache hit.
[2025-05-30 14:50:23] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 77 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 98 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 188ms
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 178 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40067 steps (11 resets) in 54 ms. (728 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (96 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
[2025-05-30 14:50:24] [INFO ] Invariant cache hit.
[2025-05-30 14:50:24] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
After SMT solving in domain Real declared 5/23 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[State Equation: 0/11 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 187 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:50:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:25] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-30 14:50:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:25] [INFO ] Invariant cache hit.
[2025-05-30 14:50:25] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 127 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 112 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 243ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 243ms
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 16996 steps (4 resets) in 15 ms. (1062 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 175 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 193 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 175 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 62 ms.
Product exploration explored 100000 steps with 0 reset in 99 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 201 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:50:27] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:27] [INFO ] Invariant cache hit.
[2025-05-30 14:50:27] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 96 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 112 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 213ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin3286401525204639669
[2025-05-30 14:50:27] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3286401525204639669
Running compilation step : cd /tmp/ltsmin3286401525204639669;'/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 78 ms.
Running link step : cd /tmp/ltsmin3286401525204639669;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3286401525204639669;'/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/stateBased8752874639959470768.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:50:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:42] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-30 14:50:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:50:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:50:42] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:50:42] [INFO ] Invariant cache hit.
[2025-05-30 14:50:42] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 83 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 103 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 192ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 192ms
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin10969786319733085820
[2025-05-30 14:50:42] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10969786319733085820
Running compilation step : cd /tmp/ltsmin10969786319733085820;'/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 88 ms.
Running link step : cd /tmp/ltsmin10969786319733085820;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10969786319733085820;'/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/stateBased15247446580903646153.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 14:50:57] [INFO ] Flatten gal took : 2 ms
[2025-05-30 14:50:57] [INFO ] Flatten gal took : 1 ms
[2025-05-30 14:50:57] [INFO ] Time to serialize gal into /tmp/LTL15298110288929102554.gal : 1 ms
[2025-05-30 14:50:57] [INFO ] Time to serialize properties into /tmp/LTL14724931083895834718.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15298110288929102554.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12339971301538619763.hoa' '-atoms' '/tmp/LTL14724931083895834718.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14724931083895834718.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12339971301538619763.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/i...180
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2025-05-30 14:51:12] [INFO ] Flatten gal took : 1 ms
[2025-05-30 14:51:12] [INFO ] Flatten gal took : 1 ms
[2025-05-30 14:51:12] [INFO ] Time to serialize gal into /tmp/LTL6616617729573603851.gal : 1 ms
[2025-05-30 14:51:12] [INFO ] Time to serialize properties into /tmp/LTL13336265139143208546.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6616617729573603851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13336265139143208546.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((capacity_0<1)||(state_0<1))")||(G("(((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))")))))))
Formula 0 simplified : XXF(!"((capacity_0<1)||(state_0<1))" & F!"(((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))")
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/i...180
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2025-05-30 14:51:27] [INFO ] Flatten gal took : 2 ms
[2025-05-30 14:51:27] [INFO ] Applying decomposition
[2025-05-30 14:51:27] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5417865351336984262.txt' '-o' '/tmp/graph5417865351336984262.bin' '-w' '/tmp/graph5417865351336984262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5417865351336984262.bin' '-l' '-1' '-v' '-w' '/tmp/graph5417865351336984262.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:51:28] [INFO ] Decomposing Gal with order
[2025-05-30 14:51:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:51:28] [INFO ] Removed a total of 2 redundant transitions.
[2025-05-30 14:51:28] [INFO ] Flatten gal took : 26 ms
[2025-05-30 14:51:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 14:51:28] [INFO ] Time to serialize gal into /tmp/LTL15750296767774187242.gal : 1 ms
[2025-05-30 14:51:28] [INFO ] Time to serialize properties into /tmp/LTL12665273310646250744.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15750296767774187242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12665273310646250744.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((i0.u1.capacity_0<1)||(u2.state_0<1))")||(G("(((i0.u1.capacity_0>=1)||(i0.u1.capacity_1>=1))||((i0.u0.capacity_2>=1)||(i0....182
Formula 0 simplified : XXF(!"((i0.u1.capacity_0<1)||(u2.state_0<1))" & F!"(((i0.u1.capacity_0>=1)||(i0.u1.capacity_1>=1))||((i0.u0.capacity_2>=1)||(i0.u0.c...172
Detected timeout of ITS tools.
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-12 finished in 79657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0||X((!p0||X(X((!p1 U (G(!p1)||(!p1&&G(p2)))))))))))'
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:51:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:51:43] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-30 14:51:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:51:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:51:43] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:51:43] [INFO ] Invariant cache hit.
[2025-05-30 14:51:43] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 91 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 108 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 203ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 203ms
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-13
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-13 finished in 577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Graph (trivial) has 4 edges and 11 vertex of which 4 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 2 ms. Remains 8 /11 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 8 cols
[2025-05-30 14:51:43] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:51:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-30 14:51:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:51:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:51:43] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:51:43] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-05-30 14:51:43] [INFO ] Invariant cache hit.
[2025-05-30 14:51:43] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/15 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/16 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 11 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/15 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 17 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/11 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 8/11 places, 9/12 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-14
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-14 finished in 275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(!p1)||p0)))))'
Found a Lengthening insensitive property : CryptoMiner-COL-D03N100-LTLFireability-12
Stuttering acceptance computed with spot in 169 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2025-05-30 14:51:44] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:51:44] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-05-30 14:51:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:51:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:51:44] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:51:44] [INFO ] Invariant cache hit.
[2025-05-30 14:51:44] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 81 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 91 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 178ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 233 ms. Remains : 11/11 places, 12/12 transitions.
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 61 ms.
Product exploration explored 100000 steps with 0 reset in 106 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40069 steps (11 resets) in 23 ms. (1669 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (96 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
[2025-05-30 14:51:45] [INFO ] Invariant cache hit.
[2025-05-30 14:51:45] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
After SMT solving in domain Real declared 5/23 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[State Equation: 0/11 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 4 factoid took 281 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 185 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:51:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:51:45] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-30 14:51:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:51:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:51:45] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:51:45] [INFO ] Invariant cache hit.
[2025-05-30 14:51:45] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 79 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 92 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 175ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 175ms
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 7081 steps (2 resets) in 5 ms. (1180 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 186 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 182 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 62 ms.
Product exploration explored 100000 steps with 0 reset in 92 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 192 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:51:47] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-05-30 14:51:47] [INFO ] Invariant cache hit.
[2025-05-30 14:51:47] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 80 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 140 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 225ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin9127597347006851215
[2025-05-30 14:51:47] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9127597347006851215
Running compilation step : cd /tmp/ltsmin9127597347006851215;'/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 89 ms.
Running link step : cd /tmp/ltsmin9127597347006851215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9127597347006851215;'/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/stateBased15394392638678011598.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:52:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:52:02] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-30 14:52:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:52:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:52:02] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:52:02] [INFO ] Invariant cache hit.
[2025-05-30 14:52:02] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 76 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 100 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 194ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 196ms
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin10781852863073751937
[2025-05-30 14:52:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10781852863073751937
Running compilation step : cd /tmp/ltsmin10781852863073751937;'/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 88 ms.
Running link step : cd /tmp/ltsmin10781852863073751937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10781852863073751937;'/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/stateBased2523849655082728852.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 14:52:18] [INFO ] Flatten gal took : 2 ms
[2025-05-30 14:52:18] [INFO ] Flatten gal took : 2 ms
[2025-05-30 14:52:18] [INFO ] Time to serialize gal into /tmp/LTL16205518622022260720.gal : 0 ms
[2025-05-30 14:52:18] [INFO ] Time to serialize properties into /tmp/LTL10019432826163400737.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16205518622022260720.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9324089564148772134.hoa' '-atoms' '/tmp/LTL10019432826163400737.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10019432826163400737.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9324089564148772134.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/i...180
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2025-05-30 14:52:33] [INFO ] Flatten gal took : 1 ms
[2025-05-30 14:52:33] [INFO ] Flatten gal took : 1 ms
[2025-05-30 14:52:33] [INFO ] Time to serialize gal into /tmp/LTL10874467368570551035.gal : 1 ms
[2025-05-30 14:52:33] [INFO ] Time to serialize properties into /tmp/LTL10108951327392780225.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10874467368570551035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10108951327392780225.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((capacity_0<1)||(state_0<1))")||(G("(((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))")))))))
Formula 0 simplified : XXF(!"((capacity_0<1)||(state_0<1))" & F!"(((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))")
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/i...180
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2025-05-30 14:52:48] [INFO ] Flatten gal took : 2 ms
[2025-05-30 14:52:48] [INFO ] Applying decomposition
[2025-05-30 14:52:48] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9356294658846222435.txt' '-o' '/tmp/graph9356294658846222435.bin' '-w' '/tmp/graph9356294658846222435.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9356294658846222435.bin' '-l' '-1' '-v' '-w' '/tmp/graph9356294658846222435.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:52:48] [INFO ] Decomposing Gal with order
[2025-05-30 14:52:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:52:48] [INFO ] Removed a total of 2 redundant transitions.
[2025-05-30 14:52:48] [INFO ] Flatten gal took : 2 ms
[2025-05-30 14:52:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-05-30 14:52:48] [INFO ] Time to serialize gal into /tmp/LTL10743882596393854015.gal : 0 ms
[2025-05-30 14:52:48] [INFO ] Time to serialize properties into /tmp/LTL3046035209472313822.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10743882596393854015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3046035209472313822.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((i0.u0.capacity_0<1)||(u2.state_0<1))")||(G("(((i0.u0.capacity_0>=1)||(i0.u0.capacity_1>=1))||((i0.u1.capacity_2>=1)||(i0....182
Formula 0 simplified : XXF(!"((i0.u0.capacity_0<1)||(u2.state_0<1))" & F!"(((i0.u0.capacity_0>=1)||(i0.u0.capacity_1>=1))||((i0.u1.capacity_2>=1)||(i0.u1.c...172
Detected timeout of ITS tools.
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-12 finished in 79515 ms.
[2025-05-30 14:53:03] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16788825893082721577
[2025-05-30 14:53:03] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2025-05-30 14:53:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 14:53:03] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2025-05-30 14:53:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 14:53:03] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2025-05-30 14:53:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 14:53:03] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16788825893082721577
Running compilation step : cd /tmp/ltsmin16788825893082721577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
[2025-05-30 14:53:03] [INFO ] Applying decomposition
[2025-05-30 14:53:03] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17421216004553964614.txt' '-o' '/tmp/graph17421216004553964614.bin' '-w' '/tmp/graph17421216004553964614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17421216004553964614.bin' '-l' '-1' '-v' '-w' '/tmp/graph17421216004553964614.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:53:03] [INFO ] Decomposing Gal with order
[2025-05-30 14:53:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:53:03] [INFO ] Removed a total of 2 redundant transitions.
[2025-05-30 14:53:03] [INFO ] Flatten gal took : 3 ms
[2025-05-30 14:53:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-05-30 14:53:03] [INFO ] Time to serialize gal into /tmp/LTLFireability3055893919409565330.gal : 1 ms
[2025-05-30 14:53:03] [INFO ] Time to serialize properties into /tmp/LTLFireability5946781550665676319.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3055893919409565330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5946781550665676319.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((i0.u0.capacity_0<1)||(u2.state_0<1))")||(G(!("(((i0.u0.capacity_0<1)&&(i0.u0.capacity_1<1))&&((i0.u1.capacity_2<1)&&(i0.u...181
Formula 0 simplified : XXF(!"((i0.u0.capacity_0<1)||(u2.state_0<1))" & F"(((i0.u0.capacity_0<1)&&(i0.u0.capacity_1<1))&&((i0.u1.capacity_2<1)&&(i0.u1.capac...167
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin16788825893082721577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16788825893082721577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](([](!(LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t6, t9, u2.t8, u3.t10, u3.t11, Intersection with reachable at each step enabled. (destroyed/...189
Computing Next relation with stutter on 8037 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: LTL layer: formula: X(X([](([](!(LTLAPp1==true))||(LTLAPp0==true)))))
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: "X(X([](([](!(LTLAPp1==true))||(LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.067: DFS-FIFO for weak LTL, using special progress label 15
pins2lts-mc-linux64( 0/ 8), 0.067: There are 16 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.067: State length is 12, there are 20 groups
pins2lts-mc-linux64( 0/ 8), 0.067: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.067: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.067: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.067: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.084: ~1 levels ~960 states ~3472 transitions
pins2lts-mc-linux64( 3/ 8), 0.093: ~1 levels ~1920 states ~7184 transitions
pins2lts-mc-linux64( 3/ 8), 0.109: ~1 levels ~3840 states ~15064 transitions
pins2lts-mc-linux64( 5/ 8), 0.132: ~1 levels ~7680 states ~29840 transitions
pins2lts-mc-linux64( 5/ 8), 0.179: ~1 levels ~15360 states ~61216 transitions
pins2lts-mc-linux64( 2/ 8), 0.270: ~1 levels ~30720 states ~129624 transitions
pins2lts-mc-linux64( 2/ 8), 0.431: ~1 levels ~61440 states ~265264 transitions
pins2lts-mc-linux64( 4/ 8), 0.706: ~1 levels ~122880 states ~544096 transitions
pins2lts-mc-linux64( 5/ 8), 1.028: ~1 levels ~245760 states ~1066712 transitions
pins2lts-mc-linux64( 5/ 8), 1.712: ~1 levels ~491520 states ~2158480 transitions
pins2lts-mc-linux64( 6/ 8), 2.860: ~1 levels ~983040 states ~4760200 transitions
pins2lts-mc-linux64( 4/ 8), 4.536: ~1 levels ~1966080 states ~9078992 transitions
pins2lts-mc-linux64( 4/ 8), 7.720: ~1 levels ~3932160 states ~18561136 transitions
pins2lts-mc-linux64( 4/ 8), 12.397: ~1 levels ~7864320 states ~37638720 transitions
pins2lts-mc-linux64( 4/ 8), 20.022: ~1 levels ~15728640 states ~75369744 transitions
pins2lts-mc-linux64( 4/ 8), 35.891: ~1 levels ~31457280 states ~147280320 transitions
pins2lts-mc-linux64( 4/ 8), 65.449: ~1 levels ~62914560 states ~292011624 transitions
pins2lts-mc-linux64( 4/ 8), 132.535: ~1 levels ~125829120 states ~593080224 transitions
pins2lts-mc-linux64( 0/ 8), 162.755: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 162.776:
pins2lts-mc-linux64( 0/ 8), 162.776: mean standard work distribution: 4.3% (states) 2.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 162.776:
pins2lts-mc-linux64( 0/ 8), 162.776: Explored 127365408 states 603965461 transitions, fanout: 4.742
pins2lts-mc-linux64( 0/ 8), 162.776: Total exploration time 162.700 sec (162.680 sec minimum, 162.690 sec on average)
pins2lts-mc-linux64( 0/ 8), 162.776: States per second: 782824, Transitions per second: 3712142
pins2lts-mc-linux64( 0/ 8), 162.776:
pins2lts-mc-linux64( 0/ 8), 162.776: Progress states detected: 134217283
pins2lts-mc-linux64( 0/ 8), 162.776: Redundant explorations: -5.1051
pins2lts-mc-linux64( 0/ 8), 162.776:
pins2lts-mc-linux64( 0/ 8), 162.776: Queue width: 8B, total height: 13341082, memory: 101.78MB
pins2lts-mc-linux64( 0/ 8), 162.776: Tree memory: 1028.2MB, 8.0 B/state, compr.: 16.1%
pins2lts-mc-linux64( 0/ 8), 162.776: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 162.776: Stored 12 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 162.776: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 162.776: Est. total memory use: 1130.0MB (~1125.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16788825893082721577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](([](!(LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16788825893082721577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](([](!(LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-30 15:14:00] [INFO ] Applying decomposition
[2025-05-30 15:14:00] [INFO ] Flatten gal took : 2 ms
[2025-05-30 15:14:00] [INFO ] Decomposing Gal with order
[2025-05-30 15:14:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 15:14:00] [INFO ] Flatten gal took : 2 ms
[2025-05-30 15:14:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-05-30 15:14:00] [INFO ] Time to serialize gal into /tmp/LTLFireability10984272647612430918.gal : 1 ms
[2025-05-30 15:14:00] [INFO ] Time to serialize properties into /tmp/LTLFireability8646973246145950364.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10984272647612430918.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8646973246145950364.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((CD0.capacity_0<1)||(CD0.state_0<1))")||(G(!("(((CD0.capacity_0<1)&&(CD1.capacity_1<1))&&((CD2.capacity_2<1)&&(CD3.capacit...172
Formula 0 simplified : XXF(!"((CD0.capacity_0<1)||(CD0.state_0<1))" & F"(((CD0.capacity_0<1)&&(CD1.capacity_1<1))&&((CD2.capacity_2<1)&&(CD3.capacity_3<1))...158
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t10, CD3.t6, CD3.t11, Intersection with reachable at each step enabled. (destroyed/r...188
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2025-05-30 15:34:57] [INFO ] Flatten gal took : 2 ms
[2025-05-30 15:34:57] [INFO ] Input system was already deterministic with 12 transitions.
[2025-05-30 15:34:57] [INFO ] Transformed 11 places.
[2025-05-30 15:34:57] [INFO ] Transformed 12 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 15:34:57] [INFO ] Time to serialize gal into /tmp/LTLFireability16589473517925032374.gal : 0 ms
[2025-05-30 15:34:57] [INFO ] Time to serialize properties into /tmp/LTLFireability14205891755483823794.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16589473517925032374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14205891755483823794.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G(("((capacity_0<1)||(state_0<1))")||(G(!("(((capacity_0<1)&&(capacity_1<1))&&((capacity_2<1)&&(capacity_3<1)))"))))))))
Formula 0 simplified : XXF(!"((capacity_0<1)||(state_0<1))" & F"(((capacity_0<1)&&(capacity_1<1))&&((capacity_2<1)&&(capacity_3<1)))")
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/i...180
Computing Next relation with stutter on 8037 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
8919 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,89.213,1198588,1,0,1165,5.91011e+06,64,1236,913,6.18685e+06,3101
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 2782557 ms.
BK_STOP 1748619394274
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-COL-D03N100"
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 CryptoMiner-COL-D03N100, 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-174854028700564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-COL-D03N100.tgz
mv CryptoMiner-COL-D03N100 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 ;