About the Execution of ITS-Tools for CryptoMiner-COL-D10N000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10788.472 | 3600000.00 | 4746304.00 | 9395.60 | F?FFF?F???TFT?FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r092-tall-171624189100340.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is CryptoMiner-COL-D10N000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189100340
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.4K Apr 12 12:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 12:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 12 12:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 12:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 12 12:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 129K Apr 12 12:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.4K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-00
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-01
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-02
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-03
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-04
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-05
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-06
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-07
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-08
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-09
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-10
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-11
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-12
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-13
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-14
FORMULA_NAME CryptoMiner-COL-D10N000-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716295440246
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-D10N000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-21 12:44:01] [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]
[2024-05-21 12:44:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:44:01] [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.
[2024-05-21 12:44:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 12:44:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 479 ms
[2024-05-21 12:44:01] [INFO ] Imported 2 HL places and 4 HL transitions for a total of 22 PT places and 44.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 12:44:02] [INFO ] Built PT skeleton of HLPN with 2 places and 4 transitions 10 arcs in 4 ms.
[2024-05-21 12:44:02] [INFO ] Skeletonized 6 HLPN properties in 1 ms. Removed 10 properties that had guard overlaps.
Computed a total of 1 stabilizing places and 1 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [1:1*[(MOD (ADD $x 1) 11)]] contains successor/predecessor on variables of sort CD
[2024-05-21 12:44:02] [INFO ] Unfolded HLPN to a Petri net with 22 places and 22 transitions 64 arcs in 19 ms.
[2024-05-21 12:44:02] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA CryptoMiner-COL-D10N000-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N000-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N000-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N000-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N000-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 22
Applied a total of 1 rules in 10 ms. Remains 21 /22 variables (removed 1) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-21 12:44:02] [INFO ] Computed 0 invariants in 8 ms
[2024-05-21 12:44:02] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-21 12:44:02] [INFO ] Invariant cache hit.
[2024-05-21 12:44:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:44:02] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-21 12:44:02] [INFO ] Invariant cache hit.
[2024-05-21 12:44:02] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 365 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 332 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 727ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 738ms
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 22/22 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 992 ms. Remains : 21/22 places, 22/22 transitions.
Support contains 11 out of 21 places after structural reductions.
[2024-05-21 12:44:03] [INFO ] Flatten gal took : 13 ms
[2024-05-21 12:44:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 12:44:03] [INFO ] Input system was already deterministic with 22 transitions.
Reduction of identical properties reduced properties to check from 7 to 4
RANDOM walk for 40000 steps (2792 resets) in 672 ms. (59 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
[2024-05-21 12:44:03] [INFO ] Invariant cache hit.
[2024-05-21 12:44:03] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/17 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/21 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 22/43 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 32 ms.
Refiners :[State Equation: 11/21 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 11 stabilizing places and 11 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:44:03] [INFO ] Invariant cache hit.
[2024-05-21 12:44:03] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 12:44:03] [INFO ] Invariant cache hit.
[2024-05-21 12:44:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:44:03] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-21 12:44:03] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:44:03] [INFO ] Invariant cache hit.
[2024-05-21 12:44:03] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 173 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 208 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 395ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 396ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 482 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLFireability-00
Product exploration explored 100000 steps with 7351 reset in 196 ms.
Product exploration explored 100000 steps with 7340 reset in 105 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 11 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-21 12:44:05] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 252 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D10N000-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D10N000-LTLFireability-00 finished in 1816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(F(p0)&&F(p1)))))'
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:44:05] [INFO ] Invariant cache hit.
[2024-05-21 12:44:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 12:44:05] [INFO ] Invariant cache hit.
[2024-05-21 12:44:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:44:05] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-21 12:44:05] [INFO ] Invariant cache hit.
[2024-05-21 12:44:05] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 171 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 160 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 339ms
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLFireability-01
Product exploration explored 100000 steps with 7939 reset in 148 ms.
Product exploration explored 100000 steps with 7939 reset in 102 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 149 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 202 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 42 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 8 factoid took 284 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 213 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
[2024-05-21 12:44:07] [INFO ] Invariant cache hit.
[2024-05-21 12:44:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:44:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:44:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-21 12:44:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:44:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-21 12:44:07] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:44:07] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:44:07] [INFO ] Invariant cache hit.
[2024-05-21 12:44:07] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 12:44:07] [INFO ] Invariant cache hit.
[2024-05-21 12:44:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:44:07] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-21 12:44:07] [INFO ] Invariant cache hit.
[2024-05-21 12:44:07] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 173 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 180 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 359ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 360ms
Finished structural reductions in LTL mode , in 1 iterations and 423 ms. Remains : 21/21 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 248 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 199 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 45 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 282 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 180 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
[2024-05-21 12:44:09] [INFO ] Invariant cache hit.
[2024-05-21 12:44:09] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 12:44:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:44:09] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:44:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:44:09] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-21 12:44:09] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:44:09] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7936 reset in 48 ms.
Product exploration explored 100000 steps with 7918 reset in 58 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:44:09] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:44:09] [INFO ] Invariant cache hit.
[2024-05-21 12:44:09] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 180 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 184 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 398ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 399ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin8634117237106513943
[2024-05-21 12:44:10] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8634117237106513943
Running compilation step : cd /tmp/ltsmin8634117237106513943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 207 ms.
Running link step : cd /tmp/ltsmin8634117237106513943;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin8634117237106513943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11455864418581288349.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:44:25] [INFO ] Invariant cache hit.
[2024-05-21 12:44:25] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 12:44:25] [INFO ] Invariant cache hit.
[2024-05-21 12:44:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:44:25] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-21 12:44:25] [INFO ] Invariant cache hit.
[2024-05-21 12:44:25] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 195 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 163 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 367ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 367ms
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin17586573032236917513
[2024-05-21 12:44:25] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17586573032236917513
Running compilation step : cd /tmp/ltsmin17586573032236917513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 99 ms.
Running link step : cd /tmp/ltsmin17586573032236917513;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17586573032236917513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12952798382037502454.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:44:41] [INFO ] Flatten gal took : 11 ms
[2024-05-21 12:44:41] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:44:41] [INFO ] Time to serialize gal into /tmp/LTL4239924986037262522.gal : 1 ms
[2024-05-21 12:44:41] [INFO ] Time to serialize properties into /tmp/LTL2314703748163806019.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4239924986037262522.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2171292673439489223.hoa' '-atoms' '/tmp/LTL2314703748163806019.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2314703748163806019.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2171292673439489223.hoa
Detected timeout of ITS tools.
[2024-05-21 12:44:56] [INFO ] Flatten gal took : 3 ms
[2024-05-21 12:44:56] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:44:56] [INFO ] Time to serialize gal into /tmp/LTL4647378634973451943.gal : 1 ms
[2024-05-21 12:44:56] [INFO ] Time to serialize properties into /tmp/LTL17321214154583529723.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4647378634973451943.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17321214154583529723.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(state_10>=1)")))||((F("(state_10>=1)"))&&(F("(((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(s...246
Formula 0 simplified : X(FG!"(state_10>=1)" & (G!"(state_10>=1)" | G!"(((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(state_5<1...234
Detected timeout of ITS tools.
[2024-05-21 12:45:11] [INFO ] Flatten gal took : 6 ms
[2024-05-21 12:45:11] [INFO ] Applying decomposition
[2024-05-21 12:45:11] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10692806184046306932.txt' '-o' '/tmp/graph10692806184046306932.bin' '-w' '/tmp/graph10692806184046306932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10692806184046306932.bin' '-l' '-1' '-v' '-w' '/tmp/graph10692806184046306932.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:45:11] [INFO ] Decomposing Gal with order
[2024-05-21 12:45:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:45:11] [INFO ] Flatten gal took : 29 ms
[2024-05-21 12:45:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 12:45:11] [INFO ] Time to serialize gal into /tmp/LTL111296771183488106.gal : 1 ms
[2024-05-21 12:45:11] [INFO ] Time to serialize properties into /tmp/LTL8960490574144538329.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL111296771183488106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8960490574144538329.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(i1.u4.state_10>=1)")))||((F("(i1.u4.state_10>=1)"))&&(F("(((((u0.state_0<1)&&(u0.state_1<1))&&((i2.u1.state_2<1)&&(i2.u1.s...315
Formula 0 simplified : X(FG!"(i1.u4.state_10>=1)" & (G!"(i1.u4.state_10>=1)" | G!"(((((u0.state_0<1)&&(u0.state_1<1))&&((i2.u1.state_2<1)&&(i2.u1.state_3<1...303
Detected timeout of ITS tools.
Treatment of property CryptoMiner-COL-D10N000-LTLFireability-01 finished in 80766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:45:26] [INFO ] Invariant cache hit.
[2024-05-21 12:45:26] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 12:45:26] [INFO ] Invariant cache hit.
[2024-05-21 12:45:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:45:26] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-21 12:45:26] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:45:26] [INFO ] Invariant cache hit.
[2024-05-21 12:45:26] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 163 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 149 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 339ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 340ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 406 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLFireability-03
Product exploration explored 100000 steps with 15471 reset in 63 ms.
Product exploration explored 100000 steps with 15447 reset in 56 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 218 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-05-21 12:45:27] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D10N000-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D10N000-LTLFireability-03 finished in 1442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(X(!p1) U (X(G(!p1))||(!p1&&X(!p1))))))))'
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:45:27] [INFO ] Invariant cache hit.
[2024-05-21 12:45:27] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 12:45:27] [INFO ] Invariant cache hit.
[2024-05-21 12:45:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:45:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-21 12:45:27] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:45:27] [INFO ] Invariant cache hit.
[2024-05-21 12:45:27] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 184 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 171 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 366ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 367ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 434 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLFireability-04
Product exploration explored 100000 steps with 7351 reset in 190 ms.
Product exploration explored 100000 steps with 7341 reset in 159 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 516 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(OR (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 51 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 679 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 41 ms :[(OR (NOT p0) p1)]
[2024-05-21 12:45:30] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) p1))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 823 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D10N000-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D10N000-LTLFireability-04 finished in 3086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||F((p1&&F(!p1)))))'
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:45:30] [INFO ] Invariant cache hit.
[2024-05-21 12:45:30] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 12:45:30] [INFO ] Invariant cache hit.
[2024-05-21 12:45:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:45:30] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-21 12:45:30] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:45:31] [INFO ] Invariant cache hit.
[2024-05-21 12:45:31] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 205 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 153 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 362ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 363ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 432 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, p1, p0, (AND p1 p0)]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLFireability-05
Product exploration explored 100000 steps with 7904 reset in 56 ms.
Product exploration explored 100000 steps with 7926 reset in 64 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 9 factoid took 762 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 40000 steps (2801 resets) in 210 ms. (189 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
[2024-05-21 12:45:32] [INFO ] Invariant cache hit.
[2024-05-21 12:45:32] [INFO ] State equation strengthened by 10 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 10/43 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[State Equation: 0/21 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 17ms 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 (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 1227 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[p1, (AND p1 p0), (AND p1 p0), false, (AND p1 p0)]
Stuttering acceptance computed with spot in 196 ms :[p1, (AND p1 p0), (AND p1 p0), false, (AND p1 p0)]
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:45:34] [INFO ] Invariant cache hit.
[2024-05-21 12:45:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 12:45:34] [INFO ] Invariant cache hit.
[2024-05-21 12:45:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:45:34] [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.
[2024-05-21 12:45:34] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:45:34] [INFO ] Invariant cache hit.
[2024-05-21 12:45:34] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 160 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 177 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 342ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 400 ms. Remains : 21/21 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 578 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[p1, (AND p1 p0), (AND p1 p0), false, (AND p1 p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 48 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 661 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[p1, (AND p1 p0), (AND p1 p0), false, (AND p1 p0)]
Stuttering acceptance computed with spot in 166 ms :[p1, (AND p1 p0), (AND p1 p0), false, (AND p1 p0)]
Stuttering acceptance computed with spot in 172 ms :[p1, (AND p1 p0), (AND p1 p0), false, (AND p1 p0)]
Product exploration explored 100000 steps with 7928 reset in 65 ms.
Product exploration explored 100000 steps with 7940 reset in 66 ms.
Built C files in :
/tmp/ltsmin2776153361107226646
[2024-05-21 12:45:36] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-21 12:45:36] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:45:36] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-21 12:45:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:45:36] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-21 12:45:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:45:36] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2776153361107226646
Running compilation step : cd /tmp/ltsmin2776153361107226646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 111 ms.
Running link step : cd /tmp/ltsmin2776153361107226646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2776153361107226646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13773881413201257723.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:45:52] [INFO ] Invariant cache hit.
[2024-05-21 12:45:52] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 12:45:52] [INFO ] Invariant cache hit.
[2024-05-21 12:45:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:45:52] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-21 12:45:52] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:45:52] [INFO ] Invariant cache hit.
[2024-05-21 12:45:52] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 155 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 180 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 340ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 340ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin10732667380491792176
[2024-05-21 12:45:52] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-21 12:45:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:45:52] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-21 12:45:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:45:52] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-21 12:45:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:45:52] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10732667380491792176
Running compilation step : cd /tmp/ltsmin10732667380491792176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 112 ms.
Running link step : cd /tmp/ltsmin10732667380491792176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10732667380491792176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15685669333294677890.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:46:07] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:46:07] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:46:07] [INFO ] Time to serialize gal into /tmp/LTL18356345811665794062.gal : 1 ms
[2024-05-21 12:46:07] [INFO ] Time to serialize properties into /tmp/LTL9193896556767538761.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18356345811665794062.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4048726310715185661.hoa' '-atoms' '/tmp/LTL9193896556767538761.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9193896556767538761.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4048726310715185661.hoa
Detected timeout of ITS tools.
[2024-05-21 12:46:22] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:46:22] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:46:22] [INFO ] Time to serialize gal into /tmp/LTL13488979068817610848.gal : 0 ms
[2024-05-21 12:46:22] [INFO ] Time to serialize properties into /tmp/LTL14102759191538194798.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13488979068817610848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14102759191538194798.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("(state_0>=1)"))||(F(("(((((state_0>=1)||(state_1>=1))||((state_2>=1)||(state_3>=1)))||(((state_4>=1)||(state_5>=1))||((state_6>...367
Formula 0 simplified : F!"(state_0>=1)" & G(!"(((((state_0>=1)||(state_1>=1))||((state_2>=1)||(state_3>=1)))||(((state_4>=1)||(state_5>=1))||((state_6>=1)|...357
Detected timeout of ITS tools.
[2024-05-21 12:46:37] [INFO ] Flatten gal took : 4 ms
[2024-05-21 12:46:37] [INFO ] Applying decomposition
[2024-05-21 12:46:37] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5565347806856599085.txt' '-o' '/tmp/graph5565347806856599085.bin' '-w' '/tmp/graph5565347806856599085.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5565347806856599085.bin' '-l' '-1' '-v' '-w' '/tmp/graph5565347806856599085.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:46:37] [INFO ] Decomposing Gal with order
[2024-05-21 12:46:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:46:37] [INFO ] Flatten gal took : 3 ms
[2024-05-21 12:46:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 12:46:37] [INFO ] Time to serialize gal into /tmp/LTL5392577502356794487.gal : 1 ms
[2024-05-21 12:46:37] [INFO ] Time to serialize properties into /tmp/LTL3455482113981477153.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5392577502356794487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3455482113981477153.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G("(u0.state_0>=1)"))||(F(("(((((u0.state_0>=1)||(u0.state_1>=1))||((i1.u2.state_2>=1)||(i1.u2.state_3>=1)))||(((i1.u2.state_4>=1)...478
Formula 0 simplified : F!"(u0.state_0>=1)" & G(!"(((((u0.state_0>=1)||(u0.state_1>=1))||((i1.u2.state_2>=1)||(i1.u2.state_3>=1)))||(((i1.u2.state_4>=1)||(i...468
Detected timeout of ITS tools.
Treatment of property CryptoMiner-COL-D10N000-LTLFireability-05 finished in 81815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X(p1)&&(!p1 U X(p0))))))'
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:46:52] [INFO ] Invariant cache hit.
[2024-05-21 12:46:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 12:46:52] [INFO ] Invariant cache hit.
[2024-05-21 12:46:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:46:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-21 12:46:52] [INFO ] Invariant cache hit.
[2024-05-21 12:46:52] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 162 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 146 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 314ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 314ms
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D10N000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N000-LTLFireability-06 finished in 654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(F(!p1))&&p0))||X(X(G(p1)))))'
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:46:53] [INFO ] Invariant cache hit.
[2024-05-21 12:46:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 12:46:53] [INFO ] Invariant cache hit.
[2024-05-21 12:46:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:46:53] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-21 12:46:53] [INFO ] Invariant cache hit.
[2024-05-21 12:46:53] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 162 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 156 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 331ms
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) p1), p1, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLFireability-07
Product exploration explored 100000 steps with 7368 reset in 60 ms.
Product exploration explored 100000 steps with 7357 reset in 69 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 292 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
RANDOM walk for 95 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 9 factoid took 264 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 168 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 181 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
[2024-05-21 12:46:55] [INFO ] Invariant cache hit.
[2024-05-21 12:46:55] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 12:46:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:46:55] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:46:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:46:55] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-21 12:46:55] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 12:46:55] [INFO ] Added : 12 causal constraints over 3 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:46:55] [INFO ] Invariant cache hit.
[2024-05-21 12:46:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 12:46:55] [INFO ] Invariant cache hit.
[2024-05-21 12:46:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:46:55] [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 20 sub problems to find dead transitions.
[2024-05-21 12:46:55] [INFO ] Invariant cache hit.
[2024-05-21 12:46:55] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 154 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 165 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 325ms
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 21/21 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 196 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
RANDOM walk for 47 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 131 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 170 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 183 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
[2024-05-21 12:46:56] [INFO ] Invariant cache hit.
[2024-05-21 12:46:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 12:46:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:46:56] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:46:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:46:56] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-21 12:46:56] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:46:56] [INFO ] Added : 12 causal constraints over 3 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 166 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 7353 reset in 98 ms.
Product exploration explored 100000 steps with 7353 reset in 100 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 175 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:46:57] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:46:57] [INFO ] Invariant cache hit.
[2024-05-21 12:46:57] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 169 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 164 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 340ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 348 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin13069157308290240358
[2024-05-21 12:46:57] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13069157308290240358
Running compilation step : cd /tmp/ltsmin13069157308290240358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 96 ms.
Running link step : cd /tmp/ltsmin13069157308290240358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13069157308290240358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4464385828559827230.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:47:12] [INFO ] Invariant cache hit.
[2024-05-21 12:47:12] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 12:47:12] [INFO ] Invariant cache hit.
[2024-05-21 12:47:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:47:12] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-21 12:47:12] [INFO ] Invariant cache hit.
[2024-05-21 12:47:12] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 176 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 175 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 355ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 355ms
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin17284861055857674596
[2024-05-21 12:47:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17284861055857674596
Running compilation step : cd /tmp/ltsmin17284861055857674596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 107 ms.
Running link step : cd /tmp/ltsmin17284861055857674596;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17284861055857674596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9769880731612756123.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:47:28] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:47:28] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:47:28] [INFO ] Time to serialize gal into /tmp/LTL413042385685581632.gal : 1 ms
[2024-05-21 12:47:28] [INFO ] Time to serialize properties into /tmp/LTL8164881209252984911.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL413042385685581632.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12731485906393007371.hoa' '-atoms' '/tmp/LTL8164881209252984911.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8164881209252984911.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12731485906393007371.hoa
Detected timeout of ITS tools.
[2024-05-21 12:47:43] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:47:43] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:47:43] [INFO ] Time to serialize gal into /tmp/LTL13384707137090817174.gal : 0 ms
[2024-05-21 12:47:43] [INFO ] Time to serialize properties into /tmp/LTL13040791731673599343.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13384707137090817174.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13040791731673599343.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F(("((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(state_5<1))&&((state_6<1)&&(state_7<1))))")&&(("((s...256
Formula 0 simplified : G(!"((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(state_5<1))&&((state_6<1)&&(state_7<1))))" | !"((stat...236
Detected timeout of ITS tools.
[2024-05-21 12:47:58] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:47:58] [INFO ] Applying decomposition
[2024-05-21 12:47:58] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph17767247526028299804.txt' '-o' '/tmp/graph17767247526028299804.bin' '-w' '/tmp/graph17767247526028299804.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17767247526028299804.bin' '-l' '-1' '-v' '-w' '/tmp/graph17767247526028299804.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:47:58] [INFO ] Decomposing Gal with order
[2024-05-21 12:47:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:47:58] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:47:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 12:47:58] [INFO ] Time to serialize gal into /tmp/LTL8876631675982835158.gal : 1 ms
[2024-05-21 12:47:58] [INFO ] Time to serialize properties into /tmp/LTL1738514859024662985.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8876631675982835158.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1738514859024662985.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F(("((((u0.state_0<1)&&(u0.state_1<1))&&((i2.u1.state_2<1)&&(i2.u1.state_3<1)))&&(((i3.u2.state_4<1)&&(i3.u2.state_5<1))&&((i1.u3....325
Formula 0 simplified : G(!"((((u0.state_0<1)&&(u0.state_1<1))&&((i2.u1.state_2<1)&&(i2.u1.state_3<1)))&&(((i3.u2.state_4<1)&&(i3.u2.state_5<1))&&((i1.u3.st...305
Detected timeout of ITS tools.
Treatment of property CryptoMiner-COL-D10N000-LTLFireability-07 finished in 79924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0||G(!p1)))))'
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:48:13] [INFO ] Invariant cache hit.
[2024-05-21 12:48:13] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 12:48:13] [INFO ] Invariant cache hit.
[2024-05-21 12:48:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:48:13] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-21 12:48:13] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:48:13] [INFO ] Invariant cache hit.
[2024-05-21 12:48:13] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 167 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 171 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 342ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 402 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLFireability-08
Product exploration explored 100000 steps with 7360 reset in 67 ms.
Product exploration explored 100000 steps with 7367 reset in 87 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 7 factoid took 438 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 p1), (AND p0 p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 48 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 654 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 75 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:48:15] [INFO ] Invariant cache hit.
[2024-05-21 12:48:15] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 12:48:15] [INFO ] Invariant cache hit.
[2024-05-21 12:48:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:48:15] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-21 12:48:15] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:48:15] [INFO ] Invariant cache hit.
[2024-05-21 12:48:15] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 183 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 170 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 356ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 356ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 427 ms. Remains : 21/21 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 463 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p0 p1), (AND p0 p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 48 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 661 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 75 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 7353 reset in 70 ms.
Product exploration explored 100000 steps with 7359 reset in 76 ms.
Built C files in :
/tmp/ltsmin14924825575599930781
[2024-05-21 12:48:17] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-21 12:48:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:48:17] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-21 12:48:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:48:17] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-21 12:48:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:48:17] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14924825575599930781
Running compilation step : cd /tmp/ltsmin14924825575599930781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 108 ms.
Running link step : cd /tmp/ltsmin14924825575599930781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14924825575599930781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17130526900721940125.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:48:32] [INFO ] Invariant cache hit.
[2024-05-21 12:48:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 12:48:32] [INFO ] Invariant cache hit.
[2024-05-21 12:48:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:48:32] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-21 12:48:32] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:48:32] [INFO ] Invariant cache hit.
[2024-05-21 12:48:32] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 176 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 162 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 343ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 343ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin4282408865168840088
[2024-05-21 12:48:32] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-21 12:48:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:48:32] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-21 12:48:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:48:32] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-21 12:48:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:48:32] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4282408865168840088
Running compilation step : cd /tmp/ltsmin4282408865168840088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin4282408865168840088;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4282408865168840088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6734678996097469143.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:48:47] [INFO ] Flatten gal took : 3 ms
[2024-05-21 12:48:47] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:48:47] [INFO ] Time to serialize gal into /tmp/LTL17742304555135522915.gal : 1 ms
[2024-05-21 12:48:47] [INFO ] Time to serialize properties into /tmp/LTL6644271238914820658.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17742304555135522915.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11183047793037862494.hoa' '-atoms' '/tmp/LTL6644271238914820658.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6644271238914820658.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11183047793037862494.hoa
Detected timeout of ITS tools.
[2024-05-21 12:49:03] [INFO ] Flatten gal took : 3 ms
[2024-05-21 12:49:03] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:49:03] [INFO ] Time to serialize gal into /tmp/LTL7434322470658917949.gal : 1 ms
[2024-05-21 12:49:03] [INFO ] Time to serialize properties into /tmp/LTL12309036666820105637.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7434322470658917949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12309036666820105637.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(state_0>=1)")||(G("(((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(state_5<1))&&((state_6<1)&&(s...203
Formula 0 simplified : G(F!"(((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(state_5<1))&&((state_6<1)&&(state_7<1))))&&((state_...196
Detected timeout of ITS tools.
[2024-05-21 12:49:18] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:49:18] [INFO ] Applying decomposition
[2024-05-21 12:49:18] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph10363497314494753211.txt' '-o' '/tmp/graph10363497314494753211.bin' '-w' '/tmp/graph10363497314494753211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10363497314494753211.bin' '-l' '-1' '-v' '-w' '/tmp/graph10363497314494753211.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:49:18] [INFO ] Decomposing Gal with order
[2024-05-21 12:49:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:49:18] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:49:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 12:49:18] [INFO ] Time to serialize gal into /tmp/LTL15653228752916863150.gal : 1 ms
[2024-05-21 12:49:18] [INFO ] Time to serialize properties into /tmp/LTL17907615497098119727.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15653228752916863150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17907615497098119727.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i0.u4.state_0>=1)")||(G("(((((i0.u4.state_0<1)&&(i0.u4.state_1<1))&&((i0.u0.state_2<1)&&(i0.u0.state_3<1)))&&(((i2.u1.state_...269
Formula 0 simplified : G(F!"(((((i0.u4.state_0<1)&&(i0.u4.state_1<1))&&((i0.u0.state_2<1)&&(i0.u0.state_3<1)))&&(((i2.u1.state_4<1)&&(i2.u1.state_5<1))&&((...262
Detected timeout of ITS tools.
Treatment of property CryptoMiner-COL-D10N000-LTLFireability-08 finished in 79799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:49:33] [INFO ] Invariant cache hit.
[2024-05-21 12:49:33] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 12:49:33] [INFO ] Invariant cache hit.
[2024-05-21 12:49:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:49:33] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-21 12:49:33] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:49:33] [INFO ] Invariant cache hit.
[2024-05-21 12:49:33] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 162 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 156 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 323ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 324ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 401 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 48 ms :[p0]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLFireability-09
Product exploration explored 100000 steps with 7351 reset in 96 ms.
Product exploration explored 100000 steps with 7345 reset in 86 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[p0]
RANDOM walk for 54 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[p0]
Stuttering acceptance computed with spot in 40 ms :[p0]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:49:34] [INFO ] Invariant cache hit.
[2024-05-21 12:49:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 12:49:34] [INFO ] Invariant cache hit.
[2024-05-21 12:49:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:49:34] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-21 12:49:34] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:49:34] [INFO ] Invariant cache hit.
[2024-05-21 12:49:34] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 170 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 158 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 331ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 331ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 391 ms. Remains : 21/21 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[p0]
RANDOM walk for 42 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[p0]
Stuttering acceptance computed with spot in 41 ms :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
Product exploration explored 100000 steps with 7330 reset in 42 ms.
Product exploration explored 100000 steps with 7338 reset in 45 ms.
Built C files in :
/tmp/ltsmin13665199844224895667
[2024-05-21 12:49:35] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-21 12:49:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:49:35] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-21 12:49:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:49:35] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-21 12:49:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:49:35] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13665199844224895667
Running compilation step : cd /tmp/ltsmin13665199844224895667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 94 ms.
Running link step : cd /tmp/ltsmin13665199844224895667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13665199844224895667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5382537718147892568.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 5 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:49:50] [INFO ] Invariant cache hit.
[2024-05-21 12:49:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 12:49:50] [INFO ] Invariant cache hit.
[2024-05-21 12:49:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:49:50] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-21 12:49:50] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:49:50] [INFO ] Invariant cache hit.
[2024-05-21 12:49:50] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 162 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 156 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 323ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 395 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin357131211249839101
[2024-05-21 12:49:50] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-21 12:49:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:49:50] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-21 12:49:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:49:50] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-21 12:49:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:49:50] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin357131211249839101
Running compilation step : cd /tmp/ltsmin357131211249839101;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 107 ms.
Running link step : cd /tmp/ltsmin357131211249839101;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin357131211249839101;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7475626724216624825.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:50:05] [INFO ] Flatten gal took : 3 ms
[2024-05-21 12:50:05] [INFO ] Flatten gal took : 8 ms
[2024-05-21 12:50:05] [INFO ] Time to serialize gal into /tmp/LTL13797665257113579192.gal : 1 ms
[2024-05-21 12:50:05] [INFO ] Time to serialize properties into /tmp/LTL4175339356568251250.prop : 2 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13797665257113579192.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17725616570699743430.hoa' '-atoms' '/tmp/LTL4175339356568251250.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4175339356568251250.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17725616570699743430.hoa
Detected timeout of ITS tools.
[2024-05-21 12:50:20] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:50:20] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:50:20] [INFO ] Time to serialize gal into /tmp/LTL15529269015722227241.gal : 0 ms
[2024-05-21 12:50:20] [INFO ] Time to serialize properties into /tmp/LTL11375392395186670789.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15529269015722227241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11375392395186670789.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(state_10<1)"))))
Formula 0 simplified : GF!"(state_10<1)"
Detected timeout of ITS tools.
[2024-05-21 12:50:35] [INFO ] Flatten gal took : 3 ms
[2024-05-21 12:50:35] [INFO ] Applying decomposition
[2024-05-21 12:50:35] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph5610742808157211796.txt' '-o' '/tmp/graph5610742808157211796.bin' '-w' '/tmp/graph5610742808157211796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5610742808157211796.bin' '-l' '-1' '-v' '-w' '/tmp/graph5610742808157211796.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:50:35] [INFO ] Decomposing Gal with order
[2024-05-21 12:50:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:50:35] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:50:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 12:50:35] [INFO ] Time to serialize gal into /tmp/LTL12152717866503736478.gal : 1 ms
[2024-05-21 12:50:35] [INFO ] Time to serialize properties into /tmp/LTL11023752670826547646.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12152717866503736478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11023752670826547646.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(i3.u4.state_10<1)"))))
Formula 0 simplified : GF!"(i3.u4.state_10<1)"
Detected timeout of ITS tools.
Treatment of property CryptoMiner-COL-D10N000-LTLFireability-09 finished in 77711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:50:50] [INFO ] Invariant cache hit.
[2024-05-21 12:50:50] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 12:50:50] [INFO ] Invariant cache hit.
[2024-05-21 12:50:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:50:50] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-21 12:50:50] [INFO ] Invariant cache hit.
[2024-05-21 12:50:50] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 170 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 160 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 334ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 334ms
Finished structural reductions in LTL mode , in 1 iterations and 391 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLFireability-13
Product exploration explored 100000 steps with 7918 reset in 54 ms.
Product exploration explored 100000 steps with 7929 reset in 53 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
RANDOM walk for 71 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
[2024-05-21 12:50:51] [INFO ] Invariant cache hit.
[2024-05-21 12:50:51] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 12:50:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:50:51] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-21 12:50:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:50:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-21 12:50:51] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 12:50:51] [INFO ] Added : 12 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG p0
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:50:51] [INFO ] Invariant cache hit.
[2024-05-21 12:50:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 12:50:51] [INFO ] Invariant cache hit.
[2024-05-21 12:50:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:50:51] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-21 12:50:51] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:50:51] [INFO ] Invariant cache hit.
[2024-05-21 12:50:51] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 160 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 165 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 329ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 329ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 387 ms. Remains : 21/21 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
RANDOM walk for 45 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
[2024-05-21 12:50:52] [INFO ] Invariant cache hit.
[2024-05-21 12:50:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:50:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:50:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:50:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:50:52] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-21 12:50:52] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:50:52] [INFO ] Added : 12 causal constraints over 3 iterations in 8 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
Product exploration explored 100000 steps with 7902 reset in 50 ms.
Product exploration explored 100000 steps with 7906 reset in 49 ms.
Built C files in :
/tmp/ltsmin611370705710017610
[2024-05-21 12:50:52] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-21 12:50:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:50:52] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-21 12:50:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:50:52] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-21 12:50:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:50:52] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin611370705710017610
Running compilation step : cd /tmp/ltsmin611370705710017610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 110 ms.
Running link step : cd /tmp/ltsmin611370705710017610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin611370705710017610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16500020805643068669.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:51:08] [INFO ] Invariant cache hit.
[2024-05-21 12:51:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 12:51:08] [INFO ] Invariant cache hit.
[2024-05-21 12:51:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:51:08] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-21 12:51:08] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:51:08] [INFO ] Invariant cache hit.
[2024-05-21 12:51:08] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 177 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 175 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 357ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 427 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin7187671636236525307
[2024-05-21 12:51:08] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-21 12:51:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:51:08] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-21 12:51:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:51:08] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-21 12:51:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:51:08] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7187671636236525307
Running compilation step : cd /tmp/ltsmin7187671636236525307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 108 ms.
Running link step : cd /tmp/ltsmin7187671636236525307;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7187671636236525307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1696992832409370274.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:51:23] [INFO ] Flatten gal took : 4 ms
[2024-05-21 12:51:23] [INFO ] Flatten gal took : 3 ms
[2024-05-21 12:51:23] [INFO ] Time to serialize gal into /tmp/LTL3689872369776609082.gal : 1 ms
[2024-05-21 12:51:23] [INFO ] Time to serialize properties into /tmp/LTL4841019810270746005.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3689872369776609082.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9124653829312527017.hoa' '-atoms' '/tmp/LTL4841019810270746005.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4841019810270746005.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9124653829312527017.hoa
Detected timeout of ITS tools.
[2024-05-21 12:51:38] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:51:38] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:51:38] [INFO ] Time to serialize gal into /tmp/LTL8485055916323753272.gal : 0 ms
[2024-05-21 12:51:38] [INFO ] Time to serialize properties into /tmp/LTL12469309059400477921.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8485055916323753272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12469309059400477921.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(state_5<1))&&((state_6<1)&&(state_7<1))))&&((state...180
Formula 0 simplified : XG!"(((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(state_5<1))&&((state_6<1)&&(state_7<1))))&&((state_8...174
Detected timeout of ITS tools.
[2024-05-21 12:51:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 12:51:53] [INFO ] Applying decomposition
[2024-05-21 12:51:53] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph5789378886693013513.txt' '-o' '/tmp/graph5789378886693013513.bin' '-w' '/tmp/graph5789378886693013513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5789378886693013513.bin' '-l' '-1' '-v' '-w' '/tmp/graph5789378886693013513.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:51:53] [INFO ] Decomposing Gal with order
[2024-05-21 12:51:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:51:53] [INFO ] Flatten gal took : 3 ms
[2024-05-21 12:51:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 12:51:53] [INFO ] Time to serialize gal into /tmp/LTL17592719379493562832.gal : 0 ms
[2024-05-21 12:51:53] [INFO ] Time to serialize properties into /tmp/LTL11285489753641217738.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17592719379493562832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11285489753641217738.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((u0.state_0<1)&&(u0.state_1<1))&&((i1.u1.state_2<1)&&(i1.u1.state_3<1)))&&(((i2.u3.state_4<1)&&(i2.u3.state_5<1))&&((i4.u4...234
Formula 0 simplified : XG!"(((((u0.state_0<1)&&(u0.state_1<1))&&((i1.u1.state_2<1)&&(i1.u1.state_3<1)))&&(((i2.u3.state_4<1)&&(i2.u3.state_5<1))&&((i4.u4.s...228
Detected timeout of ITS tools.
Treatment of property CryptoMiner-COL-D10N000-LTLFireability-13 finished in 77867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:52:08] [INFO ] Invariant cache hit.
[2024-05-21 12:52:08] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 12:52:08] [INFO ] Invariant cache hit.
[2024-05-21 12:52:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:52:08] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-21 12:52:08] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:52:08] [INFO ] Invariant cache hit.
[2024-05-21 12:52:08] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 156 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 158 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 317ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 317ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 391 ms. Remains : 21/21 places, 22/22 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLFireability-15
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D10N000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N000-LTLFireability-15 finished in 471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(F(p0)&&F(p1)))))'
Found a Shortening insensitive property : CryptoMiner-COL-D10N000-LTLFireability-01
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 5 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:52:09] [INFO ] Invariant cache hit.
[2024-05-21 12:52:09] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 12:52:09] [INFO ] Invariant cache hit.
[2024-05-21 12:52:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:52:09] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-21 12:52:09] [INFO ] Invariant cache hit.
[2024-05-21 12:52:09] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 171 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 168 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 348ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 348ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 406 ms. Remains : 21/21 places, 22/22 transitions.
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLFireability-01
Product exploration explored 100000 steps with 7936 reset in 49 ms.
Product exploration explored 100000 steps with 7933 reset in 53 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 169 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 189 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 44 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 8 factoid took 413 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 308 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
[2024-05-21 12:52:11] [INFO ] Invariant cache hit.
[2024-05-21 12:52:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-21 12:52:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:52:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:52:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:52:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-21 12:52:11] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 12:52:11] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:52:11] [INFO ] Invariant cache hit.
[2024-05-21 12:52:11] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 12:52:11] [INFO ] Invariant cache hit.
[2024-05-21 12:52:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:52:11] [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 20 sub problems to find dead transitions.
[2024-05-21 12:52:11] [INFO ] Invariant cache hit.
[2024-05-21 12:52:11] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 177 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 166 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 348ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 348ms
Finished structural reductions in LTL mode , in 1 iterations and 406 ms. Remains : 21/21 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 147 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 181 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 78 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 326 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 189 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
[2024-05-21 12:52:12] [INFO ] Invariant cache hit.
[2024-05-21 12:52:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 12:52:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:52:12] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 12:52:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:52:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-21 12:52:12] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 12:52:12] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7909 reset in 51 ms.
Product exploration explored 100000 steps with 7938 reset in 62 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:52:13] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:52:13] [INFO ] Invariant cache hit.
[2024-05-21 12:52:13] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 172 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 158 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 335ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 343 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin1115557888429936858
[2024-05-21 12:52:13] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1115557888429936858
Running compilation step : cd /tmp/ltsmin1115557888429936858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 108 ms.
Running link step : cd /tmp/ltsmin1115557888429936858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1115557888429936858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6519141170475855287.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:52:28] [INFO ] Invariant cache hit.
[2024-05-21 12:52:29] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 12:52:29] [INFO ] Invariant cache hit.
[2024-05-21 12:52:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:52:29] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-21 12:52:29] [INFO ] Invariant cache hit.
[2024-05-21 12:52:29] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 165 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 168 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 339ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 339ms
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin6970427159455180105
[2024-05-21 12:52:29] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6970427159455180105
Running compilation step : cd /tmp/ltsmin6970427159455180105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 101 ms.
Running link step : cd /tmp/ltsmin6970427159455180105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6970427159455180105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased338595902097359388.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:52:44] [INFO ] Flatten gal took : 3 ms
[2024-05-21 12:52:44] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:52:44] [INFO ] Time to serialize gal into /tmp/LTL2773581556657666592.gal : 1 ms
[2024-05-21 12:52:44] [INFO ] Time to serialize properties into /tmp/LTL8392446895081570794.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2773581556657666592.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3968997465144684296.hoa' '-atoms' '/tmp/LTL8392446895081570794.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8392446895081570794.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3968997465144684296.hoa
Detected timeout of ITS tools.
[2024-05-21 12:52:59] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:52:59] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:52:59] [INFO ] Time to serialize gal into /tmp/LTL15260004097146575257.gal : 1 ms
[2024-05-21 12:52:59] [INFO ] Time to serialize properties into /tmp/LTL15574086818168186657.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15260004097146575257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15574086818168186657.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(state_10>=1)")))||((F("(state_10>=1)"))&&(F("(((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(s...246
Formula 0 simplified : X(FG!"(state_10>=1)" & (G!"(state_10>=1)" | G!"(((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(state_5<1...234
Detected timeout of ITS tools.
[2024-05-21 12:53:14] [INFO ] Flatten gal took : 3 ms
[2024-05-21 12:53:14] [INFO ] Applying decomposition
[2024-05-21 12:53:14] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3236151671664205713.txt' '-o' '/tmp/graph3236151671664205713.bin' '-w' '/tmp/graph3236151671664205713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3236151671664205713.bin' '-l' '-1' '-v' '-w' '/tmp/graph3236151671664205713.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:53:14] [INFO ] Decomposing Gal with order
[2024-05-21 12:53:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:53:14] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:53:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 12:53:14] [INFO ] Time to serialize gal into /tmp/LTL14697548216287857677.gal : 1 ms
[2024-05-21 12:53:14] [INFO ] Time to serialize properties into /tmp/LTL15063054176902309989.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14697548216287857677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15063054176902309989.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(i2.u4.state_10>=1)")))||((F("(i2.u4.state_10>=1)"))&&(F("(((((i0.u0.state_0<1)&&(i0.u0.state_1<1))&&((i0.u1.state_2<1)&&(i...324
Formula 0 simplified : X(FG!"(i2.u4.state_10>=1)" & (G!"(i2.u4.state_10>=1)" | G!"(((((i0.u0.state_0<1)&&(i0.u0.state_1<1))&&((i0.u1.state_2<1)&&(i0.u1.sta...312
Detected timeout of ITS tools.
Treatment of property CryptoMiner-COL-D10N000-LTLFireability-01 finished in 80468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||F((p1&&F(!p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(F(!p1))&&p0))||X(X(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0||G(!p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Found a Shortening insensitive property : CryptoMiner-COL-D10N000-LTLFireability-13
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:53:30] [INFO ] Invariant cache hit.
[2024-05-21 12:53:30] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 12:53:30] [INFO ] Invariant cache hit.
[2024-05-21 12:53:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:53:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-21 12:53:30] [INFO ] Invariant cache hit.
[2024-05-21 12:53:30] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 173 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 174 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 352ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 352ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 411 ms. Remains : 21/21 places, 22/22 transitions.
Running random walk in product with property : CryptoMiner-COL-D10N000-LTLFireability-13
Product exploration explored 100000 steps with 7933 reset in 48 ms.
Product exploration explored 100000 steps with 7927 reset in 51 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
RANDOM walk for 41 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
[2024-05-21 12:53:31] [INFO ] Invariant cache hit.
[2024-05-21 12:53:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 12:53:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:53:31] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-21 12:53:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:53:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-21 12:53:31] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:53:31] [INFO ] Added : 12 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG p0
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:53:31] [INFO ] Invariant cache hit.
[2024-05-21 12:53:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 12:53:31] [INFO ] Invariant cache hit.
[2024-05-21 12:53:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:53:31] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-21 12:53:31] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:53:31] [INFO ] Invariant cache hit.
[2024-05-21 12:53:31] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 175 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 173 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 353ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 353ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 415 ms. Remains : 21/21 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/21 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[p0, p0]
RANDOM walk for 42 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
[2024-05-21 12:53:32] [INFO ] Invariant cache hit.
[2024-05-21 12:53:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:53:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:53:32] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 12:53:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:53:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-21 12:53:32] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:53:32] [INFO ] Added : 12 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 53 ms :[p0, p0]
Product exploration explored 100000 steps with 7907 reset in 49 ms.
Product exploration explored 100000 steps with 7976 reset in 51 ms.
Built C files in :
/tmp/ltsmin10869064167166022593
[2024-05-21 12:53:32] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-21 12:53:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:53:32] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-21 12:53:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:53:32] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-21 12:53:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:53:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10869064167166022593
Running compilation step : cd /tmp/ltsmin10869064167166022593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 104 ms.
Running link step : cd /tmp/ltsmin10869064167166022593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10869064167166022593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10369755138380711610.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-21 12:53:47] [INFO ] Invariant cache hit.
[2024-05-21 12:53:47] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 12:53:47] [INFO ] Invariant cache hit.
[2024-05-21 12:53:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 12:53:47] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-21 12:53:47] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 12:53:47] [INFO ] Invariant cache hit.
[2024-05-21 12:53:47] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 157 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/42 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 173 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 334ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 334ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 416 ms. Remains : 21/21 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin12448992489267572581
[2024-05-21 12:53:47] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-21 12:53:47] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:53:47] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-21 12:53:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:53:47] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-21 12:53:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:53:47] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12448992489267572581
Running compilation step : cd /tmp/ltsmin12448992489267572581;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 103 ms.
Running link step : cd /tmp/ltsmin12448992489267572581;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12448992489267572581;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12249542947772597166.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:54:02] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:54:02] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:54:02] [INFO ] Time to serialize gal into /tmp/LTL2825904240818863301.gal : 1 ms
[2024-05-21 12:54:02] [INFO ] Time to serialize properties into /tmp/LTL15029681734599858723.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2825904240818863301.gal' '-t' 'CGAL' '-hoa' '/tmp/aut189256247784989373.hoa' '-atoms' '/tmp/LTL15029681734599858723.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL15029681734599858723.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut189256247784989373.hoa
Detected timeout of ITS tools.
[2024-05-21 12:54:18] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:54:18] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:54:18] [INFO ] Time to serialize gal into /tmp/LTL13257641364574274551.gal : 1 ms
[2024-05-21 12:54:18] [INFO ] Time to serialize properties into /tmp/LTL6009721008336445221.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13257641364574274551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6009721008336445221.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(state_5<1))&&((state_6<1)&&(state_7<1))))&&((state...180
Formula 0 simplified : XG!"(((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(state_5<1))&&((state_6<1)&&(state_7<1))))&&((state_8...174
Detected timeout of ITS tools.
[2024-05-21 12:54:33] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:54:33] [INFO ] Applying decomposition
[2024-05-21 12:54:33] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph8397089490581891537.txt' '-o' '/tmp/graph8397089490581891537.bin' '-w' '/tmp/graph8397089490581891537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8397089490581891537.bin' '-l' '-1' '-v' '-w' '/tmp/graph8397089490581891537.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:54:33] [INFO ] Decomposing Gal with order
[2024-05-21 12:54:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:54:33] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:54:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 12:54:33] [INFO ] Time to serialize gal into /tmp/LTL12194373043807056443.gal : 1 ms
[2024-05-21 12:54:33] [INFO ] Time to serialize properties into /tmp/LTL11312153784928238334.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12194373043807056443.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11312153784928238334.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((i1.u0.state_0<1)&&(i1.u1.state_1<1))&&((i1.u1.state_2<1)&&(i2.u2.state_3<1)))&&(((i2.u2.state_4<1)&&(i2.u3.state_5<1))&&(...240
Formula 0 simplified : XG!"(((((i1.u0.state_0<1)&&(i1.u1.state_1<1))&&((i1.u1.state_2<1)&&(i2.u2.state_3<1)))&&(((i2.u2.state_4<1)&&(i2.u3.state_5<1))&&((i...234
Detected timeout of ITS tools.
Treatment of property CryptoMiner-COL-D10N000-LTLFireability-13 finished in 78082 ms.
[2024-05-21 12:54:48] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14021217053608146352
[2024-05-21 12:54:48] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-21 12:54:48] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:54:48] [INFO ] Applying decomposition
[2024-05-21 12:54:48] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-21 12:54:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:54:48] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-21 12:54:48] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:54:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:54:48] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14021217053608146352
Running compilation step : cd /tmp/ltsmin14021217053608146352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12693132064860296725.txt' '-o' '/tmp/graph12693132064860296725.bin' '-w' '/tmp/graph12693132064860296725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12693132064860296725.bin' '-l' '-1' '-v' '-w' '/tmp/graph12693132064860296725.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:54:48] [INFO ] Decomposing Gal with order
[2024-05-21 12:54:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:54:48] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:54:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 12:54:48] [INFO ] Time to serialize gal into /tmp/LTLFireability18283926493860623797.gal : 0 ms
[2024-05-21 12:54:48] [INFO ] Time to serialize properties into /tmp/LTLFireability8150232134380408716.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18283926493860623797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8150232134380408716.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 6 LTL properties
Checking formula 0 : !((X((G(F("(i1.u5.state_10>=1)")))||((F("(i1.u5.state_10>=1)"))&&(F("(((((i0.u0.state_0<1)&&(i0.u1.state_1<1))&&((i0.u1.state_2<1)&&(i...324
Formula 0 simplified : X(FG!"(i1.u5.state_10>=1)" & (G!"(i1.u5.state_10>=1)" | G!"(((((i0.u0.state_0<1)&&(i0.u1.state_1<1))&&((i0.u1.state_2<1)&&(i2.u2.sta...312
Compilation finished in 108 ms.
Running link step : cd /tmp/ltsmin14021217053608146352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin14021217053608146352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin14021217053608146352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14021217053608146352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](!(LTLAPp2==true))||<>(((LTLAPp3==true)&&<>(!(LTLAPp3==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: LTL layer: formula: ([](!(LTLAPp2==true))||<>(((LTLAPp3==true)&&<>(!(LTLAPp3==true)))))
pins2lts-mc-linux64( 3/ 8), 0.004: "([](!(LTLAPp2==true))||<>(((LTLAPp3==true)&&<>(!(LTLAPp3==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
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.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Initializing POR dependencies: labels 27, guards 22
pins2lts-mc-linux64( 0/ 8), 0.021: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.099: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.108: There are 29 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.108: State length is 22, there are 31 groups
pins2lts-mc-linux64( 0/ 8), 0.108: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.108: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.108: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.108: Visible groups: 0 / 31, labels: 2 / 29
pins2lts-mc-linux64( 0/ 8), 0.108: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.108: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.133: [Blue] ~69 levels ~960 states ~1400 transitions
pins2lts-mc-linux64( 3/ 8), 0.142: [Blue] ~135 levels ~1920 states ~2896 transitions
pins2lts-mc-linux64( 3/ 8), 0.156: [Blue] ~143 levels ~3840 states ~4808 transitions
pins2lts-mc-linux64( 0/ 8), 0.178: [Blue] ~87 levels ~7680 states ~8112 transitions
pins2lts-mc-linux64( 0/ 8), 0.225: [Blue] ~96 levels ~15360 states ~15848 transitions
pins2lts-mc-linux64( 1/ 8), 0.327: [Blue] ~436 levels ~30720 states ~33952 transitions
pins2lts-mc-linux64( 7/ 8), 0.505: [Blue] ~64 levels ~61440 states ~63248 transitions
pins2lts-mc-linux64( 4/ 8), 0.767: [Blue] ~72 levels ~122880 states ~126128 transitions
pins2lts-mc-linux64( 7/ 8), 1.174: [Blue] ~81 levels ~245760 states ~250576 transitions
pins2lts-mc-linux64( 4/ 8), 1.679: [Blue] ~85 levels ~491520 states ~500112 transitions
pins2lts-mc-linux64( 6/ 8), 2.277: [Blue] ~312 levels ~983040 states ~985136 transitions
pins2lts-mc-linux64( 5/ 8), 3.102: [Blue] ~103 levels ~1966080 states ~1977632 transitions
pins2lts-mc-linux64( 3/ 8), 4.626: [Blue] ~229 levels ~3932160 states ~3933416 transitions
pins2lts-mc-linux64( 3/ 8), 7.568: [Blue] ~238 levels ~7864320 states ~7865440 transitions
pins2lts-mc-linux64( 6/ 8), 13.834: [Blue] ~357 levels ~15728640 states ~15730776 transitions
pins2lts-mc-linux64( 4/ 8), 24.656: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 24.683:
pins2lts-mc-linux64( 0/ 8), 24.683: Explored 25577999 states 27900440 transitions, fanout: 1.091
pins2lts-mc-linux64( 0/ 8), 24.683: Total exploration time 24.540 sec (24.510 sec minimum, 24.529 sec on average)
pins2lts-mc-linux64( 0/ 8), 24.683: States per second: 1042298, Transitions per second: 1136937
pins2lts-mc-linux64( 0/ 8), 24.683:
pins2lts-mc-linux64( 0/ 8), 24.683: State space has 27819879 states, 23238979 are accepting
pins2lts-mc-linux64( 0/ 8), 24.683: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 24.683: blue states: 25577999 (91.94%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 24.683: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 24.683: all-red states: 23238995 (83.53%), bogus 47549 (0.17%)
pins2lts-mc-linux64( 0/ 8), 24.683:
pins2lts-mc-linux64( 0/ 8), 24.683: Total memory used for local state coloring: 35.0MB
pins2lts-mc-linux64( 0/ 8), 24.683:
pins2lts-mc-linux64( 0/ 8), 24.683: Queue width: 8B, total height: 2291955, memory: 17.49MB
pins2lts-mc-linux64( 0/ 8), 24.683: Tree memory: 468.2MB, 17.6 B/state, compr.: 19.6%
pins2lts-mc-linux64( 0/ 8), 24.683: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 24.683: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 24.683: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 24.683: Est. total memory use: 485.7MB (~1041.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14021217053608146352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](!(LTLAPp2==true))||<>(((LTLAPp3==true)&&<>(!(LTLAPp3==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14021217053608146352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](!(LTLAPp2==true))||<>(((LTLAPp3==true)&&<>(!(LTLAPp3==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:840)
Detected timeout of ITS tools.
[2024-05-21 13:18:23] [INFO ] Applying decomposition
[2024-05-21 13:18:23] [INFO ] Flatten gal took : 2 ms
[2024-05-21 13:18:23] [INFO ] Decomposing Gal with order
[2024-05-21 13:18:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:18:23] [INFO ] Flatten gal took : 2 ms
[2024-05-21 13:18:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 13:18:23] [INFO ] Time to serialize gal into /tmp/LTLFireability113756845705926670.gal : 1 ms
[2024-05-21 13:18:23] [INFO ] Time to serialize properties into /tmp/LTLFireability8847168555127146316.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability113756845705926670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8847168555127146316.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 6 LTL properties
Checking formula 0 : !((X((G(F("(CD10.state_10>=1)")))||((F("(CD10.state_10>=1)"))&&(F("(((((CD0.state_0<1)&&(CD1.state_1<1))&&((CD2.state_2<1)&&(CD3.state...300
Formula 0 simplified : X(FG!"(CD10.state_10>=1)" & (G!"(CD10.state_10>=1)" | G!"(((((CD0.state_0<1)&&(CD1.state_1<1))&&((CD2.state_2<1)&&(CD3.state_3<1)))&...288
Detected timeout of ITS tools.
[2024-05-21 13:41:59] [INFO ] Flatten gal took : 5 ms
[2024-05-21 13:41:59] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-21 13:41:59] [INFO ] Transformed 21 places.
[2024-05-21 13:41:59] [INFO ] Transformed 22 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
[2024-05-21 13:41:59] [INFO ] Time to serialize gal into /tmp/LTLFireability12111366955505432182.gal : 0 ms
[2024-05-21 13:41:59] [INFO ] Time to serialize properties into /tmp/LTLFireability16765535591585289815.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12111366955505432182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16765535591585289815.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 6 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G(F("(state_10>=1)")))||((F("(state_10>=1)"))&&(F("(((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(s...246
Formula 0 simplified : X(FG!"(state_10>=1)" & (G!"(state_10>=1)" | G!"(((((state_0<1)&&(state_1<1))&&((state_2<1)&&(state_3<1)))&&(((state_4<1)&&(state_5<1...234
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-D10N000"
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-5568"
echo " Executing tool itstools"
echo " Input is CryptoMiner-COL-D10N000, 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 r092-tall-171624189100340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-COL-D10N000.tgz
mv CryptoMiner-COL-D10N000 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;