About the Execution of ITS-Tools for QuasiCertifProtocol-COL-28
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.487 | 3454599.00 | 4412675.00 | 9333.90 | TFTFF?TTFFTFTT?F | 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.r312-tall-171662337700044.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 QuasiCertifProtocol-COL-28, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337700044
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.5K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 03:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 120K May 18 16:43 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 QuasiCertifProtocol-COL-28-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716660707210
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-28
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-25 18:11:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 18:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 18:11:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 18:11:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 18:11:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 585 ms
[2024-05-25 18:11:49] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 18:11:49] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-05-25 18:11:49] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 40019 steps (1006 resets) in 634 ms. (63 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40003 steps (277 resets) in 293 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (278 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 18:11:49] [INFO ] Computed 5 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/43 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/55 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/56 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 2 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/43 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/55 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/56 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 37 constraints, problems are : Problem set: 0 solved, 2 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 65 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 7 ms.
[2024-05-25 18:11:50] [INFO ] Flatten gal took : 19 ms
[2024-05-25 18:11:50] [INFO ] Flatten gal took : 4 ms
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2024-05-25 18:11:50] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 35 ms.
[2024-05-25 18:11:50] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Support contains 2820 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 30 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 18:11:50] [INFO ] Computed 2492 invariants in 172 ms
[2024-05-25 18:11:51] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2024-05-25 18:11:51] [INFO ] Invariant cache hit.
[2024-05-25 18:11:53] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 2684 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:11:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3382 variables, and 2492 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3381 variables, 2935/5427 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3381 variables, 416/5843 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3381/3382 variables, and 5843 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2935/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60905ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60916ms
Starting structural reductions in LTL mode, iteration 1 : 2936/2998 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63645 ms. Remains : 2936/2998 places, 446/446 transitions.
Support contains 2820 out of 2936 places after structural reductions.
[2024-05-25 18:12:54] [INFO ] Flatten gal took : 285 ms
[2024-05-25 18:12:54] [INFO ] Flatten gal took : 156 ms
[2024-05-25 18:12:55] [INFO ] Input system was already deterministic with 446 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (1206 resets) in 2155 ms. (18 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 471 ms. (8 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 158 ms. (25 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 250 ms. (15 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
[2024-05-25 18:12:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2790 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2790 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 87/2877 variables, 84/2492 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2877 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 17 unsolved
SMT process timed out in 5817ms, After SMT, problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2790 out of 2936 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 50 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 2936/2936 places, 446/446 transitions.
RANDOM walk for 40000 steps (1211 resets) in 1264 ms. (31 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 199 ms. (20 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
Finished probabilistic random walk after 110679 steps, run visited all 17 properties in 742 ms. (steps per millisecond=149 )
Probabilistic random walk after 110679 steps, saw 30163 distinct states, run finished after 746 ms. (steps per millisecond=148 ) properties seen :17
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2936 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2936 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 30 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 261 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:13:04] [INFO ] Invariant cache hit.
[2024-05-25 18:13:08] [INFO ] Implicit Places using invariants in 3796 ms returned []
[2024-05-25 18:13:08] [INFO ] Invariant cache hit.
[2024-05-25 18:13:15] [INFO ] Implicit Places using invariants and state equation in 6687 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10492 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 190 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10944 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 718 ms.
Product exploration explored 100000 steps with 50000 reset in 687 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-00 finished in 13213 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(X((G(F(p0))||G(p1)))))'
Support contains 1740 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 60 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:13:17] [INFO ] Invariant cache hit.
[2024-05-25 18:13:19] [INFO ] Implicit Places using invariants in 1798 ms returned []
[2024-05-25 18:13:19] [INFO ] Invariant cache hit.
[2024-05-25 18:13:26] [INFO ] Implicit Places using invariants and state equation in 7239 ms returned []
Implicit Place search using SMT with State Equation took 9040 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:13:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3382 variables, and 2492 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3381 variables, 2935/5427 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3381 variables, 416/5843 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3381/3382 variables, and 5843 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2935/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60676ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60682ms
Finished structural reductions in LTL mode , in 1 iterations and 69787 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-01
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-01 finished in 70041 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)||F(p1)))'
Support contains 2 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 156 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:14:27] [INFO ] Invariant cache hit.
[2024-05-25 18:14:31] [INFO ] Implicit Places using invariants in 4219 ms returned []
[2024-05-25 18:14:31] [INFO ] Invariant cache hit.
[2024-05-25 18:14:43] [INFO ] Implicit Places using invariants and state equation in 11573 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 15807 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 199 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16163 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-02
Product exploration explored 100000 steps with 7449 reset in 398 ms.
Product exploration explored 100000 steps with 7359 reset in 312 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 51 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 4 factoid took 250 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 59 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 446 rows 2907 cols
[2024-05-25 18:14:46] [INFO ] Computed 2464 invariants in 442 ms
[2024-05-25 18:14:53] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 6156 ms returned sat
[2024-05-25 18:15:01] [INFO ] [Real]Absence check using state equation in 7979 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2907 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 179 are kept as prefixes of interest. Removing 2728 places using SCC suffix rule.32 ms
Discarding 2728 places :
Also discarding 178 output transitions
Drop transitions (Output transitions of discarded places.) removed 178 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 179 transition count 124
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 179 transition count 124
Applied a total of 146 rules in 68 ms. Remains 179 /2907 variables (removed 2728) and now considering 124/446 (removed 322) transitions.
// Phase 1: matrix 124 rows 179 cols
[2024-05-25 18:15:01] [INFO ] Computed 56 invariants in 0 ms
[2024-05-25 18:15:01] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-25 18:15:01] [INFO ] Invariant cache hit.
[2024-05-25 18:15:01] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-25 18:15:01] [INFO ] Redundant transitions in 15 ms returned []
Running 93 sub problems to find dead transitions.
[2024-05-25 18:15:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 124/302 variables, 178/234 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 1/303 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/303 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 235 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3271 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 124/302 variables, 178/234 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 93/327 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/303 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 328 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3388 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
After SMT, in 6704ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 6711ms
Starting structural reductions in SI_LTL mode, iteration 1 : 179/2907 places, 124/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7154 ms. Remains : 179/2907 places, 124/446 transitions.
Computed a total of 179 stabilizing places and 124 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 179 transition count 124
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 168 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 78 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 55 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
[2024-05-25 18:15:08] [INFO ] Invariant cache hit.
[2024-05-25 18:15:09] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 8 ms returned sat
[2024-05-25 18:15:09] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-25 18:15:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:15:09] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 8 ms returned sat
[2024-05-25 18:15:09] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-25 18:15:09] [INFO ] Computed and/alt/rep : 90/119/90 causal constraints (skipped 3 transitions) in 13 ms.
[2024-05-25 18:15:09] [INFO ] Added : 0 causal constraints over 0 iterations in 44 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7316 reset in 222 ms.
Product exploration explored 100000 steps with 7342 reset in 280 ms.
Built C files in :
/tmp/ltsmin12048687957572329803
[2024-05-25 18:15:09] [INFO ] Computing symmetric may disable matrix : 124 transitions.
[2024-05-25 18:15:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:15:09] [INFO ] Computing symmetric may enable matrix : 124 transitions.
[2024-05-25 18:15:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:15:09] [INFO ] Computing Do-Not-Accords matrix : 124 transitions.
[2024-05-25 18:15:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:15:09] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12048687957572329803
Running compilation step : cd /tmp/ltsmin12048687957572329803;'/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 546 ms.
Running link step : cd /tmp/ltsmin12048687957572329803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12048687957572329803;'/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/stateBased2227565563027409170.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 124/124 transitions.
Graph (complete) has 264 edges and 179 vertex of which 90 are kept as prefixes of interest. Removing 89 places using SCC suffix rule.1 ms
Discarding 89 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 90 transition count 62
Applied a total of 31 rules in 4 ms. Remains 90 /179 variables (removed 89) and now considering 62/124 (removed 62) transitions.
// Phase 1: matrix 62 rows 90 cols
[2024-05-25 18:15:25] [INFO ] Computed 28 invariants in 1 ms
[2024-05-25 18:15:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-25 18:15:25] [INFO ] Invariant cache hit.
[2024-05-25 18:15:25] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-25 18:15:25] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-25 18:15:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 61/149 variables, 88/116 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 3/152 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 118 constraints, problems are : Problem set: 0 solved, 31 unsolved in 493 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 61/149 variables, 88/116 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 31/147 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 3/152 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 149 constraints, problems are : Problem set: 0 solved, 31 unsolved in 556 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 1055ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 1056ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/179 places, 62/124 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1213 ms. Remains : 90/179 places, 62/124 transitions.
Built C files in :
/tmp/ltsmin7135826876478319408
[2024-05-25 18:15:26] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2024-05-25 18:15:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:15:26] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2024-05-25 18:15:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:15:26] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2024-05-25 18:15:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:15:26] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7135826876478319408
Running compilation step : cd /tmp/ltsmin7135826876478319408;'/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 188 ms.
Running link step : cd /tmp/ltsmin7135826876478319408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7135826876478319408;'/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/stateBased14866188008324724795.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 18:15:41] [INFO ] Flatten gal took : 4 ms
[2024-05-25 18:15:41] [INFO ] Flatten gal took : 3 ms
[2024-05-25 18:15:41] [INFO ] Time to serialize gal into /tmp/LTL2031251887618270076.gal : 2 ms
[2024-05-25 18:15:41] [INFO ] Time to serialize properties into /tmp/LTL4198875558774699126.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/LTL2031251887618270076.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9572586716557727929.hoa' '-atoms' '/tmp/LTL4198875558774699126.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/LTL4198875558774699126.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9572586716557727929.hoa
Detected timeout of ITS tools.
[2024-05-25 18:15:56] [INFO ] Flatten gal took : 7 ms
[2024-05-25 18:15:56] [INFO ] Flatten gal took : 6 ms
[2024-05-25 18:15:56] [INFO ] Time to serialize gal into /tmp/LTL9714902689220756381.gal : 2 ms
[2024-05-25 18:15:56] [INFO ] Time to serialize properties into /tmp/LTL7036054888750147715.ltl : 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/LTL9714902689220756381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7036054888750147715.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...275
Read 1 LTL properties
Checking formula 0 : !(((X("(a3>=1)"))||(F("(a1>=1)"))))
Formula 0 simplified : X!"(a3>=1)" & G!"(a1>=1)"
Detected timeout of ITS tools.
[2024-05-25 18:16:11] [INFO ] Flatten gal took : 5 ms
[2024-05-25 18:16:11] [INFO ] Applying decomposition
[2024-05-25 18:16:11] [INFO ] Flatten gal took : 5 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/graph10463513946153835724.txt' '-o' '/tmp/graph10463513946153835724.bin' '-w' '/tmp/graph10463513946153835724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10463513946153835724.bin' '-l' '-1' '-v' '-w' '/tmp/graph10463513946153835724.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:16:11] [INFO ] Decomposing Gal with order
[2024-05-25 18:16:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:16:11] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-25 18:16:11] [INFO ] Flatten gal took : 26 ms
[2024-05-25 18:16:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 10 ms.
[2024-05-25 18:16:11] [INFO ] Time to serialize gal into /tmp/LTL14401670711257785876.gal : 4 ms
[2024-05-25 18:16:11] [INFO ] Time to serialize properties into /tmp/LTL12818154443073922622.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/LTL14401670711257785876.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12818154443073922622.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("(i2.u59.a3>=1)"))||(F("(i2.u60.a1>=1)"))))
Formula 0 simplified : X!"(i2.u59.a3>=1)" & G!"(i2.u60.a1>=1)"
Reverse transition relation is NOT exact ! Due to transitions t146, t151, t155, t156, t164, t170, t174, t176, t177, t178, t179, t181, t182, t183, t186, t18...386
Computing Next relation with stutter on 9.12686e+12 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
63 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.665234,58596,1,0,137994,207,1874,70105,126,761,211744
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-02 finished in 105264 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 p1)))'
Support contains 871 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 79 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 18:16:12] [INFO ] Computed 2492 invariants in 87 ms
[2024-05-25 18:16:16] [INFO ] Implicit Places using invariants in 3499 ms returned []
[2024-05-25 18:16:16] [INFO ] Invariant cache hit.
[2024-05-25 18:16:26] [INFO ] Implicit Places using invariants and state equation in 10540 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 14049 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 81 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14209 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-03 finished in 14336 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((X(G(p0))&&(p1||G(F(p2))))))'
Support contains 1741 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 30 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:16:27] [INFO ] Invariant cache hit.
[2024-05-25 18:16:29] [INFO ] Implicit Places using invariants in 2641 ms returned []
[2024-05-25 18:16:29] [INFO ] Invariant cache hit.
[2024-05-25 18:16:39] [INFO ] Implicit Places using invariants and state equation in 9512 ms returned []
Implicit Place search using SMT with State Equation took 12155 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:16:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3382 variables, and 2492 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3381 variables, 2935/5427 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3381 variables, 416/5843 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3381/3382 variables, and 5843 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2935/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60729ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60735ms
Finished structural reductions in LTL mode , in 1 iterations and 72922 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-04
Stuttering criterion allowed to conclude after 697 steps with 20 reset in 9 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-04 finished in 73155 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||X((p1 U G(!p1))))))'
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 151 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:17:40] [INFO ] Invariant cache hit.
[2024-05-25 18:17:44] [INFO ] Implicit Places using invariants in 4054 ms returned []
[2024-05-25 18:17:44] [INFO ] Invariant cache hit.
[2024-05-25 18:17:51] [INFO ] Implicit Places using invariants and state equation in 6869 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10954 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 146 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11251 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, p1, (AND p1 (NOT p0)), p1]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-05
Product exploration explored 100000 steps with 3028 reset in 544 ms.
Product exploration explored 100000 steps with 3030 reset in 462 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 127 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, p1, (AND p1 (NOT p0)), p1]
RANDOM walk for 40000 steps (1210 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (58 resets) in 573 ms. (69 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (46 resets) in 448 ms. (89 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7296 steps, run visited all 2 properties in 92 ms. (steps per millisecond=79 )
Probabilistic random walk after 7296 steps, saw 7147 distinct states, run finished after 93 ms. (steps per millisecond=78 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 210 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 104 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 155 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-25 18:17:54] [INFO ] Computed 2464 invariants in 248 ms
[2024-05-25 18:17:58] [INFO ] Implicit Places using invariants in 4407 ms returned []
[2024-05-25 18:17:58] [INFO ] Invariant cache hit.
[2024-05-25 18:18:05] [INFO ] Implicit Places using invariants and state equation in 6840 ms returned []
Implicit Place search using SMT with State Equation took 11249 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:18:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2906 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3352 variables, 2906/5370 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3352 variables, 416/5786 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3352/3353 variables, and 5786 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2906/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60724ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60731ms
Finished structural reductions in LTL mode , in 1 iterations and 72140 ms. Remains : 2907/2907 places, 446/446 transitions.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, p1, (AND p1 (NOT p0)), p1]
RANDOM walk for 40000 steps (1204 resets) in 819 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (61 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (47 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7296 steps, run visited all 2 properties in 78 ms. (steps per millisecond=93 )
Probabilistic random walk after 7296 steps, saw 7147 distinct states, run finished after 79 ms. (steps per millisecond=92 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 175 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 132 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 132 ms :[true, p1, (AND p1 (NOT p0)), p1]
Product exploration explored 100000 steps with 3027 reset in 447 ms.
Product exploration explored 100000 steps with 3029 reset in 459 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 126 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2877 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.19 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2877 transition count 446
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 455 ms. Remains 2877 /2907 variables (removed 30) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:19:10] [INFO ] Redundant transitions in 48 ms returned []
Running 416 sub problems to find dead transitions.
// Phase 1: matrix 446 rows 2877 cols
[2024-05-25 18:19:10] [INFO ] Computed 2436 invariants in 248 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2876 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2876/3323 variables, and 2436 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 0/2877 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2876 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2876 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 2 (OVERLAPS) 446/3322 variables, 2876/5312 constraints. Problems are: Problem set: 4 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3322 variables, 412/5724 constraints. Problems are: Problem set: 4 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3322/3323 variables, and 5724 constraints, problems are : Problem set: 4 solved, 412 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2876/2877 constraints, PredecessorRefiner: 412/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60901ms problems are : Problem set: 4 solved, 412 unsolved
Search for dead transitions found 4 dead transitions in 60906ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 2877/2907 places, 442/446 transitions.
Graph (complete) has 29901 edges and 2877 vertex of which 2875 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 181 ms. Remains 2875 /2877 variables (removed 2) and now considering 442/442 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 2875/2907 places, 442/446 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61596 ms. Remains : 2875/2907 places, 442/446 transitions.
Built C files in :
/tmp/ltsmin4221259489834421150
[2024-05-25 18:20:11] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4221259489834421150
Running compilation step : cd /tmp/ltsmin4221259489834421150;'/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 2455 ms.
Running link step : cd /tmp/ltsmin4221259489834421150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4221259489834421150;'/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/stateBased12115912592596365123.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 59 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 162 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-25 18:20:26] [INFO ] Computed 2464 invariants in 273 ms
[2024-05-25 18:20:30] [INFO ] Implicit Places using invariants in 4513 ms returned []
[2024-05-25 18:20:30] [INFO ] Invariant cache hit.
[2024-05-25 18:20:37] [INFO ] Implicit Places using invariants and state equation in 7026 ms returned []
Implicit Place search using SMT with State Equation took 11541 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:20:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2906 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3352 variables, 2906/5370 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3352 variables, 416/5786 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3352/3353 variables, and 5786 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2906/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60670ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60676ms
Finished structural reductions in LTL mode , in 1 iterations and 72381 ms. Remains : 2907/2907 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin5260344610923116741
[2024-05-25 18:21:38] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5260344610923116741
Running compilation step : cd /tmp/ltsmin5260344610923116741;'/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 2229 ms.
Running link step : cd /tmp/ltsmin5260344610923116741;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5260344610923116741;'/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/stateBased5529193040476084818.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 18:21:53] [INFO ] Flatten gal took : 63 ms
[2024-05-25 18:21:53] [INFO ] Flatten gal took : 63 ms
[2024-05-25 18:21:53] [INFO ] Time to serialize gal into /tmp/LTL9536581910748724737.gal : 14 ms
[2024-05-25 18:21:53] [INFO ] Time to serialize properties into /tmp/LTL14514859602855085024.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/LTL9536581910748724737.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18354307298035563334.hoa' '-atoms' '/tmp/LTL14514859602855085024.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/LTL14514859602855085024.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18354307298035563334.hoa
Detected timeout of ITS tools.
[2024-05-25 18:22:09] [INFO ] Flatten gal took : 64 ms
[2024-05-25 18:22:09] [INFO ] Flatten gal took : 63 ms
[2024-05-25 18:22:09] [INFO ] Time to serialize gal into /tmp/LTL5003232782746681675.gal : 10 ms
[2024-05-25 18:22:09] [INFO ] Time to serialize properties into /tmp/LTL13664385007184236222.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/LTL5003232782746681675.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13664385007184236222.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((X(("(((((((malicious_reservoir>=1)&&(s3_28>=1))||((malicious_reservoir>=1)&&(s3_27>=1)))||(((malicious_reservoir>=1)&&(s3_25>=1)...2826
Formula 0 simplified : F(!"((((((s6_19<1)&&(s6_18<1))&&((s6_17<1)&&(s6_16<1)))&&(((s6_23<1)&&(s6_22<1))&&((s6_21<1)&&(s6_20<1))))&&((((s6_11<1)&&(s6_10<1))...2815
Detected timeout of ITS tools.
[2024-05-25 18:22:24] [INFO ] Flatten gal took : 62 ms
[2024-05-25 18:22:24] [INFO ] Applying decomposition
[2024-05-25 18:22:24] [INFO ] Flatten gal took : 78 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/graph4974660861195282269.txt' '-o' '/tmp/graph4974660861195282269.bin' '-w' '/tmp/graph4974660861195282269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4974660861195282269.bin' '-l' '-1' '-v' '-w' '/tmp/graph4974660861195282269.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:22:24] [INFO ] Decomposing Gal with order
[2024-05-25 18:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:22:25] [INFO ] Removed a total of 289 redundant transitions.
[2024-05-25 18:22:25] [INFO ] Flatten gal took : 237 ms
[2024-05-25 18:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 121 ms.
[2024-05-25 18:22:25] [INFO ] Time to serialize gal into /tmp/LTL3852770406812805042.gal : 25 ms
[2024-05-25 18:22:25] [INFO ] Time to serialize properties into /tmp/LTL16487226299433367782.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/LTL3852770406812805042.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16487226299433367782.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...255
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((((((u0.malicious_reservoir>=1)&&(i28.i1.u116.s3_28>=1))||((u0.malicious_reservoir>=1)&&(i27.i1.u17.s3_27>=1)))||(((u0.mal...3721
Formula 0 simplified : F(!"((((((u159.s6_19<1)&&(u158.s6_18<1))&&((u157.s6_17<1)&&(u156.s6_16<1)))&&(((u163.s6_23<1)&&(u162.s6_22<1))&&((u161.s6_21<1)&&(u1...3710
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-05 finished in 300120 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 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 179 are kept as prefixes of interest. Removing 2757 places using SCC suffix rule.10 ms
Discarding 2757 places :
Also discarding 178 output transitions
Drop transitions (Output transitions of discarded places.) removed 178 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 178 transition count 123
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 178 transition count 123
Applied a total of 146 rules in 21 ms. Remains 178 /2936 variables (removed 2758) and now considering 123/446 (removed 323) transitions.
// Phase 1: matrix 123 rows 178 cols
[2024-05-25 18:22:40] [INFO ] Computed 56 invariants in 1 ms
[2024-05-25 18:22:40] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-25 18:22:40] [INFO ] Invariant cache hit.
[2024-05-25 18:22:40] [INFO ] Implicit Places using invariants and state equation in 156 ms returned [88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 266 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/2936 places, 123/446 transitions.
Applied a total of 0 rules in 2 ms. Remains 149 /149 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 289 ms. Remains : 149/2936 places, 123/446 transitions.
Stuttering acceptance computed with spot in 34 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-06
Product exploration explored 100000 steps with 2787 reset in 306 ms.
Product exploration explored 100000 steps with 2790 reset in 331 ms.
Computed a total of 149 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 149 transition count 123
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-06 finished in 1118 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))||G((!p0||X(G(p1))))))'
Support contains 31 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 161 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 18:22:41] [INFO ] Computed 2492 invariants in 56 ms
[2024-05-25 18:22:46] [INFO ] Implicit Places using invariants in 4457 ms returned []
[2024-05-25 18:22:46] [INFO ] Invariant cache hit.
[2024-05-25 18:22:58] [INFO ] Implicit Places using invariants and state equation in 12515 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 16986 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 178 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17326 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-07
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-07 TRUE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-07 finished in 17528 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)||G((F(p0)&&F(G(p1))))))'
Support contains 871 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.13 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2904 transition count 442
Applied a total of 3 rules in 293 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2024-05-25 18:22:59] [INFO ] Computed 2464 invariants in 99 ms
[2024-05-25 18:23:02] [INFO ] Implicit Places using invariants in 3466 ms returned []
[2024-05-25 18:23:02] [INFO ] Invariant cache hit.
[2024-05-25 18:23:20] [INFO ] Implicit Places using invariants and state equation in 17875 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 21353 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2846/2936 places, 442/446 transitions.
Applied a total of 0 rules in 129 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21776 ms. Remains : 2846/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-08
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-08 finished in 22033 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&&X(X(!p1))&&F(p2)))))'
Support contains 930 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 78 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 18:23:21] [INFO ] Computed 2492 invariants in 67 ms
[2024-05-25 18:23:24] [INFO ] Implicit Places using invariants in 3406 ms returned []
[2024-05-25 18:23:24] [INFO ] Invariant cache hit.
[2024-05-25 18:23:29] [INFO ] Implicit Places using invariants and state equation in 4958 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 8380 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 75 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8535 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 527 ms :[(NOT p0), true, p1, (NOT p2), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0)), p1, p1, (AND (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-09
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-09 finished in 9097 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((G(F(p1))||p0))))'
Support contains 60 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 163 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:23:30] [INFO ] Invariant cache hit.
[2024-05-25 18:23:34] [INFO ] Implicit Places using invariants in 4120 ms returned []
[2024-05-25 18:23:34] [INFO ] Invariant cache hit.
[2024-05-25 18:23:41] [INFO ] Implicit Places using invariants and state equation in 7132 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11255 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 175 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11595 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 634 ms.
Product exploration explored 100000 steps with 50000 reset in 655 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-10 finished in 13465 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 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 180 are kept as prefixes of interest. Removing 2756 places using SCC suffix rule.7 ms
Discarding 2756 places :
Also discarding 176 output transitions
Drop transitions (Output transitions of discarded places.) removed 176 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 179 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 178 transition count 123
Applied a total of 148 rules in 19 ms. Remains 178 /2936 variables (removed 2758) and now considering 123/446 (removed 323) transitions.
// Phase 1: matrix 123 rows 178 cols
[2024-05-25 18:23:43] [INFO ] Computed 56 invariants in 1 ms
[2024-05-25 18:23:43] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-25 18:23:43] [INFO ] Invariant cache hit.
[2024-05-25 18:23:43] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 295 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/2936 places, 123/446 transitions.
Applied a total of 0 rules in 2 ms. Remains 149 /149 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 317 ms. Remains : 149/2936 places, 123/446 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-13
Product exploration explored 100000 steps with 2784 reset in 305 ms.
Product exploration explored 100000 steps with 2786 reset in 324 ms.
Computed a total of 149 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 149 transition count 123
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-13 finished in 1061 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 U ((!p2&&X(G((!p2||G(!p0)))))||p1))))'
Support contains 929 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.7 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2904 transition count 442
Applied a total of 3 rules in 199 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2024-05-25 18:23:44] [INFO ] Computed 2464 invariants in 47 ms
[2024-05-25 18:23:48] [INFO ] Implicit Places using invariants in 3429 ms returned []
[2024-05-25 18:23:48] [INFO ] Invariant cache hit.
[2024-05-25 18:24:06] [INFO ] Implicit Places using invariants and state equation in 17705 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 21141 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2846/2936 places, 442/446 transitions.
Applied a total of 0 rules in 104 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21446 ms. Remains : 2846/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p1) p2), true, (AND p0 p2), (AND (NOT p1) p2), (AND p2 p0 (NOT p1)), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-14
Product exploration explored 100000 steps with 2812 reset in 697 ms.
Product exploration explored 100000 steps with 2812 reset in 716 ms.
Computed a total of 2846 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2846 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (OR p1 (NOT p2) p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (OR p1 (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 146 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) p2), true, (AND p0 p2), (AND (NOT p1) p2), (AND p0 p2 (NOT p1)), p0]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (1123 resets) in 1194 ms. (33 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 1782 ms. (22 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 961 ms. (41 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 969 ms. (41 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 879 ms. (45 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (32 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (33 resets) in 906 ms. (44 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 828502 steps, run timeout after 6001 ms. (steps per millisecond=138 ) properties seen :6 out of 9
Probabilistic random walk after 828502 steps, saw 124028 distinct states, run finished after 6008 ms. (steps per millisecond=137 ) properties seen :6
// Phase 1: matrix 442 rows 2846 cols
[2024-05-25 18:24:17] [INFO ] Computed 2408 invariants in 560 ms
Problem apf1 is UNSAT
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/929 variables, 784/784 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/929 variables, 0/784 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 206/1135 variables, 929/1713 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1135 variables, 0/1713 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2063/3198 variables, 1829/3542 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3198 variables, 1624/5166 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3198 variables, 0/5166 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf7 is UNSAT
After SMT solving in domain Real declared 3288/3288 variables, and 5254 constraints, problems are : Problem set: 3 solved, 0 unsolved in 1189 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2846/2846 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2123ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (OR p1 (NOT p2) p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (OR p1 (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 (NOT p2) p1)), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p2)))), (F p2), (F p1)]
Knowledge based reduction with 28 factoid took 337 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (AND p0 p2), p0]
Stuttering acceptance computed with spot in 83 ms :[true, (AND p0 p2), p0]
Support contains 59 out of 2846 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2846/2846 places, 442/442 transitions.
Applied a total of 0 rules in 118 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-05-25 18:24:19] [INFO ] Invariant cache hit.
[2024-05-25 18:24:23] [INFO ] Implicit Places using invariants in 3223 ms returned []
[2024-05-25 18:24:23] [INFO ] Invariant cache hit.
[2024-05-25 18:24:44] [INFO ] Implicit Places using invariants and state equation in 21801 ms returned []
Implicit Place search using SMT with State Equation took 25041 ms to find 0 implicit places.
[2024-05-25 18:24:44] [INFO ] Redundant transitions in 34 ms returned []
Running 383 sub problems to find dead transitions.
[2024-05-25 18:24:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2817 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2817/3288 variables, and 2408 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 0/2846 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2817 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2817 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 442/3259 variables, 2817/5225 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3259 variables, 383/5608 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3259/3288 variables, and 5608 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2817/2846 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 0/0 constraints]
After SMT, in 60806ms problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 60813ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86023 ms. Remains : 2846/2846 places, 442/442 transitions.
Computed a total of 2846 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2846 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 177 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[true, p0, (AND p0 p2)]
RANDOM walk for 40000 steps (1125 resets) in 976 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 551643 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :3 out of 4
Probabilistic random walk after 551643 steps, saw 88759 distinct states, run finished after 3003 ms. (steps per millisecond=183 ) properties seen :3
[2024-05-25 18:25:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/149 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 352/501 variables, 118/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 28/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 1606/3288 variables, and 1192 constraints, problems are : Problem set: 1 solved, 0 unsolved in 323 ms.
Refiners :[Generalized P Invariants (flows): 28/2408 constraints, State Equation: 1164/2846 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 12 factoid took 362 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[true, p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 102 ms :[true, p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 102 ms :[true, p0, (AND p0 p2)]
Product exploration explored 100000 steps with 2813 reset in 637 ms.
Product exploration explored 100000 steps with 2814 reset in 646 ms.
Built C files in :
/tmp/ltsmin698458950383448091
[2024-05-25 18:25:52] [INFO ] Computing symmetric may disable matrix : 442 transitions.
[2024-05-25 18:25:52] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:25:52] [INFO ] Computing symmetric may enable matrix : 442 transitions.
[2024-05-25 18:25:52] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:25:52] [INFO ] Computing Do-Not-Accords matrix : 442 transitions.
[2024-05-25 18:25:52] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:25:52] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin698458950383448091
Running compilation step : cd /tmp/ltsmin698458950383448091;'/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 2686 ms.
Running link step : cd /tmp/ltsmin698458950383448091;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin698458950383448091;'/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/stateBased3180234698846492696.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 59 out of 2846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2846/2846 places, 442/442 transitions.
Applied a total of 0 rules in 214 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-05-25 18:26:07] [INFO ] Invariant cache hit.
[2024-05-25 18:26:11] [INFO ] Implicit Places using invariants in 4076 ms returned []
[2024-05-25 18:26:11] [INFO ] Invariant cache hit.
[2024-05-25 18:26:35] [INFO ] Implicit Places using invariants and state equation in 24317 ms returned []
Implicit Place search using SMT with State Equation took 28413 ms to find 0 implicit places.
[2024-05-25 18:26:35] [INFO ] Redundant transitions in 24 ms returned []
Running 383 sub problems to find dead transitions.
[2024-05-25 18:26:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2817 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2817/3288 variables, and 2408 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 0/2846 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2817 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2817 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 442/3259 variables, 2817/5225 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3259 variables, 383/5608 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3259/3288 variables, and 5608 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2817/2846 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 0/0 constraints]
After SMT, in 60830ms problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 60835ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 89501 ms. Remains : 2846/2846 places, 442/442 transitions.
Built C files in :
/tmp/ltsmin14365998811461681809
[2024-05-25 18:27:36] [INFO ] Computing symmetric may disable matrix : 442 transitions.
[2024-05-25 18:27:36] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:27:36] [INFO ] Computing symmetric may enable matrix : 442 transitions.
[2024-05-25 18:27:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:27:36] [INFO ] Computing Do-Not-Accords matrix : 442 transitions.
[2024-05-25 18:27:36] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:27:36] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14365998811461681809
Running compilation step : cd /tmp/ltsmin14365998811461681809;'/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 2632 ms.
Running link step : cd /tmp/ltsmin14365998811461681809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14365998811461681809;'/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/stateBased13256293508572200877.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 18:27:51] [INFO ] Flatten gal took : 53 ms
[2024-05-25 18:27:51] [INFO ] Flatten gal took : 52 ms
[2024-05-25 18:27:51] [INFO ] Time to serialize gal into /tmp/LTL9341414870324237320.gal : 8 ms
[2024-05-25 18:27:51] [INFO ] Time to serialize properties into /tmp/LTL9775254403886512848.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/LTL9341414870324237320.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17231132845789755871.hoa' '-atoms' '/tmp/LTL9775254403886512848.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/LTL9775254403886512848.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17231132845789755871.hoa
Detected timeout of ITS tools.
[2024-05-25 18:28:07] [INFO ] Flatten gal took : 55 ms
[2024-05-25 18:28:07] [INFO ] Flatten gal took : 55 ms
[2024-05-25 18:28:07] [INFO ] Time to serialize gal into /tmp/LTL10341725179389602757.gal : 7 ms
[2024-05-25 18:28:07] [INFO ] Time to serialize properties into /tmp/LTL2085935474822559666.ltl : 3 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/LTL10341725179389602757.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2085935474822559666.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(("(a4>=1)")U(("(((((((((((n9_11>=1)&&(n9_40>=1))&&((n9_69>=1)&&(n9_98>=1)))&&(((n9_127>=1)&&(n9_156>=1))&&((n9_185>=1)&&(n9_214>=...15367
Formula 0 simplified : F(!"(a4>=1)" R (!"(((((((((((n9_11>=1)&&(n9_40>=1))&&((n9_69>=1)&&(n9_98>=1)))&&(((n9_127>=1)&&(n9_156>=1))&&((n9_185>=1)&&(n9_214>=...15344
Detected timeout of ITS tools.
[2024-05-25 18:28:22] [INFO ] Flatten gal took : 65 ms
[2024-05-25 18:28:22] [INFO ] Applying decomposition
[2024-05-25 18:28:22] [INFO ] Flatten gal took : 68 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/graph10598484353028332287.txt' '-o' '/tmp/graph10598484353028332287.bin' '-w' '/tmp/graph10598484353028332287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10598484353028332287.bin' '-l' '-1' '-v' '-w' '/tmp/graph10598484353028332287.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:28:22] [INFO ] Decomposing Gal with order
[2024-05-25 18:28:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:28:22] [INFO ] Removed a total of 289 redundant transitions.
[2024-05-25 18:28:22] [INFO ] Flatten gal took : 169 ms
[2024-05-25 18:28:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 57 ms.
[2024-05-25 18:28:23] [INFO ] Time to serialize gal into /tmp/LTL2116694486371761585.gal : 15 ms
[2024-05-25 18:28:23] [INFO ] Time to serialize properties into /tmp/LTL13911187731192377654.ltl : 3 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/LTL2116694486371761585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13911187731192377654.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...255
Read 1 LTL properties
Checking formula 0 : !((G(("(i6.u117.a4>=1)")U(("(((((((((((u88.n9_11>=1)&&(u89.n9_40>=1))&&((u90.n9_69>=1)&&(u91.n9_98>=1)))&&(((u92.n9_127>=1)&&(u93.n9_1...20745
Formula 0 simplified : F(!"(i6.u117.a4>=1)" R (!"(((((((((((u88.n9_11>=1)&&(u89.n9_40>=1))&&((u90.n9_69>=1)&&(u91.n9_98>=1)))&&(((u92.n9_127>=1)&&(u93.n9_1...20722
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-14 finished in 293433 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(X(G(p0))))'
Support contains 870 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 85 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 18:28:38] [INFO ] Computed 2492 invariants in 59 ms
[2024-05-25 18:28:40] [INFO ] Implicit Places using invariants in 2550 ms returned []
[2024-05-25 18:28:40] [INFO ] Invariant cache hit.
[2024-05-25 18:28:49] [INFO ] Implicit Places using invariants and state equation in 8505 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11062 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 85 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11233 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-15 finished in 11442 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||X((p1 U G(!p1))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-28-LTLFireability-05
Stuttering acceptance computed with spot in 120 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.23 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2903 transition count 441
Applied a total of 5 rules in 360 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2024-05-25 18:28:50] [INFO ] Computed 2464 invariants in 51 ms
[2024-05-25 18:28:54] [INFO ] Implicit Places using invariants in 4254 ms returned []
[2024-05-25 18:28:54] [INFO ] Invariant cache hit.
[2024-05-25 18:29:01] [INFO ] Implicit Places using invariants and state equation in 6778 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 11037 ms to find 58 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2845/2936 places, 441/446 transitions.
Applied a total of 0 rules in 174 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11573 ms. Remains : 2845/2936 places, 441/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-05
Product exploration explored 100000 steps with 2810 reset in 474 ms.
Product exploration explored 100000 steps with 2816 reset in 505 ms.
Computed a total of 2845 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2845 transition count 441
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, p1, (AND p1 (NOT p0)), p1]
RANDOM walk for 40000 steps (1123 resets) in 633 ms. (63 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (32 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (30 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7113 steps, run visited all 2 properties in 106 ms. (steps per millisecond=67 )
Probabilistic random walk after 7113 steps, saw 6968 distinct states, run finished after 108 ms. (steps per millisecond=65 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 188 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 140 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 147 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
// Phase 1: matrix 441 rows 2845 cols
[2024-05-25 18:29:04] [INFO ] Computed 2408 invariants in 596 ms
[2024-05-25 18:29:08] [INFO ] Implicit Places using invariants in 4509 ms returned []
[2024-05-25 18:29:08] [INFO ] Invariant cache hit.
[2024-05-25 18:29:15] [INFO ] Implicit Places using invariants and state equation in 7087 ms returned []
Implicit Place search using SMT with State Equation took 11599 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-25 18:29:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2816/3286 variables, and 2408 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 0/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2816 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3257 variables, 2816/5224 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3257 variables, 382/5606 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3257/3286 variables, and 5606 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2816/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60761ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60766ms
Finished structural reductions in LTL mode , in 1 iterations and 72515 ms. Remains : 2845/2845 places, 441/441 transitions.
Computed a total of 2845 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2845 transition count 441
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 213 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, p1, (AND p1 (NOT p0)), p1]
RANDOM walk for 40000 steps (1125 resets) in 581 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (32 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (28 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7113 steps, run visited all 2 properties in 114 ms. (steps per millisecond=62 )
Probabilistic random walk after 7113 steps, saw 6968 distinct states, run finished after 116 ms. (steps per millisecond=61 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 150 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 133 ms :[true, p1, (AND p1 (NOT p0)), p1]
Product exploration explored 100000 steps with 2815 reset in 491 ms.
Product exploration explored 100000 steps with 2816 reset in 503 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 148 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 168 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-25 18:30:19] [INFO ] Redundant transitions in 37 ms returned []
Running 382 sub problems to find dead transitions.
[2024-05-25 18:30:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
(s0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2816/3286 variables, and 2408 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 0/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2816 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3257 variables, 2816/5224 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3257 variables, 382/5606 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3257/3286 variables, and 5606 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2816/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60778ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60782ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60995 ms. Remains : 2845/2845 places, 441/441 transitions.
Built C files in :
/tmp/ltsmin10463664125542217805
[2024-05-25 18:31:20] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10463664125542217805
Running compilation step : cd /tmp/ltsmin10463664125542217805;'/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 2183 ms.
Running link step : cd /tmp/ltsmin10463664125542217805;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10463664125542217805;'/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/stateBased3400495408184026256.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 152 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-25 18:31:35] [INFO ] Invariant cache hit.
[2024-05-25 18:31:39] [INFO ] Implicit Places using invariants in 4121 ms returned []
[2024-05-25 18:31:39] [INFO ] Invariant cache hit.
[2024-05-25 18:31:46] [INFO ] Implicit Places using invariants and state equation in 6957 ms returned []
Implicit Place search using SMT with State Equation took 11080 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-25 18:31:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2816/3286 variables, and 2408 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 0/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2816 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3257 variables, 2816/5224 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3257 variables, 382/5606 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3257/3286 variables, and 5606 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2816/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60743ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60750ms
Finished structural reductions in LTL mode , in 1 iterations and 71988 ms. Remains : 2845/2845 places, 441/441 transitions.
Built C files in :
/tmp/ltsmin955364446989907794
[2024-05-25 18:32:47] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin955364446989907794
Running compilation step : cd /tmp/ltsmin955364446989907794;'/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 2301 ms.
Running link step : cd /tmp/ltsmin955364446989907794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin955364446989907794;'/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/stateBased7047923300236229639.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 18:33:02] [INFO ] Flatten gal took : 53 ms
[2024-05-25 18:33:02] [INFO ] Flatten gal took : 54 ms
[2024-05-25 18:33:02] [INFO ] Time to serialize gal into /tmp/LTL2950165519292823003.gal : 8 ms
[2024-05-25 18:33:02] [INFO ] Time to serialize properties into /tmp/LTL7409383289360850060.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/LTL2950165519292823003.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12259857184226472664.hoa' '-atoms' '/tmp/LTL7409383289360850060.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/LTL7409383289360850060.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12259857184226472664.hoa
Detected timeout of ITS tools.
[2024-05-25 18:33:18] [INFO ] Flatten gal took : 51 ms
[2024-05-25 18:33:18] [INFO ] Flatten gal took : 64 ms
[2024-05-25 18:33:18] [INFO ] Time to serialize gal into /tmp/LTL8667287121691701735.gal : 8 ms
[2024-05-25 18:33:18] [INFO ] Time to serialize properties into /tmp/LTL4115838255324213739.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/LTL8667287121691701735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4115838255324213739.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...275
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((((((malicious_reservoir>=1)&&(s3_28>=1))||((malicious_reservoir>=1)&&(s3_27>=1)))||(((malicious_reservoir>=1)&&(s3_25>=1)...2826
Formula 0 simplified : F(!"((((((s6_19<1)&&(s6_18<1))&&((s6_17<1)&&(s6_16<1)))&&(((s6_23<1)&&(s6_22<1))&&((s6_21<1)&&(s6_20<1))))&&((((s6_11<1)&&(s6_10<1))...2815
Detected timeout of ITS tools.
[2024-05-25 18:33:33] [INFO ] Flatten gal took : 53 ms
[2024-05-25 18:33:33] [INFO ] Applying decomposition
[2024-05-25 18:33:33] [INFO ] Flatten gal took : 53 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/graph17804352518432086488.txt' '-o' '/tmp/graph17804352518432086488.bin' '-w' '/tmp/graph17804352518432086488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17804352518432086488.bin' '-l' '-1' '-v' '-w' '/tmp/graph17804352518432086488.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:33:33] [INFO ] Decomposing Gal with order
[2024-05-25 18:33:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:33:33] [INFO ] Removed a total of 319 redundant transitions.
[2024-05-25 18:33:33] [INFO ] Flatten gal took : 171 ms
[2024-05-25 18:33:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 53 ms.
[2024-05-25 18:33:33] [INFO ] Time to serialize gal into /tmp/LTL7287222678926938713.gal : 15 ms
[2024-05-25 18:33:33] [INFO ] Time to serialize properties into /tmp/LTL11887192850236594588.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/LTL7287222678926938713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11887192850236594588.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...255
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((((((u0.malicious_reservoir>=1)&&(i11.u12.s3_28>=1))||((u0.malicious_reservoir>=1)&&(i7.u87.s3_27>=1)))||(((u0.malicious_r...3561
Formula 0 simplified : F(!"((((((u107.s6_19<1)&&(u106.s6_18<1))&&((u105.s6_17<1)&&(u104.s6_16<1)))&&(((u111.s6_23<1)&&(u110.s6_22<1))&&((u109.s6_21<1)&&(u1...3550
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-05 finished in 299356 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 U ((!p2&&X(G((!p2||G(!p0)))))||p1))))'
[2024-05-25 18:33:49] [INFO ] Flatten gal took : 62 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15856395619210680158
[2024-05-25 18:33:49] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2024-05-25 18:33:49] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:33:49] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2024-05-25 18:33:49] [INFO ] Applying decomposition
[2024-05-25 18:33:49] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:33:49] [INFO ] Flatten gal took : 77 ms
[2024-05-25 18:33:49] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2024-05-25 18:33:49] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:33:49] [INFO ] Built C files in 142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15856395619210680158
Running compilation step : cd /tmp/ltsmin15856395619210680158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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/graph85027216056245666.txt' '-o' '/tmp/graph85027216056245666.bin' '-w' '/tmp/graph85027216056245666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph85027216056245666.bin' '-l' '-1' '-v' '-w' '/tmp/graph85027216056245666.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:33:49] [INFO ] Decomposing Gal with order
[2024-05-25 18:33:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:33:49] [INFO ] Removed a total of 288 redundant transitions.
[2024-05-25 18:33:49] [INFO ] Flatten gal took : 166 ms
[2024-05-25 18:33:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 166 labels/synchronizations in 61 ms.
[2024-05-25 18:33:49] [INFO ] Time to serialize gal into /tmp/LTLFireability12295620964614954161.gal : 21 ms
[2024-05-25 18:33:49] [INFO ] Time to serialize properties into /tmp/LTLFireability1677007129201131202.ltl : 3 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/LTLFireability12295620964614954161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1677007129201131202.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 2 LTL properties
Checking formula 0 : !((G(("((((((i22.u188.s6_19<1)&&(i48.u187.s6_18<1))&&((i27.u186.s6_17<1)&&(i54.u185.s6_16<1)))&&(((i19.u192.s6_23<1)&&(i56.u191.s6_22<...3828
Formula 0 simplified : F(!"((((((i22.u188.s6_19<1)&&(i48.u187.s6_18<1))&&((i27.u186.s6_17<1)&&(i54.u185.s6_16<1)))&&(((i19.u192.s6_23<1)&&(i56.u191.s6_22<1...3817
Compilation finished in 2890 ms.
Running link step : cd /tmp/ltsmin15856395619210680158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin15856395619210680158;'/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' '[](((LTLAPp0==true)||X(((LTLAPp1==true) U [](!(LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: 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( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.047: LTL layer: formula: [](((LTLAPp0==true)||X(((LTLAPp1==true) U [](!(LTLAPp1==true))))))
pins2lts-mc-linux64( 3/ 8), 0.049: "[](((LTLAPp0==true)||X(((LTLAPp1==true) U [](!(LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.103: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.131: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.132: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.169: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.172: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.190: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.207: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.264: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.191: DFS-FIFO for weak LTL, using special progress label 452
pins2lts-mc-linux64( 0/ 8), 1.191: There are 453 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.191: State length is 2937, there are 453 groups
pins2lts-mc-linux64( 0/ 8), 1.191: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.191: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.191: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.191: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 4.496: ~1 levels ~960 states ~27992 transitions
pins2lts-mc-linux64( 1/ 8), 5.143: ~1 levels ~1920 states ~59656 transitions
pins2lts-mc-linux64( 2/ 8), 5.790: ~1 levels ~3840 states ~117232 transitions
pins2lts-mc-linux64( 1/ 8), 8.063: ~1 levels ~7680 states ~249736 transitions
pins2lts-mc-linux64( 3/ 8), 14.276: ~1 levels ~15360 states ~433824 transitions
pins2lts-mc-linux64( 7/ 8), 22.083: ~1 levels ~30720 states ~1062264 transitions
pins2lts-mc-linux64( 7/ 8), 36.767: ~1 levels ~61440 states ~2398608 transitions
pins2lts-mc-linux64( 4/ 8), 58.578: ~1 levels ~122880 states ~3841976 transitions
pins2lts-mc-linux64( 4/ 8), 85.462: ~1 levels ~245760 states ~10235216 transitions
pins2lts-mc-linux64( 7/ 8), 117.968: ~1 levels ~491520 states ~20132856 transitions
pins2lts-mc-linux64( 1/ 8), 132.196: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 133.042:
pins2lts-mc-linux64( 0/ 8), 133.042: mean standard work distribution: 6.1% (states) 4.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 133.042:
pins2lts-mc-linux64( 0/ 8), 133.042: Explored 531334 states 23288144 transitions, fanout: 43.830
pins2lts-mc-linux64( 0/ 8), 133.042: Total exploration time 131.850 sec (131.010 sec minimum, 131.286 sec on average)
pins2lts-mc-linux64( 0/ 8), 133.042: States per second: 4030, Transitions per second: 176626
pins2lts-mc-linux64( 0/ 8), 133.042:
pins2lts-mc-linux64( 0/ 8), 133.042: Progress states detected: 6139911
pins2lts-mc-linux64( 0/ 8), 133.042: Redundant explorations: -91.3465
pins2lts-mc-linux64( 0/ 8), 133.042:
pins2lts-mc-linux64( 0/ 8), 133.042: Queue width: 8B, total height: 6920149, memory: 52.80MB
pins2lts-mc-linux64( 0/ 8), 133.042: Tree memory: 302.8MB, 51.7 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 133.042: Tree fill ratio (roots/leafs): 4.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 133.042: Stored 448 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 133.042: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 133.042: Est. total memory use: 355.6MB (~1076.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15856395619210680158;'/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' '[](((LTLAPp0==true)||X(((LTLAPp1==true) U [](!(LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15856395619210680158;'/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' '[](((LTLAPp0==true)||X(((LTLAPp1==true) U [](!(LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-25 18:43:58] [INFO ] Applying decomposition
[2024-05-25 18:43:58] [INFO ] Flatten gal took : 63 ms
[2024-05-25 18:43:58] [INFO ] Decomposing Gal with order
[2024-05-25 18:43:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:43:58] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to malicious_reservoir in partition [n6_0, n5_0, n4_0, n3_0, n2_0, n1_0, c1_0, Cstart_0, Sstart_0, s2_0, s3_0, s4_0, s5_0, s6_0],[n6_1, n5_1, n4_1, n3_1, n2_1, n1_1, c1_1, Cstart_1, Sstart_1, s2_1, s3_1, s4_1, s5_1, s6_1],[n6_2, n5_2, n4_2, n3_2, n2_2, n1_2, c1_2, Cstart_2, Sstart_2, s2_2, s3_2, s4_2, s5_2, s6_2],[n6_3, n5_3, n4_3, n3_3, n2_3, n1_3, c1_3, Cstart_3, Sstart_3, s2_3, s3_3, s4_3, s5_3, s6_3],[n6_4, n5_4, n4_4, n3_4, n2_4, n1_4, c1_4, Cstart_4, Sstart_4, s2_4, s3_4, s4_4, s5_4, s6_4],[n6_5, n5_5, n4_5, n3_5, n2_5, n1_5, c1_5, Cstart_5, Sstart_5, s2_5, s3_5, s4_5, s5_5, s6_5],[n6_6, n5_6, n4_6, n3_6, n2_6, n1_6, c1_6, Cstart_6, Sstart_6, s2_6, s3_6, s4_6, s5_6, s6_6],[n6_7, n5_7, n4_7, n3_7, n2_7, n1_7, c1_7, Cstart_7, Sstart_7, s2_7, s3_7, s4_7, s5_7, s6_7],[n6_8, n5_8, n4_8, n3_8, n2_8, n1_8, c1_8, Cstart_8, Sstart_8, s2_8, s3_8, s4_8, s5_8, s6_8],[n6_9, n5_9, n4_9, n3_9, n2_9, n1_9, c1_9, Cstart_9, Sstart_9, s2_9, s3_9, s4_9, s5_9, s6_9],[n6_10, n5_10, n4_10, n3_10, n2_10, n1_10, c1_10, Cstart_10, Sstart_10, s2_10, s3_10, s4_10, s5_10, s6_10],[n6_11, n5_11, n4_11, n3_11, n2_11, n1_11, c1_11, Cstart_11, Sstart_11, s2_11, s3_11, s4_11, s5_11, s6_11],[n6_12, n5_12, n4_12, n3_12, n2_12, n1_12, c1_12, Cstart_12, Sstart_12, s2_12, s3_12, s4_12, s5_12, s6_12],[n6_13, n5_13, n4_13, n3_13, n2_13, n1_13, c1_13, Cstart_13, Sstart_13, s2_13, s3_13, s4_13, s5_13, s6_13],[n6_14, n5_14, n4_14, n3_14, n2_14, n1_14, c1_14, Cstart_14, Sstart_14, s2_14, s3_14, s4_14, s5_14, s6_14],[n6_15, n5_15, n4_15, n3_15, n2_15, n1_15, c1_15, Cstart_15, Sstart_15, s2_15, s3_15, s4_15, s5_15, s6_15],[n6_16, n5_16, n4_16, n3_16, n2_16, n1_16, c1_16, Cstart_16, Sstart_16, s2_16, s3_16, s4_16, s5_16, s6_16],[n6_17, n5_17, n4_17, n3_17, n2_17, n1_17, c1_17, Cstart_17, Sstart_17, s2_17, s3_17, s4_17, s5_17, s6_17],[n6_18, n5_18, n4_18, n3_18, n2_18, n1_18, c1_18, Cstart_18, Sstart_18, s2_18, s3_18, s4_18, s5_18, s6_18],[n6_19, n5_19, n4_19, n3_19, n2_19, n1_19, c1_19, Cstart_19, Sstart_19, s2_19, s3_19, s4_19, s5_19, s6_19],[n6_20, n5_20, n4_20, n3_20, n2_20, n1_20, c1_20, Cstart_20, Sstart_20, s2_20, s3_20, s4_20, s5_20, s6_20],[n6_21, n5_21, n4_21, n3_21, n2_21, n1_21, c1_21, Cstart_21, Sstart_21, s2_21, s3_21, s4_21, s5_21, s6_21],[n6_22, n5_22, n4_22, n3_22, n2_22, n1_22, c1_22, Cstart_22, Sstart_22, s2_22, s3_22, s4_22, s5_22, s6_22],[n6_23, n5_23, n4_23, n3_23, n2_23, n1_23, c1_23, Cstart_23, Sstart_23, s2_23, s3_23, s4_23, s5_23, s6_23],[n6_24, n5_24, n4_24, n3_24, n2_24, n1_24, c1_24, Cstart_24, Sstart_24, s2_24, s3_24, s4_24, s5_24, s6_24],[n6_25, n5_25, n4_25, n3_25, n2_25, n1_25, c1_25, Cstart_25, Sstart_25, s2_25, s3_25, s4_25, s5_25, s6_25],[n6_26, n5_26, n4_26, n3_26, n2_26, n1_26, c1_26, Cstart_26, Sstart_26, s2_26, s3_26, s4_26, s5_26, s6_26],[n6_27, n5_27, n4_27, n3_27, n2_27, n1_27, c1_27, Cstart_27, Sstart_27, s2_27, s3_27, s4_27, s5_27, s6_27],[n6_28, n5_28, n4_28, n3_28, n2_28, n1_28, c1_28, Cstart_28, Sstart_28, s2_28, s3_28, s4_28, s5_28, s6_28],[n9_0, n8_0, n7_0],[n9_1, n8_1, n7_1],[n9_2, n8_2, n7_2],[n9_3, n8_3, n7_3],[n9_4, n8_4, n7_4],[n9_5, n8_5, n7_5],[n9_6, n8_6, n7_6],[n9_7, n8_7, n7_7],[n9_8, n8_8, n7_8],[n9_9, n8_9, n7_9],[n9_10, n8_10, n7_10],[n9_11, n8_11, n7_11],[n9_12, n8_12, n7_12],[n9_13, n8_13, n7_13],[n9_14, n8_14, n7_14],[n9_15, n8_15, n7_15],[n9_16, n8_16, n7_16],[n9_17, n8_17, n7_17],[n9_18, n8_18, n7_18],[n9_19, n8_19, n7_19],[n9_20, n8_20, n7_20],[n9_21, n8_21, n7_21],[n9_22, n8_22, n7_22],[n9_23, n8_23, n7_23],[n9_24, n8_24, n7_24],[n9_25, n8_25, n7_25],[n9_26, n8_26, n7_26],[n9_27, n8_27, n7_27],[n9_28, n8_28, n7_28],[n9_29, n8_29, n7_29],[n9_30, n8_30, n7_30],[n9_31, n8_31, n7_31],[n9_32, n8_32, n7_32],[n9_33, n8_33, n7_33],[n9_34, n8_34, n7_34],[n9_35, n8_35, n7_35],[n9_36, n8_36, n7_36],[n9_37, n8_37, n7_37],[n9_38, n8_38, n7_38],[n9_39, n8_39, n7_39],[n9_40, n8_40, n7_40],[n9_41, n8_41, n7_41],[n9_42, n8_42, n7_42],[n9_43, n8_43, n7_43],[n9_44, n8_44, n7_44],[n9_45, n8_45, n7_45],[n9_46, n8_46, n7_46],[n9_47, n8_47, n7_47],[n9_48, n8_48, n7_48],[n9_49, n8_49, n7_49],[n9_50, n8_50, n7_50],[n9_51, n8_51, n7_51],[n9_52, n8_52, n7_52],[n9_53, n8_53, n7_53],[n9_54, n8_54, n7_54],[n9_55, n8_55, n7_55],[n9_56, n8_56, n7_56],[n9_57, n8_57, n7_57],[n9_58, n8_58, n7_58],[n9_59, n8_59, n7_59],[n9_60, n8_60, n7_60],[n9_61, n8_61, n7_61],[n9_62, n8_62, n7_62],[n9_63, n8_63, n7_63],[n9_64, n8_64, n7_64],[n9_65, n8_65, n7_65],[n9_66, n8_66, n7_66],[n9_67, n8_67, n7_67],[n9_68, n8_68, n7_68],[n9_69, n8_69, n7_69],[n9_70, n8_70, n7_70],[n9_71, n8_71, n7_71],[n9_72, n8_72, n7_72],[n9_73, n8_73, n7_73],[n9_74, n8_74, n7_74],[n9_75, n8_75, n7_75],[n9_76, n8_76, n7_76],[n9_77, n8_77, n7_77],[n9_78, n8_78, n7_78],[n9_79, n8_79, n7_79],[n9_80, n8_80, n7_80],[n9_81, n8_81, n7_81],[n9_82, n8_82, n7_82],[n9_83, n8_83, n7_83],[n9_84, n8_84, n7_84],[n9_85, n8_85, n7_85],[n9_86, n8_86, n7_86],[n9_87, n8_87, n7_87],[n9_88, n8_88, n7_88],[n9_89, n8_89, n7_89],[n9_90, n8_90, n7_90],[n9_91, n8_91, n7_91],[n9_92, n8_92, n7_92],[n9_93, n8_93, n7_93],[n9_94, n8_94, n7_94],[n9_95, n8_95, n7_95],[n9_96, n8_96, n7_96],[n9_97, n8_97, n7_97],[n9_98, n8_98, n7_98],[n9_99, n8_99, n7_99],[n9_100, n8_100, n7_100],[n9_101, n8_101, n7_101],[n9_102, n8_102, n7_102],[n9_103, n8_103, n7_103],[n9_104, n8_104, n7_104],[n9_105, n8_105, n7_105],[n9_106, n8_106, n7_106],[n9_107, n8_107, n7_107],[n9_108, n8_108, n7_108],[n9_109, n8_109, n7_109],[n9_110, n8_110, n7_110],[n9_111, n8_111, n7_111],[n9_112, n8_112, n7_112],[n9_113, n8_113, n7_113],[n9_114, n8_114, n7_114],[n9_115, n8_115, n7_115],[n9_116, n8_116, n7_116],[n9_117, n8_117, n7_117],[n9_118, n8_118, n7_118],[n9_119, n8_119, n7_119],[n9_120, n8_120, n7_120],[n9_121, n8_121, n7_121],[n9_122, n8_122, n7_122],[n9_123, n8_123, n7_123],[n9_124, n8_124, n7_124],[n9_125, n8_125, n7_125],[n9_126, n8_126, n7_126],[n9_127, n8_127, n7_127],[n9_128, n8_128, n7_128],[n9_129, n8_129, n7_129],[n9_130, n8_130, n7_130],[n9_131, n8_131, n7_131],[n9_132, n8_132, n7_132],[n9_133, n8_133, n7_133],[n9_134, n8_134, n7_134],[n9_135, n8_135, n7_135],[n9_136, n8_136, n7_136],[n9_137, n8_137, n7_137],[n9_138, n8_138, n7_138],[n9_139, n8_139, n7_139],[n9_140, n8_140, n7_140],[n9_141, n8_141, n7_141],[n9_142, n8_142, n7_142],[n9_143, n8_143, n7_143],[n9_144, n8_144, n7_144],[n9_145, n8_145, n7_145],[n9_146, n8_146, n7_146],[n9_147, n8_147, n7_147],[n9_148, n8_148, n7_148],[n9_149, n8_149, n7_149],[n9_150, n8_150, n7_150],[n9_151, n8_151, n7_151],[n9_152, n8_152, n7_152],[n9_153, n8_153, n7_153],[n9_154, n8_154, n7_154],[n9_155, n8_155, n7_155],[n9_156, n8_156, n7_156],[n9_157, n8_157, n7_157],[n9_158, n8_158, n7_158],[n9_159, n8_159, n7_159],[n9_160, n8_160, n7_160],[n9_161, n8_161, n7_161],[n9_162, n8_162, n7_162],[n9_163, n8_163, n7_163],[n9_164, n8_164, n7_164],[n9_165, n8_165, n7_165],[n9_166, n8_166, n7_166],[n9_167, n8_167, n7_167],[n9_168, n8_168, n7_168],[n9_169, n8_169, n7_169],[n9_170, n8_170, n7_170],[n9_171, n8_171, n7_171],[n9_172, n8_172, n7_172],[n9_173, n8_173, n7_173],[n9_174, n8_174, n7_174],[n9_175, n8_175, n7_175],[n9_176, n8_176, n7_176],[n9_177, n8_177, n7_177],[n9_178, n8_178, n7_178],[n9_179, n8_179, n7_179],[n9_180, n8_180, n7_180],[n9_181, n8_181, n7_181],[n9_182, n8_182, n7_182],[n9_183, n8_183, n7_183],[n9_184, n8_184, n7_184],[n9_185, n8_185, n7_185],[n9_186, n8_186, n7_186],[n9_187, n8_187, n7_187],[n9_188, n8_188, n7_188],[n9_189, n8_189, n7_189],[n9_190, n8_190, n7_190],[n9_191, n8_191, n7_191],[n9_192, n8_192, n7_192],[n9_193, n8_193, n7_193],[n9_194, n8_194, n7_194],[n9_195, n8_195, n7_195],[n9_196, n8_196, n7_196],[n9_197, n8_197, n7_197],[n9_198, n8_198, n7_198],[n9_199, n8_199, n7_199],[n9_200, n8_200, n7_200],[n9_201, n8_201, n7_201],[n9_202, n8_202, n7_202],[n9_203, n8_203, n7_203],[n9_204, n8_204, n7_204],[n9_205, n8_205, n7_205],[n9_206, n8_206, n7_206],[n9_207, n8_207, n7_207],[n9_208, n8_208, n7_208],[n9_209, n8_209, n7_209],[n9_210, n8_210, n7_210],[n9_211, n8_211, n7_211],[n9_212, n8_212, n7_212],[n9_213, n8_213, n7_213],[n9_214, n8_214, n7_214],[n9_215, n8_215, n7_215],[n9_216, n8_216, n7_216],[n9_217, n8_217, n7_217],[n9_218, n8_218, n7_218],[n9_219, n8_219, n7_219],[n9_220, n8_220, n7_220],[n9_221, n8_221, n7_221],[n9_222, n8_222, n7_222],[n9_223, n8_223, n7_223],[n9_224, n8_224, n7_224],[n9_225, n8_225, n7_225],[n9_226, n8_226, n7_226],[n9_227, n8_227, n7_227],[n9_228, n8_228, n7_228],[n9_229, n8_229, n7_229],[n9_230, n8_230, n7_230],[n9_231, n8_231, n7_231],[n9_232, n8_232, n7_232],[n9_233, n8_233, n7_233],[n9_234, n8_234, n7_234],[n9_235, n8_235, n7_235],[n9_236, n8_236, n7_236],[n9_237, n8_237, n7_237],[n9_238, n8_238, n7_238],[n9_239, n8_239, n7_239],[n9_240, n8_240, n7_240],[n9_241, n8_241, n7_241],[n9_242, n8_242, n7_242],[n9_243, n8_243, n7_243],[n9_244, n8_244, n7_244],[n9_245, n8_245, n7_245],[n9_246, n8_246, n7_246],[n9_247, n8_247, n7_247],[n9_248, n8_248, n7_248],[n9_249, n8_249, n7_249],[n9_250, n8_250, n7_250],[n9_251, n8_251, n7_251],[n9_252, n8_252, n7_252],[n9_253, n8_253, n7_253],[n9_254, n8_254, n7_254],[n9_255, n8_255, n7_255],[n9_256, n8_256, n7_256],[n9_257, n8_257, n7_257],[n9_258, n8_258, n7_258],[n9_259, n8_259, n7_259],[n9_260, n8_260, n7_260],[n9_261, n8_261, n7_261],[n9_262, n8_262, n7_262],[n9_263, n8_263, n7_263],[n9_264, n8_264, n7_264],[n9_265, n8_265, n7_265],[n9_266, n8_266, n7_266],[n9_267, n8_267, n7_267],[n9_268, n8_268, n7_268],[n9_269, n8_269, n7_269],[n9_270, n8_270, n7_270],[n9_271, n8_271, n7_271],[n9_272, n8_272, n7_272],[n9_273, n8_273, n7_273],[n9_274, n8_274, n7_274],[n9_275, n8_275, n7_275],[n9_276, n8_276, n7_276],[n9_277, n8_277, n7_277],[n9_278, n8_278, n7_278],[n9_279, n8_279, n7_279],[n9_280, n8_280, n7_280],[n9_281, n8_281, n7_281],[n9_282, n8_282, n7_282],[n9_283, n8_283, n7_283],[n9_284, n8_284, n7_284],[n9_285, n8_285, n7_285],[n9_286, n8_286, n7_286],[n9_287, n8_287, n7_287],[n9_288, n8_288, n7_288],[n9_289, n8_289, n7_289],[n9_290, n8_290, n7_290],[n9_291, n8_291, n7_291],[n9_292, n8_292, n7_292],[n9_293, n8_293, n7_293],[n9_294, n8_294, n7_294],[n9_295, n8_295, n7_295],[n9_296, n8_296, n7_296],[n9_297, n8_297, n7_297],[n9_298, n8_298, n7_298],[n9_299, n8_299, n7_299],[n9_300, n8_300, n7_300],[n9_301, n8_301, n7_301],[n9_302, n8_302, n7_302],[n9_303, n8_303, n7_303],[n9_304, n8_304, n7_304],[n9_305, n8_305, n7_305],[n9_306, n8_306, n7_306],[n9_307, n8_307, n7_307],[n9_308, n8_308, n7_308],[n9_309, n8_309, n7_309],[n9_310, n8_310, n7_310],[n9_311, n8_311, n7_311],[n9_312, n8_312, n7_312],[n9_313, n8_313, n7_313],[n9_314, n8_314, n7_314],[n9_315, n8_315, n7_315],[n9_316, n8_316, n7_316],[n9_317, n8_317, n7_317],[n9_318, n8_318, n7_318],[n9_319, n8_319, n7_319],[n9_320, n8_320, n7_320],[n9_321, n8_321, n7_321],[n9_322, n8_322, n7_322],[n9_323, n8_323, n7_323],[n9_324, n8_324, n7_324],[n9_325, n8_325, n7_325],[n9_326, n8_326, n7_326],[n9_327, n8_327, n7_327],[n9_328, n8_328, n7_328],[n9_329, n8_329, n7_329],[n9_330, n8_330, n7_330],[n9_331, n8_331, n7_331],[n9_332, n8_332, n7_332],[n9_333, n8_333, n7_333],[n9_334, n8_334, n7_334],[n9_335, n8_335, n7_335],[n9_336, n8_336, n7_336],[n9_337, n8_337, n7_337],[n9_338, n8_338, n7_338],[n9_339, n8_339, n7_339],[n9_340, n8_340, n7_340],[n9_341, n8_341, n7_341],[n9_342, n8_342, n7_342],[n9_343, n8_343, n7_343],[n9_344, n8_344, n7_344],[n9_345, n8_345, n7_345],[n9_346, n8_346, n7_346],[n9_347, n8_347, n7_347],[n9_348, n8_348, n7_348],[n9_349, n8_349, n7_349],[n9_350, n8_350, n7_350],[n9_351, n8_351, n7_351],[n9_352, n8_352, n7_352],[n9_353, n8_353, n7_353],[n9_354, n8_354, n7_354],[n9_355, n8_355, n7_355],[n9_356, n8_356, n7_356],[n9_357, n8_357, n7_357],[n9_358, n8_358, n7_358],[n9_359, n8_359, n7_359],[n9_360, n8_360, n7_360],[n9_361, n8_361, n7_361],[n9_362, n8_362, n7_362],[n9_363, n8_363, n7_363],[n9_364, n8_364, n7_364],[n9_365, n8_365, n7_365],[n9_366, n8_366, n7_366],[n9_367, n8_367, n7_367],[n9_368, n8_368, n7_368],[n9_369, n8_369, n7_369],[n9_370, n8_370, n7_370],[n9_371, n8_371, n7_371],[n9_372, n8_372, n7_372],[n9_373, n8_373, n7_373],[n9_374, n8_374, n7_374],[n9_375, n8_375, n7_375],[n9_376, n8_376, n7_376],[n9_377, n8_377, n7_377],[n9_378, n8_378, n7_378],[n9_379, n8_379, n7_379],[n9_380, n8_380, n7_380],[n9_381, n8_381, n7_381],[n9_382, n8_382, n7_382],[n9_383, n8_383, n7_383],[n9_384, n8_384, n7_384],[n9_385, n8_385, n7_385],[n9_386, n8_386, n7_386],[n9_387, n8_387, n7_387],[n9_388, n8_388, n7_388],[n9_389, n8_389, n7_389],[n9_390, n8_390, n7_390],[n9_391, n8_391, n7_391],[n9_392, n8_392, n7_392],[n9_393, n8_393, n7_393],[n9_394, n8_394, n7_394],[n9_395, n8_395, n7_395],[n9_396, n8_396, n7_396],[n9_397, n8_397, n7_397],[n9_398, n8_398, n7_398],[n9_399, n8_399, n7_399],[n9_400, n8_400, n7_400],[n9_401, n8_401, n7_401],[n9_402, n8_402, n7_402],[n9_403, n8_403, n7_403],[n9_404, n8_404, n7_404],[n9_405, n8_405, n7_405],[n9_406, n8_406, n7_406],[n9_407, n8_407, n7_407],[n9_408, n8_408, n7_408],[n9_409, n8_409, n7_409],[n9_410, n8_410, n7_410],[n9_411, n8_411, n7_411],[n9_412, n8_412, n7_412],[n9_413, n8_413, n7_413],[n9_414, n8_414, n7_414],[n9_415, n8_415, n7_415],[n9_416, n8_416, n7_416],[n9_417, n8_417, n7_417],[n9_418, n8_418, n7_418],[n9_419, n8_419, n7_419],[n9_420, n8_420, n7_420],[n9_421, n8_421, n7_421],[n9_422, n8_422, n7_422],[n9_423, n8_423, n7_423],[n9_424, n8_424, n7_424],[n9_425, n8_425, n7_425],[n9_426, n8_426, n7_426],[n9_427, n8_427, n7_427],[n9_428, n8_428, n7_428],[n9_429, n8_429, n7_429],[n9_430, n8_430, n7_430],[n9_431, n8_431, n7_431],[n9_432, n8_432, n7_432],[n9_433, n8_433, n7_433],[n9_434, n8_434, n7_434],[n9_435, n8_435, n7_435],[n9_436, n8_436, n7_436],[n9_437, n8_437, n7_437],[n9_438, n8_438, n7_438],[n9_439, n8_439, n7_439],[n9_440, n8_440, n7_440],[n9_441, n8_441, n7_441],[n9_442, n8_442, n7_442],[n9_443, n8_443, n7_443],[n9_444, n8_444, n7_444],[n9_445, n8_445, n7_445],[n9_446, n8_446, n7_446],[n9_447, n8_447, n7_447],[n9_448, n8_448, n7_448],[n9_449, n8_449, n7_449],[n9_450, n8_450, n7_450],[n9_451, n8_451, n7_451],[n9_452, n8_452, n7_452],[n9_453, n8_453, n7_453],[n9_454, n8_454, n7_454],[n9_455, n8_455, n7_455],[n9_456, n8_456, n7_456],[n9_457, n8_457, n7_457],[n9_458, n8_458, n7_458],[n9_459, n8_459, n7_459],[n9_460, n8_460, n7_460],[n9_461, n8_461, n7_461],[n9_462, n8_462, n7_462],[n9_463, n8_463, n7_463],[n9_464, n8_464, n7_464],[n9_465, n8_465, n7_465],[n9_466, n8_466, n7_466],[n9_467, n8_467, n7_467],[n9_468, n8_468, n7_468],[n9_469, n8_469, n7_469],[n9_470, n8_470, n7_470],[n9_471, n8_471, n7_471],[n9_472, n8_472, n7_472],[n9_473, n8_473, n7_473],[n9_474, n8_474, n7_474],[n9_475, n8_475, n7_475],[n9_476, n8_476, n7_476],[n9_477, n8_477, n7_477],[n9_478, n8_478, n7_478],[n9_479, n8_479, n7_479],[n9_480, n8_480, n7_480],[n9_481, n8_481, n7_481],[n9_482, n8_482, n7_482],[n9_483, n8_483, n7_483],[n9_484, n8_484, n7_484],[n9_485, n8_485, n7_485],[n9_486, n8_486, n7_486],[n9_487, n8_487, n7_487],[n9_488, n8_488, n7_488],[n9_489, n8_489, n7_489],[n9_490, n8_490, n7_490],[n9_491, n8_491, n7_491],[n9_492, n8_492, n7_492],[n9_493, n8_493, n7_493],[n9_494, n8_494, n7_494],[n9_495, n8_495, n7_495],[n9_496, n8_496, n7_496],[n9_497, n8_497, n7_497],[n9_498, n8_498, n7_498],[n9_499, n8_499, n7_499],[n9_500, n8_500, n7_500],[n9_501, n8_501, n7_501],[n9_502, n8_502, n7_502],[n9_503, n8_503, n7_503],[n9_504, n8_504, n7_504],[n9_505, n8_505, n7_505],[n9_506, n8_506, n7_506],[n9_507, n8_507, n7_507],[n9_508, n8_508, n7_508],[n9_509, n8_509, n7_509],[n9_510, n8_510, n7_510],[n9_511, n8_511, n7_511],[n9_512, n8_512, n7_512],[n9_513, n8_513, n7_513],[n9_514, n8_514, n7_514],[n9_515, n8_515, n7_515],[n9_516, n8_516, n7_516],[n9_517, n8_517, n7_517],[n9_518, n8_518, n7_518],[n9_519, n8_519, n7_519],[n9_520, n8_520, n7_520],[n9_521, n8_521, n7_521],[n9_522, n8_522, n7_522],[n9_523, n8_523, n7_523],[n9_524, n8_524, n7_524],[n9_525, n8_525, n7_525],[n9_526, n8_526, n7_526],[n9_527, n8_527, n7_527],[n9_528, n8_528, n7_528],[n9_529, n8_529, n7_529],[n9_530, n8_530, n7_530],[n9_531, n8_531, n7_531],[n9_532, n8_532, n7_532],[n9_533, n8_533, n7_533],[n9_534, n8_534, n7_534],[n9_535, n8_535, n7_535],[n9_536, n8_536, n7_536],[n9_537, n8_537, n7_537],[n9_538, n8_538, n7_538],[n9_539, n8_539, n7_539],[n9_540, n8_540, n7_540],[n9_541, n8_541, n7_541],[n9_542, n8_542, n7_542],[n9_543, n8_543, n7_543],[n9_544, n8_544, n7_544],[n9_545, n8_545, n7_545],[n9_546, n8_546, n7_546],[n9_547, n8_547, n7_547],[n9_548, n8_548, n7_548],[n9_549, n8_549, n7_549],[n9_550, n8_550, n7_550],[n9_551, n8_551, n7_551],[n9_552, n8_552, n7_552],[n9_553, n8_553, n7_553],[n9_554, n8_554, n7_554],[n9_555, n8_555, n7_555],[n9_556, n8_556, n7_556],[n9_557, n8_557, n7_557],[n9_558, n8_558, n7_558],[n9_559, n8_559, n7_559],[n9_560, n8_560, n7_560],[n9_561, n8_561, n7_561],[n9_562, n8_562, n7_562],[n9_563, n8_563, n7_563],[n9_564, n8_564, n7_564],[n9_565, n8_565, n7_565],[n9_566, n8_566, n7_566],[n9_567, n8_567, n7_567],[n9_568, n8_568, n7_568],[n9_569, n8_569, n7_569],[n9_570, n8_570, n7_570],[n9_571, n8_571, n7_571],[n9_572, n8_572, n7_572],[n9_573, n8_573, n7_573],[n9_574, n8_574, n7_574],[n9_575, n8_575, n7_575],[n9_576, n8_576, n7_576],[n9_577, n8_577, n7_577],[n9_578, n8_578, n7_578],[n9_579, n8_579, n7_579],[n9_580, n8_580, n7_580],[n9_581, n8_581, n7_581],[n9_582, n8_582, n7_582],[n9_583, n8_583, n7_583],[n9_584, n8_584, n7_584],[n9_585, n8_585, n7_585],[n9_586, n8_586, n7_586],[n9_587, n8_587, n7_587],[n9_588, n8_588, n7_588],[n9_589, n8_589, n7_589],[n9_590, n8_590, n7_590],[n9_591, n8_591, n7_591],[n9_592, n8_592, n7_592],[n9_593, n8_593, n7_593],[n9_594, n8_594, n7_594],[n9_595, n8_595, n7_595],[n9_596, n8_596, n7_596],[n9_597, n8_597, n7_597],[n9_598, n8_598, n7_598],[n9_599, n8_599, n7_599],[n9_600, n8_600, n7_600],[n9_601, n8_601, n7_601],[n9_602, n8_602, n7_602],[n9_603, n8_603, n7_603],[n9_604, n8_604, n7_604],[n9_605, n8_605, n7_605],[n9_606, n8_606, n7_606],[n9_607, n8_607, n7_607],[n9_608, n8_608, n7_608],[n9_609, n8_609, n7_609],[n9_610, n8_610, n7_610],[n9_611, n8_611, n7_611],[n9_612, n8_612, n7_612],[n9_613, n8_613, n7_613],[n9_614, n8_614, n7_614],[n9_615, n8_615, n7_615],[n9_616, n8_616, n7_616],[n9_617, n8_617, n7_617],[n9_618, n8_618, n7_618],[n9_619, n8_619, n7_619],[n9_620, n8_620, n7_620],[n9_621, n8_621, n7_621],[n9_622, n8_622, n7_622],[n9_623, n8_623, n7_623],[n9_624, n8_624, n7_624],[n9_625, n8_625, n7_625],[n9_626, n8_626, n7_626],[n9_627, n8_627, n7_627],[n9_628, n8_628, n7_628],[n9_629, n8_629, n7_629],[n9_630, n8_630, n7_630],[n9_631, n8_631, n7_631],[n9_632, n8_632, n7_632],[n9_633, n8_633, n7_633],[n9_634, n8_634, n7_634],[n9_635, n8_635, n7_635],[n9_636, n8_636, n7_636],[n9_637, n8_637, n7_637],[n9_638, n8_638, n7_638],[n9_639, n8_639, n7_639],[n9_640, n8_640, n7_640],[n9_641, n8_641, n7_641],[n9_642, n8_642, n7_642],[n9_643, n8_643, n7_643],[n9_644, n8_644, n7_644],[n9_645, n8_645, n7_645],[n9_646, n8_646, n7_646],[n9_647, n8_647, n7_647],[n9_648, n8_648, n7_648],[n9_649, n8_649, n7_649],[n9_650, n8_650, n7_650],[n9_651, n8_651, n7_651],[n9_652, n8_652, n7_652],[n9_653, n8_653, n7_653],[n9_654, n8_654, n7_654],[n9_655, n8_655, n7_655],[n9_656, n8_656, n7_656],[n9_657, n8_657, n7_657],[n9_658, n8_658, n7_658],[n9_659, n8_659, n7_659],[n9_660, n8_660, n7_660],[n9_661, n8_661, n7_661],[n9_662, n8_662, n7_662],[n9_663, n8_663, n7_663],[n9_664, n8_664, n7_664],[n9_665, n8_665, n7_665],[n9_666, n8_666, n7_666],[n9_667, n8_667, n7_667],[n9_668, n8_668, n7_668],[n9_669, n8_669, n7_669],[n9_670, n8_670, n7_670],[n9_671, n8_671, n7_671],[n9_672, n8_672, n7_672],[n9_673, n8_673, n7_673],[n9_674, n8_674, n7_674],[n9_675, n8_675, n7_675],[n9_676, n8_676, n7_676],[n9_677, n8_677, n7_677],[n9_678, n8_678, n7_678],[n9_679, n8_679, n7_679],[n9_680, n8_680, n7_680],[n9_681, n8_681, n7_681],[n9_682, n8_682, n7_682],[n9_683, n8_683, n7_683],[n9_684, n8_684, n7_684],[n9_685, n8_685, n7_685],[n9_686, n8_686, n7_686],[n9_687, n8_687, n7_687],[n9_688, n8_688, n7_688],[n9_689, n8_689, n7_689],[n9_690, n8_690, n7_690],[n9_691, n8_691, n7_691],[n9_692, n8_692, n7_692],[n9_693, n8_693, n7_693],[n9_694, n8_694, n7_694],[n9_695, n8_695, n7_695],[n9_696, n8_696, n7_696],[n9_697, n8_697, n7_697],[n9_698, n8_698, n7_698],[n9_699, n8_699, n7_699],[n9_700, n8_700, n7_700],[n9_701, n8_701, n7_701],[n9_702, n8_702, n7_702],[n9_703, n8_703, n7_703],[n9_704, n8_704, n7_704],[n9_705, n8_705, n7_705],[n9_706, n8_706, n7_706],[n9_707, n8_707, n7_707],[n9_708, n8_708, n7_708],[n9_709, n8_709, n7_709],[n9_710, n8_710, n7_710],[n9_711, n8_711, n7_711],[n9_712, n8_712, n7_712],[n9_713, n8_713, n7_713],[n9_714, n8_714, n7_714],[n9_715, n8_715, n7_715],[n9_716, n8_716, n7_716],[n9_717, n8_717, n7_717],[n9_718, n8_718, n7_718],[n9_719, n8_719, n7_719],[n9_720, n8_720, n7_720],[n9_721, n8_721, n7_721],[n9_722, n8_722, n7_722],[n9_723, n8_723, n7_723],[n9_724, n8_724, n7_724],[n9_725, n8_725, n7_725],[n9_726, n8_726, n7_726],[n9_727, n8_727, n7_727],[n9_728, n8_728, n7_728],[n9_729, n8_729, n7_729],[n9_730, n8_730, n7_730],[n9_731, n8_731, n7_731],[n9_732, n8_732, n7_732],[n9_733, n8_733, n7_733],[n9_734, n8_734, n7_734],[n9_735, n8_735, n7_735],[n9_736, n8_736, n7_736],[n9_737, n8_737, n7_737],[n9_738, n8_738, n7_738],[n9_739, n8_739, n7_739],[n9_740, n8_740, n7_740],[n9_741, n8_741, n7_741],[n9_742, n8_742, n7_742],[n9_743, n8_743, n7_743],[n9_744, n8_744, n7_744],[n9_745, n8_745, n7_745],[n9_746, n8_746, n7_746],[n9_747, n8_747, n7_747],[n9_748, n8_748, n7_748],[n9_749, n8_749, n7_749],[n9_750, n8_750, n7_750],[n9_751, n8_751, n7_751],[n9_752, n8_752, n7_752],[n9_753, n8_753, n7_753],[n9_754, n8_754, n7_754],[n9_755, n8_755, n7_755],[n9_756, n8_756, n7_756],[n9_757, n8_757, n7_757],[n9_758, n8_758, n7_758],[n9_759, n8_759, n7_759],[n9_760, n8_760, n7_760],[n9_761, n8_761, n7_761],[n9_762, n8_762, n7_762],[n9_763, n8_763, n7_763],[n9_764, n8_764, n7_764],[n9_765, n8_765, n7_765],[n9_766, n8_766, n7_766],[n9_767, n8_767, n7_767],[n9_768, n8_768, n7_768],[n9_769, n8_769, n7_769],[n9_770, n8_770, n7_770],[n9_771, n8_771, n7_771],[n9_772, n8_772, n7_772],[n9_773, n8_773, n7_773],[n9_774, n8_774, n7_774],[n9_775, n8_775, n7_775],[n9_776, n8_776, n7_776],[n9_777, n8_777, n7_777],[n9_778, n8_778, n7_778],[n9_779, n8_779, n7_779],[n9_780, n8_780, n7_780],[n9_781, n8_781, n7_781],[n9_782, n8_782, n7_782],[n9_783, n8_783, n7_783],[n9_784, n8_784, n7_784],[n9_785, n8_785, n7_785],[n9_786, n8_786, n7_786],[n9_787, n8_787, n7_787],[n9_788, n8_788, n7_788],[n9_789, n8_789, n7_789],[n9_790, n8_790, n7_790],[n9_791, n8_791, n7_791],[n9_792, n8_792, n7_792],[n9_793, n8_793, n7_793],[n9_794, n8_794, n7_794],[n9_795, n8_795, n7_795],[n9_796, n8_796, n7_796],[n9_797, n8_797, n7_797],[n9_798, n8_798, n7_798],[n9_799, n8_799, n7_799],[n9_800, n8_800, n7_800],[n9_801, n8_801, n7_801],[n9_802, n8_802, n7_802],[n9_803, n8_803, n7_803],[n9_804, n8_804, n7_804],[n9_805, n8_805, n7_805],[n9_806, n8_806, n7_806],[n9_807, n8_807, n7_807],[n9_808, n8_808, n7_808],[n9_809, n8_809, n7_809],[n9_810, n8_810, n7_810],[n9_811, n8_811, n7_811],[n9_812, n8_812, n7_812],[n9_813, n8_813, n7_813],[n9_814, n8_814, n7_814],[n9_815, n8_815, n7_815],[n9_816, n8_816, n7_816],[n9_817, n8_817, n7_817],[n9_818, n8_818, n7_818],[n9_819, n8_819, n7_819],[n9_820, n8_820, n7_820],[n9_821, n8_821, n7_821],[n9_822, n8_822, n7_822],[n9_823, n8_823, n7_823],[n9_824, n8_824, n7_824],[n9_825, n8_825, n7_825],[n9_826, n8_826, n7_826],[n9_827, n8_827, n7_827],[n9_828, n8_828, n7_828],[n9_829, n8_829, n7_829],[n9_830, n8_830, n7_830],[n9_831, n8_831, n7_831],[n9_832, n8_832, n7_832],[n9_833, n8_833, n7_833],[n9_834, n8_834, n7_834],[n9_835, n8_835, n7_835],[n9_836, n8_836, n7_836],[n9_837, n8_837, n7_837],[n9_838, n8_838, n7_838],[n9_839, n8_839, n7_839],[n9_840, n8_840, n7_840],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-25 18:43:58] [INFO ] Flatten gal took : 66 ms
[2024-05-25 18:43:58] [INFO ] Time to serialize gal into /tmp/LTLFireability3734396302850009560.gal : 9 ms
[2024-05-25 18:43:58] [INFO ] Time to serialize properties into /tmp/LTLFireability608754924052274438.ltl : 4 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/LTLFireability3734396302850009560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability608754924052274438.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...296
Read 2 LTL properties
Checking formula 0 : !((G(("((((((s6_19<1)&&(s6_18<1))&&((s6_17<1)&&(s6_16<1)))&&(((s6_23<1)&&(s6_22<1))&&((s6_21<1)&&(s6_20<1))))&&((((s6_11<1)&&(s6_10<1)...2826
Formula 0 simplified : F(!"((((((s6_19<1)&&(s6_18<1))&&((s6_17<1)&&(s6_16<1)))&&(((s6_23<1)&&(s6_22<1))&&((s6_21<1)&&(s6_20<1))))&&((((s6_11<1)&&(s6_10<1))...2815
ITS-tools command line returned an error code 137
[2024-05-25 18:54:47] [INFO ] Flatten gal took : 65 ms
[2024-05-25 18:54:47] [INFO ] Input system was already deterministic with 446 transitions.
[2024-05-25 18:54:47] [INFO ] Transformed 2936 places.
[2024-05-25 18:54:47] [INFO ] Transformed 446 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-25 18:54:47] [INFO ] Time to serialize gal into /tmp/LTLFireability9296832194894559848.gal : 6 ms
[2024-05-25 18:54:47] [INFO ] Time to serialize properties into /tmp/LTLFireability14508071302964217748.ltl : 3 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/LTLFireability9296832194894559848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14508071302964217748.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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("((((((s6_19<1)&&(s6_18<1))&&((s6_17<1)&&(s6_16<1)))&&(((s6_23<1)&&(s6_22<1))&&((s6_21<1)&&(s6_20<1))))&&((((s6_11<1)&&(s6_10<1)...2826
Formula 0 simplified : F(!"((((((s6_19<1)&&(s6_18<1))&&((s6_17<1)&&(s6_16<1)))&&(((s6_23<1)&&(s6_22<1))&&((s6_21<1)&&(s6_20<1))))&&((((s6_11<1)&&(s6_10<1))...2815
ITS-tools command line returned an error code 137
Total runtime 3452983 ms.
BK_STOP 1716664161809
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="QuasiCertifProtocol-COL-28"
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 QuasiCertifProtocol-COL-28, 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 r312-tall-171662337700044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-28.tgz
mv QuasiCertifProtocol-COL-28 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 ;