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 |
| 16221.491 | 3600000.00 | 3315567.00 | 567899.50 | FTF?FTTFFT?FFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r293-tall-167873946000843.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is QuasiCertifProtocol-COL-28, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873946000843
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 120K Mar 5 18:23 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-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678986158288
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-28
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-16 17:02:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 17:02:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 17:02:39] [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.
[2023-03-16 17:02:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 17:02:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 475 ms
[2023-03-16 17:02:40] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 17:02:40] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2023-03-16 17:02:40] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-14 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).
Incomplete random walk after 10025 steps, including 252 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-16 17:02:41] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-16 17:02:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 17:02:41] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-16 17:02:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-16 17:02:41] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-16 17:02:41] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-16 17:02:41] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 220 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=73 )
Parikh walk visited 2 properties in 4 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 17:02:41] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-16 17:02:41] [INFO ] Flatten gal took : 24 ms
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 17:02:41] [INFO ] Flatten gal took : 5 ms
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2023-03-16 17:02:41] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 29 ms.
[2023-03-16 17:02:41] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 1978 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2997 transition count 446
Applied a total of 1 rules in 131 ms. Remains 2997 /2998 variables (removed 1) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2997 cols
[2023-03-16 17:02:41] [INFO ] Computed 2552 place invariants in 148 ms
[2023-03-16 17:02:43] [INFO ] Implicit Places using invariants in 2155 ms returned []
[2023-03-16 17:02:43] [INFO ] Invariant cache hit.
[2023-03-16 17:02:46] [INFO ] Implicit Places using invariants and state equation in 3153 ms returned []
Implicit Place search using SMT with State Equation took 5311 ms to find 0 implicit places.
[2023-03-16 17:02:46] [INFO ] Invariant cache hit.
[2023-03-16 17:02:48] [INFO ] Dead Transitions using invariants and state equation in 1134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2997/2998 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6577 ms. Remains : 2997/2998 places, 446/446 transitions.
Support contains 1978 out of 2997 places after structural reductions.
[2023-03-16 17:02:48] [INFO ] Flatten gal took : 164 ms
[2023-03-16 17:02:48] [INFO ] Flatten gal took : 114 ms
[2023-03-16 17:02:48] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 10000 steps, including 299 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-16 17:02:49] [INFO ] Invariant cache hit.
[2023-03-16 17:02:50] [INFO ] After 781ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-16 17:02:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 36 ms returned sat
[2023-03-16 17:02:51] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 501 ms returned sat
[2023-03-16 17:03:14] [INFO ] After 22309ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-16 17:03:15] [INFO ] After 23259ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 17:03:15] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 12 Parikh solutions to 11 different solutions.
Finished Parikh walk after 172 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=57 )
Parikh walk visited 11 properties in 40 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 2997 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2997 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 900 out of 2997 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2965 transition count 446
Applied a total of 32 rules in 114 ms. Remains 2965 /2997 variables (removed 32) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2965 cols
[2023-03-16 17:03:16] [INFO ] Computed 2521 place invariants in 67 ms
[2023-03-16 17:03:18] [INFO ] Implicit Places using invariants in 2578 ms returned []
[2023-03-16 17:03:18] [INFO ] Invariant cache hit.
[2023-03-16 17:03:22] [INFO ] Implicit Places using invariants and state equation in 4305 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 6897 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2936/2997 places, 446/446 transitions.
Applied a total of 0 rules in 108 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7119 ms. Remains : 2936/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GT (ADD s842 s843 s844 s845 s846 s847 s848 s849 s850 s851 s852 s853 s854 s855 s856 s857 s858 s859 s860 s861 s862 s863 s864 s865 s866 s867 s868 s86...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-02 finished in 7466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 30 out of 2997 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2937 transition count 446
Applied a total of 60 rules in 272 ms. Remains 2937 /2997 variables (removed 60) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2023-03-16 17:03:23] [INFO ] Computed 2492 place invariants in 39 ms
[2023-03-16 17:03:27] [INFO ] Implicit Places using invariants in 4315 ms returned []
[2023-03-16 17:03:27] [INFO ] Invariant cache hit.
[2023-03-16 17:03:36] [INFO ] Implicit Places using invariants and state equation in 8329 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 12646 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2997 places, 446/446 transitions.
Applied a total of 0 rules in 151 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13069 ms. Remains : 2908/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s2524 s2525 s2526 s2527 s2528 s2529 s2530 s2531 s2532 s2533 s2534 s2535 s2536 s2537 s2538 s2539 s2540 s2541 s2542 s2543 s2544 s2545 s2546 s25...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3023 reset in 450 ms.
Product exploration explored 100000 steps with 3025 reset in 421 ms.
Computed a total of 2908 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2908 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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2857 steps, run visited all 1 properties in 20 ms. (steps per millisecond=142 )
Probabilistic random walk after 2857 steps, saw 2796 distinct states, run finished after 21 ms. (steps per millisecond=136 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 2908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2908/2908 places, 446/446 transitions.
Applied a total of 0 rules in 178 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2908 cols
[2023-03-16 17:03:38] [INFO ] Computed 2464 place invariants in 77 ms
[2023-03-16 17:03:42] [INFO ] Implicit Places using invariants in 4140 ms returned []
[2023-03-16 17:03:42] [INFO ] Invariant cache hit.
[2023-03-16 17:03:50] [INFO ] Implicit Places using invariants and state equation in 7792 ms returned []
Implicit Place search using SMT with State Equation took 11936 ms to find 0 implicit places.
[2023-03-16 17:03:50] [INFO ] Invariant cache hit.
[2023-03-16 17:03:51] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13238 ms. Remains : 2908/2908 places, 446/446 transitions.
Computed a total of 2908 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2908 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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 301 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2857 steps, run visited all 1 properties in 25 ms. (steps per millisecond=114 )
Probabilistic random walk after 2857 steps, saw 2796 distinct states, run finished after 25 ms. (steps per millisecond=114 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3019 reset in 355 ms.
Product exploration explored 100000 steps with 3024 reset in 375 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 2908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2908/2908 places, 446/446 transitions.
Graph (complete) has 28339 edges and 2908 vertex of which 269 are kept as prefixes of interest. Removing 2639 places using SCC suffix rule.30 ms
Discarding 2639 places :
Also discarding 145 output transitions
Drop transitions removed 145 transitions
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 269 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 269 transition count 188
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 118 rules in 75 ms. Remains 269 /2908 variables (removed 2639) and now considering 188/446 (removed 258) transitions.
[2023-03-16 17:03:54] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 188 rows 269 cols
[2023-03-16 17:03:54] [INFO ] Computed 84 place invariants in 1 ms
[2023-03-16 17:03:54] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 269/2908 places, 188/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 269/2908 places, 188/446 transitions.
Built C files in :
/tmp/ltsmin13240475334229578753
[2023-03-16 17:03:54] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13240475334229578753
Running compilation step : cd /tmp/ltsmin13240475334229578753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1849 ms.
Running link step : cd /tmp/ltsmin13240475334229578753;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 709 ms.
Running LTSmin : cd /tmp/ltsmin13240475334229578753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2787603759349255408.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 2908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2908/2908 places, 446/446 transitions.
Applied a total of 0 rules in 205 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2908 cols
[2023-03-16 17:04:10] [INFO ] Computed 2464 place invariants in 56 ms
[2023-03-16 17:04:14] [INFO ] Implicit Places using invariants in 4253 ms returned []
[2023-03-16 17:04:14] [INFO ] Invariant cache hit.
[2023-03-16 17:04:22] [INFO ] Implicit Places using invariants and state equation in 7699 ms returned []
Implicit Place search using SMT with State Equation took 11953 ms to find 0 implicit places.
[2023-03-16 17:04:22] [INFO ] Invariant cache hit.
[2023-03-16 17:04:23] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13183 ms. Remains : 2908/2908 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin2086090861733952790
[2023-03-16 17:04:23] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2086090861733952790
Running compilation step : cd /tmp/ltsmin2086090861733952790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1691 ms.
Running link step : cd /tmp/ltsmin2086090861733952790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2086090861733952790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3628268346123976421.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 17:04:38] [INFO ] Flatten gal took : 72 ms
[2023-03-16 17:04:38] [INFO ] Flatten gal took : 68 ms
[2023-03-16 17:04:38] [INFO ] Time to serialize gal into /tmp/LTL17514998750159814184.gal : 14 ms
[2023-03-16 17:04:38] [INFO ] Time to serialize properties into /tmp/LTL7668550889539181513.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17514998750159814184.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14788499740575441432.hoa' '-atoms' '/tmp/LTL7668550889539181513.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7668550889539181513.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14788499740575441432.hoa
Detected timeout of ITS tools.
[2023-03-16 17:04:53] [INFO ] Flatten gal took : 65 ms
[2023-03-16 17:04:53] [INFO ] Flatten gal took : 64 ms
[2023-03-16 17:04:53] [INFO ] Time to serialize gal into /tmp/LTL990672214316201459.gal : 11 ms
[2023-03-16 17:04:53] [INFO ] Time to serialize properties into /tmp/LTL8763203606586438438.ltl : 13 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL990672214316201459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8763203606586438438.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+(((n6_8+n6_9)+(n6_10+n6_11))+((n6_12+n6_13)+(n6_14+n6_15))))+((((n6_1...266
Formula 0 simplified : XF!"((((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+(((n6_8+n6_9)+(n6_10+n6_11))+((n6_12+n6_13)+(n6_14+n6_15))))+((((n6_16+...260
Detected timeout of ITS tools.
[2023-03-16 17:05:08] [INFO ] Flatten gal took : 70 ms
[2023-03-16 17:05:08] [INFO ] Applying decomposition
[2023-03-16 17:05:09] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4957778579673373764.txt' '-o' '/tmp/graph4957778579673373764.bin' '-w' '/tmp/graph4957778579673373764.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4957778579673373764.bin' '-l' '-1' '-v' '-w' '/tmp/graph4957778579673373764.weights' '-q' '0' '-e' '0.001'
[2023-03-16 17:05:09] [INFO ] Decomposing Gal with order
[2023-03-16 17:05:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 17:05:09] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-16 17:05:09] [INFO ] Flatten gal took : 399 ms
[2023-03-16 17:05:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 413 labels/synchronizations in 203 ms.
[2023-03-16 17:05:10] [INFO ] Time to serialize gal into /tmp/LTL4030468010388853391.gal : 36 ms
[2023-03-16 17:05:10] [INFO ] Time to serialize properties into /tmp/LTL15203753835148776399.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4030468010388853391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15203753835148776399.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((gu137.n6_0+gu137.n6_1)+(gu137.n6_2+gu137.n6_3))+((gu137.n6_4+gu137.n6_5)+(gu137.n6_6+gu137.n6_7)))+(((gu137.n6_8+gu137.n...446
Formula 0 simplified : XF!"((((((gu137.n6_0+gu137.n6_1)+(gu137.n6_2+gu137.n6_3))+((gu137.n6_4+gu137.n6_5)+(gu137.n6_6+gu137.n6_7)))+(((gu137.n6_8+gu137.n6_...440
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11677615624323279170
[2023-03-16 17:05:25] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11677615624323279170
Running compilation step : cd /tmp/ltsmin11677615624323279170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1842 ms.
Running link step : cd /tmp/ltsmin11677615624323279170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11677615624323279170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-03 finished in 137646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 58 out of 2997 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30288 edges and 2997 vertex of which 2964 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.30 ms
Discarding 33 places :
Also discarding 2 output transitions
Drop transitions 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2961 transition count 441
Applied a total of 5 rules in 453 ms. Remains 2961 /2997 variables (removed 36) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2961 cols
[2023-03-16 17:05:41] [INFO ] Computed 2522 place invariants in 19 ms
[2023-03-16 17:05:45] [INFO ] Implicit Places using invariants in 4092 ms returned []
[2023-03-16 17:05:45] [INFO ] Invariant cache hit.
[2023-03-16 17:05:53] [INFO ] Implicit Places using invariants and state equation in 7607 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 11703 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2903/2997 places, 441/446 transitions.
Applied a total of 0 rules in 190 ms. Remains 2903 /2903 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12346 ms. Remains : 2903/2997 places, 441/446 transitions.
Stuttering acceptance computed with spot in 402 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s2843 s2844 s2845 s2846 s2847 s2848 s2849 s2850 s2851 s2852 s2853 s2854 s2855 s2856 s2857 s2858 s2859 s2860 s2861 s2862 s2863 s2864 s2865 s286...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-04 finished in 12770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 29 out of 2997 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30288 edges and 2997 vertex of which 2906 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.8 ms
Discarding 91 places :
Also discarding 2 output transitions
Drop transitions 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 0 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 361 ms. Remains 2903 /2997 variables (removed 94) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2023-03-16 17:05:54] [INFO ] Computed 2464 place invariants in 58 ms
[2023-03-16 17:05:58] [INFO ] Implicit Places using invariants in 4365 ms returned []
[2023-03-16 17:05:58] [INFO ] Invariant cache hit.
[2023-03-16 17:06:06] [INFO ] Implicit Places using invariants and state equation in 7849 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 12223 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2997 places, 441/446 transitions.
Applied a total of 0 rules in 173 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12758 ms. Remains : 2845/2997 places, 441/446 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 (ADD s2814 s2815 s2816 s2817 s2818 s2819 s2820 s2821 s2822 s2823 s2824 s2825 s2826 s2827 s2828 s2829 s2830 s2831 s2832 s2833 s2834 s2835 s2836 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2809 reset in 425 ms.
Product exploration explored 100000 steps with 2816 reset in 415 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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 273 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-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-05 finished in 14336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 29 out of 2997 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2936 transition count 446
Applied a total of 61 rules in 174 ms. Remains 2936 /2997 variables (removed 61) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 17:06:08] [INFO ] Computed 2492 place invariants in 48 ms
[2023-03-16 17:06:12] [INFO ] Implicit Places using invariants in 4320 ms returned []
[2023-03-16 17:06:12] [INFO ] Invariant cache hit.
[2023-03-16 17:06:21] [INFO ] Implicit Places using invariants and state equation in 8670 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 12994 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2997 places, 446/446 transitions.
Applied a total of 0 rules in 156 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 13324 ms. Remains : 2907/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s2872 s2873 s2874 s2875 s2876 s2877 s2878 s2879 s2880 s2881 s2882 s2883 s2884 s2885 s2886 s2887 s2888 s2889 s2890 s2891 s2892 s2893 s2894 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-07 finished in 13411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 88 out of 2997 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2937 transition count 446
Applied a total of 60 rules in 152 ms. Remains 2937 /2997 variables (removed 60) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2023-03-16 17:06:21] [INFO ] Computed 2493 place invariants in 66 ms
[2023-03-16 17:06:25] [INFO ] Implicit Places using invariants in 4209 ms returned []
[2023-03-16 17:06:25] [INFO ] Invariant cache hit.
[2023-03-16 17:06:34] [INFO ] Implicit Places using invariants and state equation in 8654 ms returned []
Implicit Place search using SMT with State Equation took 12866 ms to find 0 implicit places.
[2023-03-16 17:06:34] [INFO ] Invariant cache hit.
[2023-03-16 17:06:35] [INFO ] Dead Transitions using invariants and state equation in 1089 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2937/2997 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14109 ms. Remains : 2937/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GT 2 (ADD s2902 s2903 s2904 s2905 s2906 s2907 s2908 s2909 s2910 s2911 s2912 s2913 s2914 s2915 s2916 s2917 s2918 s2919 s2920 s2921 s2922 s2923 s29...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-08 finished in 14275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0||F(p1)))||F((p0&&X(X(G(p0))))))))'
Support contains 30 out of 2997 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30288 edges and 2997 vertex of which 2936 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.7 ms
Discarding 61 places :
Also discarding 2 output transitions
Drop transitions 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2933 transition count 441
Applied a total of 5 rules in 357 ms. Remains 2933 /2997 variables (removed 64) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2933 cols
[2023-03-16 17:06:36] [INFO ] Computed 2494 place invariants in 19 ms
[2023-03-16 17:06:40] [INFO ] Implicit Places using invariants in 4490 ms returned []
[2023-03-16 17:06:40] [INFO ] Invariant cache hit.
[2023-03-16 17:06:46] [INFO ] Implicit Places using invariants and state equation in 6283 ms returned []
Implicit Place search using SMT with State Equation took 10787 ms to find 0 implicit places.
[2023-03-16 17:06:46] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-16 17:06:46] [INFO ] Invariant cache hit.
[2023-03-16 17:06:48] [INFO ] Dead Transitions using invariants and state equation in 1062 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2933/2997 places, 441/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12260 ms. Remains : 2933/2997 places, 441/446 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (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-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 1 s1), p1:(LEQ 2 (ADD s2902 s2903 s2904 s2905 s2906 s2907 s2908 s2909 s2910 s2911 s2912 s2913 s2914 s2915 s2916 s2917 s2918 s2919 s2920 s2921 s292...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 6898 reset in 634 ms.
Product exploration explored 100000 steps with 7036 reset in 702 ms.
Computed a total of 2933 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2933 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 p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 240 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 628 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-16 17:06:51] [INFO ] Invariant cache hit.
[2023-03-16 17:06:52] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2023-03-16 17:07:02] [INFO ] [Real]Absence check using 1 positive and 2493 generalized place invariants in 10371 ms returned sat
[2023-03-16 17:07:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:07:06] [INFO ] [Real]Absence check using state equation in 3805 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 30 out of 2933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2933/2933 places, 441/441 transitions.
Applied a total of 0 rules in 173 ms. Remains 2933 /2933 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2023-03-16 17:07:06] [INFO ] Invariant cache hit.
[2023-03-16 17:07:11] [INFO ] Implicit Places using invariants in 4421 ms returned []
[2023-03-16 17:07:11] [INFO ] Invariant cache hit.
[2023-03-16 17:07:17] [INFO ] Implicit Places using invariants and state equation in 6294 ms returned []
Implicit Place search using SMT with State Equation took 10719 ms to find 0 implicit places.
[2023-03-16 17:07:17] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-16 17:07:17] [INFO ] Invariant cache hit.
[2023-03-16 17:07:18] [INFO ] Dead Transitions using invariants and state equation in 1074 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12001 ms. Remains : 2933/2933 places, 441/441 transitions.
Computed a total of 2933 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2933 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 p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 278 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 308 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-16 17:07:20] [INFO ] Invariant cache hit.
[2023-03-16 17:07:21] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-03-16 17:07:31] [INFO ] [Real]Absence check using 1 positive and 2493 generalized place invariants in 10263 ms returned sat
[2023-03-16 17:07:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:07:35] [INFO ] [Real]Absence check using state equation in 3957 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6949 reset in 604 ms.
Product exploration explored 100000 steps with 6973 reset in 638 ms.
Built C files in :
/tmp/ltsmin14968415737049857820
[2023-03-16 17:07:37] [INFO ] Computing symmetric may disable matrix : 441 transitions.
[2023-03-16 17:07:37] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:07:37] [INFO ] Computing symmetric may enable matrix : 441 transitions.
[2023-03-16 17:07:37] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:07:37] [INFO ] Computing Do-Not-Accords matrix : 441 transitions.
[2023-03-16 17:07:37] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:07:37] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14968415737049857820
Running compilation step : cd /tmp/ltsmin14968415737049857820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2403 ms.
Running link step : cd /tmp/ltsmin14968415737049857820;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin14968415737049857820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2900776432242238182.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 2933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2933/2933 places, 441/441 transitions.
Applied a total of 0 rules in 187 ms. Remains 2933 /2933 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2023-03-16 17:07:52] [INFO ] Invariant cache hit.
[2023-03-16 17:07:56] [INFO ] Implicit Places using invariants in 4227 ms returned []
[2023-03-16 17:07:56] [INFO ] Invariant cache hit.
[2023-03-16 17:08:02] [INFO ] Implicit Places using invariants and state equation in 6082 ms returned []
Implicit Place search using SMT with State Equation took 10319 ms to find 0 implicit places.
[2023-03-16 17:08:02] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-16 17:08:02] [INFO ] Invariant cache hit.
[2023-03-16 17:08:03] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11604 ms. Remains : 2933/2933 places, 441/441 transitions.
Built C files in :
/tmp/ltsmin4698965297258312606
[2023-03-16 17:08:03] [INFO ] Computing symmetric may disable matrix : 441 transitions.
[2023-03-16 17:08:03] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:08:03] [INFO ] Computing symmetric may enable matrix : 441 transitions.
[2023-03-16 17:08:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:08:03] [INFO ] Computing Do-Not-Accords matrix : 441 transitions.
[2023-03-16 17:08:03] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:08:03] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4698965297258312606
Running compilation step : cd /tmp/ltsmin4698965297258312606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2013 ms.
Running link step : cd /tmp/ltsmin4698965297258312606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4698965297258312606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9145953645039150490.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 17:08:18] [INFO ] Flatten gal took : 79 ms
[2023-03-16 17:08:18] [INFO ] Flatten gal took : 71 ms
[2023-03-16 17:08:18] [INFO ] Time to serialize gal into /tmp/LTL3026200330956025493.gal : 8 ms
[2023-03-16 17:08:18] [INFO ] Time to serialize properties into /tmp/LTL17713579311391707213.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3026200330956025493.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11010816961286614152.hoa' '-atoms' '/tmp/LTL17713579311391707213.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17713579311391707213.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11010816961286614152.hoa
Detected timeout of ITS tools.
[2023-03-16 17:08:34] [INFO ] Flatten gal took : 60 ms
[2023-03-16 17:08:34] [INFO ] Flatten gal took : 60 ms
[2023-03-16 17:08:34] [INFO ] Time to serialize gal into /tmp/LTL5595583480260461998.gal : 8 ms
[2023-03-16 17:08:34] [INFO ] Time to serialize properties into /tmp/LTL11383656311338738131.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5595583480260461998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11383656311338738131.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(("(SstopAbort_0>=1)")||(F("((((((SstopOK_0+SstopOK_1)+(SstopOK_2+SstopOK_3))+((SstopOK_4+SstopOK_5)+(SstopOK_6+SstopOK_7)))+((...493
Formula 0 simplified : F(X(!"(SstopAbort_0>=1)" & G!"((((((SstopOK_0+SstopOK_1)+(SstopOK_2+SstopOK_3))+((SstopOK_4+SstopOK_5)+(SstopOK_6+SstopOK_7)))+(((Ss...477
Detected timeout of ITS tools.
[2023-03-16 17:08:49] [INFO ] Flatten gal took : 59 ms
[2023-03-16 17:08:49] [INFO ] Applying decomposition
[2023-03-16 17:08:49] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15583029919941787376.txt' '-o' '/tmp/graph15583029919941787376.bin' '-w' '/tmp/graph15583029919941787376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15583029919941787376.bin' '-l' '-1' '-v' '-w' '/tmp/graph15583029919941787376.weights' '-q' '0' '-e' '0.001'
[2023-03-16 17:08:49] [INFO ] Decomposing Gal with order
[2023-03-16 17:08:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 17:08:49] [INFO ] Removed a total of 46 redundant transitions.
[2023-03-16 17:08:49] [INFO ] Flatten gal took : 144 ms
[2023-03-16 17:08:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 15 ms.
[2023-03-16 17:08:49] [INFO ] Time to serialize gal into /tmp/LTL7051342175731389803.gal : 12 ms
[2023-03-16 17:08:49] [INFO ] Time to serialize properties into /tmp/LTL15853309518605236119.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7051342175731389803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15853309518605236119.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(("(gi0.gu0.SstopAbort_0>=1)")||(F("((((((gu59.SstopOK_0+gu59.SstopOK_1)+(gu59.SstopOK_2+gu59.SstopOK_3))+((gu59.SstopOK_4+gu59...662
Formula 0 simplified : F(X(!"(gi0.gu0.SstopAbort_0>=1)" & G!"((((((gu59.SstopOK_0+gu59.SstopOK_1)+(gu59.SstopOK_2+gu59.SstopOK_3))+((gu59.SstopOK_4+gu59.Ss...646
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8100573873286157514
[2023-03-16 17:09:04] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8100573873286157514
Running compilation step : cd /tmp/ltsmin8100573873286157514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1737 ms.
Running link step : cd /tmp/ltsmin8100573873286157514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8100573873286157514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(((LTLAPp0==true)||<>((LTLAPp1==true))))||<>(((LTLAPp0==true)&&X(X([]((LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-10 finished in 164200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2997 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30288 edges and 2997 vertex of which 2906 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.10 ms
Discarding 91 places :
Also discarding 2 output transitions
Drop transitions 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 0 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 356 ms. Remains 2903 /2997 variables (removed 94) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2023-03-16 17:09:20] [INFO ] Computed 2464 place invariants in 48 ms
[2023-03-16 17:09:24] [INFO ] Implicit Places using invariants in 4020 ms returned []
[2023-03-16 17:09:24] [INFO ] Invariant cache hit.
[2023-03-16 17:09:31] [INFO ] Implicit Places using invariants and state equation in 6788 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 10815 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2997 places, 441/446 transitions.
Applied a total of 0 rules in 162 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11334 ms. Remains : 2845/2997 places, 441/446 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-11 finished in 11407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 30 out of 2997 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30288 edges and 2997 vertex of which 1137 are kept as prefixes of interest. Removing 1860 places using SCC suffix rule.10 ms
Discarding 1860 places :
Also discarding 89 output transitions
Drop transitions removed 89 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 1136 transition count 270
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 89 place count 1135 transition count 269
Applied a total of 89 rules in 71 ms. Remains 1135 /2997 variables (removed 1862) and now considering 269/446 (removed 177) transitions.
// Phase 1: matrix 269 rows 1135 cols
[2023-03-16 17:09:31] [INFO ] Computed 868 place invariants in 7 ms
[2023-03-16 17:09:32] [INFO ] Implicit Places using invariants in 975 ms returned []
[2023-03-16 17:09:32] [INFO ] Invariant cache hit.
[2023-03-16 17:09:33] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned [958, 959, 960, 961, 962, 963, 964, 965, 966, 967, 968, 969, 970, 971, 972, 973, 974, 975, 976, 977, 978, 979, 980, 981, 982, 983, 984, 985, 986]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 2297 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1106/2997 places, 269/446 transitions.
Applied a total of 0 rules in 30 ms. Remains 1106 /1106 variables (removed 0) and now considering 269/269 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2398 ms. Remains : 1106/2997 places, 269/446 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s958 s959 s960 s961 s962 s963 s964 s965 s966 s967 s968 s969 s970 s971 s972 s973 s974 s975 s976 s977 s978 s979 s980 s981 s982 s983 s984 s985 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 4 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-12 finished in 2482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 29 out of 2997 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30288 edges and 2997 vertex of which 2906 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.12 ms
Discarding 91 places :
Also discarding 2 output transitions
Drop transitions 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 0 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 359 ms. Remains 2903 /2997 variables (removed 94) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2023-03-16 17:09:34] [INFO ] Computed 2464 place invariants in 41 ms
[2023-03-16 17:09:38] [INFO ] Implicit Places using invariants in 4194 ms returned []
[2023-03-16 17:09:38] [INFO ] Invariant cache hit.
[2023-03-16 17:09:46] [INFO ] Implicit Places using invariants and state equation in 7456 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 11654 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2997 places, 441/446 transitions.
Applied a total of 0 rules in 167 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12180 ms. Remains : 2845/2997 places, 441/446 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s2756 s2757 s2758 s2759 s2760 s2761 s2762 s2763 s2764 s2765 s2766 s2767 s2768 s2769 s2770 s2771 s2772 s2773 s2774 s2775 s2776 s2777 s2778 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2814 reset in 375 ms.
Product exploration explored 100000 steps with 2807 reset in 411 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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 81 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-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-13 finished in 13828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G((p1||X(F((p1&&F((p0||X(p2))))))))))))'
Support contains 900 out of 2997 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2937 transition count 446
Applied a total of 60 rules in 82 ms. Remains 2937 /2997 variables (removed 60) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2023-03-16 17:09:47] [INFO ] Computed 2493 place invariants in 56 ms
[2023-03-16 17:09:51] [INFO ] Implicit Places using invariants in 3263 ms returned []
[2023-03-16 17:09:51] [INFO ] Invariant cache hit.
[2023-03-16 17:09:58] [INFO ] Implicit Places using invariants and state equation in 6961 ms returned [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, 2756]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10237 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2997 places, 446/446 transitions.
Applied a total of 0 rules in 84 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10405 ms. Remains : 2908/2997 places, 446/446 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 (ADD s2815 s2816 s2817 s2818 s2819 s2820 s2821 s2822 s2823 s2824 s2825 s2826 s2827 s2828 s2829 s2830 s2831 s2832 s2833 s2834 s2835 s2836 s2837 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-15 finished in 10742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-28-LTLCardinality-03
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 2997 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30288 edges and 2997 vertex of which 269 are kept as prefixes of interest. Removing 2728 places using SCC suffix rule.16 ms
Discarding 2728 places :
Also discarding 145 output transitions
Drop transitions removed 145 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 268 transition count 185
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 266 transition count 183
Applied a total of 120 rules in 33 ms. Remains 266 /2997 variables (removed 2731) and now considering 183/446 (removed 263) transitions.
// Phase 1: matrix 183 rows 266 cols
[2023-03-16 17:09:58] [INFO ] Computed 84 place invariants in 2 ms
[2023-03-16 17:09:58] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-16 17:09:58] [INFO ] Invariant cache hit.
[2023-03-16 17:09:58] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 331 ms to find 29 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 237/2997 places, 183/446 transitions.
Applied a total of 0 rules in 4 ms. Remains 237 /237 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 368 ms. Remains : 237/2997 places, 183/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29) s236)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2790 reset in 352 ms.
Product exploration explored 100000 steps with 2787 reset in 377 ms.
Computed a total of 237 stabilizing places and 183 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 237 transition count 183
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 545 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 255 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2825 steps, run visited all 1 properties in 12 ms. (steps per millisecond=235 )
Probabilistic random walk after 2825 steps, saw 2767 distinct states, run finished after 12 ms. (steps per millisecond=235 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 183/183 transitions.
Applied a total of 0 rules in 3 ms. Remains 237 /237 variables (removed 0) and now considering 183/183 (removed 0) transitions.
// Phase 1: matrix 183 rows 237 cols
[2023-03-16 17:10:00] [INFO ] Computed 56 place invariants in 0 ms
[2023-03-16 17:10:00] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-16 17:10:00] [INFO ] Invariant cache hit.
[2023-03-16 17:10:01] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-16 17:10:01] [INFO ] Invariant cache hit.
[2023-03-16 17:10:01] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 237/237 places, 183/183 transitions.
Computed a total of 237 stabilizing places and 183 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 237 transition count 183
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10005 steps, including 258 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2825 steps, run visited all 1 properties in 12 ms. (steps per millisecond=235 )
Probabilistic random walk after 2825 steps, saw 2767 distinct states, run finished after 13 ms. (steps per millisecond=217 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2787 reset in 383 ms.
Product exploration explored 100000 steps with 2789 reset in 391 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 183/183 transitions.
Applied a total of 0 rules in 4 ms. Remains 237 /237 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-16 17:10:02] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-16 17:10:02] [INFO ] Invariant cache hit.
[2023-03-16 17:10:03] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 237/237 places, 183/183 transitions.
Built C files in :
/tmp/ltsmin1081155852022047868
[2023-03-16 17:10:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1081155852022047868
Running compilation step : cd /tmp/ltsmin1081155852022047868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 326 ms.
Running link step : cd /tmp/ltsmin1081155852022047868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1081155852022047868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5431536276299531866.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 183/183 transitions.
Applied a total of 0 rules in 2 ms. Remains 237 /237 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-16 17:10:18] [INFO ] Invariant cache hit.
[2023-03-16 17:10:18] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-16 17:10:18] [INFO ] Invariant cache hit.
[2023-03-16 17:10:18] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-16 17:10:18] [INFO ] Invariant cache hit.
[2023-03-16 17:10:18] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 237/237 places, 183/183 transitions.
Built C files in :
/tmp/ltsmin12010236537714373253
[2023-03-16 17:10:18] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12010236537714373253
Running compilation step : cd /tmp/ltsmin12010236537714373253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 297 ms.
Running link step : cd /tmp/ltsmin12010236537714373253;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12010236537714373253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8309229509630777158.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 17:10:33] [INFO ] Flatten gal took : 13 ms
[2023-03-16 17:10:33] [INFO ] Flatten gal took : 12 ms
[2023-03-16 17:10:33] [INFO ] Time to serialize gal into /tmp/LTL2455157760071620725.gal : 2 ms
[2023-03-16 17:10:33] [INFO ] Time to serialize properties into /tmp/LTL12204581338748302076.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2455157760071620725.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8629752275576137222.hoa' '-atoms' '/tmp/LTL12204581338748302076.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12204581338748302076.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8629752275576137222.hoa
Detected timeout of ITS tools.
[2023-03-16 17:10:48] [INFO ] Flatten gal took : 7 ms
[2023-03-16 17:10:48] [INFO ] Flatten gal took : 6 ms
[2023-03-16 17:10:48] [INFO ] Time to serialize gal into /tmp/LTL11477722012085106433.gal : 1 ms
[2023-03-16 17:10:48] [INFO ] Time to serialize properties into /tmp/LTL4198632669851502192.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11477722012085106433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4198632669851502192.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+(((n6_8+n6_9)+(n6_10+n6_11))+((n6_12+n6_13)+(n6_14+n6_15))))+((((n6_1...266
Formula 0 simplified : XF!"((((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+(((n6_8+n6_9)+(n6_10+n6_11))+((n6_12+n6_13)+(n6_14+n6_15))))+((((n6_16+...260
Detected timeout of ITS tools.
[2023-03-16 17:11:03] [INFO ] Flatten gal took : 7 ms
[2023-03-16 17:11:03] [INFO ] Applying decomposition
[2023-03-16 17:11:03] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3467628425181197751.txt' '-o' '/tmp/graph3467628425181197751.bin' '-w' '/tmp/graph3467628425181197751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3467628425181197751.bin' '-l' '-1' '-v' '-w' '/tmp/graph3467628425181197751.weights' '-q' '0' '-e' '0.001'
[2023-03-16 17:11:03] [INFO ] Decomposing Gal with order
[2023-03-16 17:11:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 17:11:03] [INFO ] Removed a total of 185 redundant transitions.
[2023-03-16 17:11:03] [INFO ] Flatten gal took : 16 ms
[2023-03-16 17:11:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 5 ms.
[2023-03-16 17:11:03] [INFO ] Time to serialize gal into /tmp/LTL9854566415504693354.gal : 3 ms
[2023-03-16 17:11:03] [INFO ] Time to serialize properties into /tmp/LTL2612684647368855351.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9854566415504693354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2612684647368855351.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((gu64.n6_0+gu64.n6_1)+(gu64.n6_2+gu64.n6_3))+((gu64.n6_4+gu64.n6_5)+(gu64.n6_6+gu64.n6_7)))+(((gu64.n6_8+gu64.n6_9)+(gu64...416
Formula 0 simplified : XF!"((((((gu64.n6_0+gu64.n6_1)+(gu64.n6_2+gu64.n6_3))+((gu64.n6_4+gu64.n6_5)+(gu64.n6_6+gu64.n6_7)))+(((gu64.n6_8+gu64.n6_9)+(gu64.n...410
Reverse transition relation is NOT exact ! Due to transitions gu0.t115, gi1.gi13.gu22.t203, gi1.gi27.gu61.t207, gi1.gi27.gu63.t204, gi1.t444_t206, gi1.t442...441
Computing Next relation with stutter on 1.82533e+13 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4813811476893934233
[2023-03-16 17:11:19] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4813811476893934233
Running compilation step : cd /tmp/ltsmin4813811476893934233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 320 ms.
Running link step : cd /tmp/ltsmin4813811476893934233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4813811476893934233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-03 finished in 95703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0||F(p1)))||F((p0&&X(X(G(p0))))))))'
[2023-03-16 17:11:34] [INFO ] Flatten gal took : 59 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12293025813334856373
[2023-03-16 17:11:34] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2023-03-16 17:11:34] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:11:34] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2023-03-16 17:11:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:11:34] [INFO ] Applying decomposition
[2023-03-16 17:11:34] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2023-03-16 17:11:34] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 17:11:34] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12293025813334856373
Running compilation step : cd /tmp/ltsmin12293025813334856373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 17:11:34] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2001235739120366751.txt' '-o' '/tmp/graph2001235739120366751.bin' '-w' '/tmp/graph2001235739120366751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2001235739120366751.bin' '-l' '-1' '-v' '-w' '/tmp/graph2001235739120366751.weights' '-q' '0' '-e' '0.001'
[2023-03-16 17:11:34] [INFO ] Decomposing Gal with order
[2023-03-16 17:11:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 17:11:34] [INFO ] Removed a total of 81 redundant transitions.
[2023-03-16 17:11:34] [INFO ] Flatten gal took : 118 ms
[2023-03-16 17:11:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 17 ms.
[2023-03-16 17:11:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality10587636889173202980.gal : 13 ms
[2023-03-16 17:11:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality10677843643558035211.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10587636889173202980.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10677843643558035211.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((X(G("((((((gu88.n6_0+gu88.n6_1)+(gu88.n6_2+gu88.n6_3))+((gu88.n6_4+gu88.n6_5)+(gu88.n6_6+gu88.n6_7)))+(((gu88.n6_8+gu88.n6_9)+(gu88...416
Formula 0 simplified : XF!"((((((gu88.n6_0+gu88.n6_1)+(gu88.n6_2+gu88.n6_3))+((gu88.n6_4+gu88.n6_5)+(gu88.n6_6+gu88.n6_7)))+(((gu88.n6_8+gu88.n6_9)+(gu88.n...410
Compilation finished in 2234 ms.
Running link step : cd /tmp/ltsmin12293025813334856373;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12293025813334856373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.058: LTL layer: formula: X([]((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.058: "X([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.059: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.119: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.119: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.121: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.125: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.888: DFS-FIFO for weak LTL, using special progress label 450
pins2lts-mc-linux64( 0/ 8), 0.888: There are 451 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.888: State length is 2998, there are 450 groups
pins2lts-mc-linux64( 0/ 8), 0.888: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.888: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.888: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.888: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 1.270: ~1 levels ~960 states ~28136 transitions
pins2lts-mc-linux64( 3/ 8), 1.441: ~1 levels ~1920 states ~55944 transitions
pins2lts-mc-linux64( 3/ 8), 1.818: ~1 levels ~3840 states ~113360 transitions
pins2lts-mc-linux64( 0/ 8), 2.413: ~1 levels ~7680 states ~220208 transitions
pins2lts-mc-linux64( 7/ 8), 3.575: ~1 levels ~15360 states ~427112 transitions
pins2lts-mc-linux64( 0/ 8), 5.743: ~1 levels ~30720 states ~943960 transitions
pins2lts-mc-linux64( 7/ 8), 11.627: ~1 levels ~61440 states ~2000520 transitions
pins2lts-mc-linux64( 0/ 8), 19.222: ~1 levels ~122880 states ~3981640 transitions
pins2lts-mc-linux64( 0/ 8), 36.337: ~1 levels ~245760 states ~9325392 transitions
pins2lts-mc-linux64( 5/ 8), 69.674: ~1 levels ~491520 states ~19164472 transitions
pins2lts-mc-linux64( 5/ 8), 81.737: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 82.545:
pins2lts-mc-linux64( 0/ 8), 82.545: mean standard work distribution: 9.7% (states) 8.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 82.545:
pins2lts-mc-linux64( 0/ 8), 82.545: Explored 509280 states 21700332 transitions, fanout: 42.610
pins2lts-mc-linux64( 0/ 8), 82.545: Total exploration time 81.600 sec (80.820 sec minimum, 81.199 sec on average)
pins2lts-mc-linux64( 0/ 8), 82.545: States per second: 6241, Transitions per second: 265935
pins2lts-mc-linux64( 0/ 8), 82.545:
pins2lts-mc-linux64( 0/ 8), 82.545: Progress states detected: 6456273
pins2lts-mc-linux64( 0/ 8), 82.545: Redundant explorations: -92.1119
pins2lts-mc-linux64( 0/ 8), 82.545:
pins2lts-mc-linux64( 0/ 8), 82.545: Queue width: 8B, total height: 7544493, memory: 57.56MB
pins2lts-mc-linux64( 0/ 8), 82.545: Tree memory: 305.3MB, 49.6 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 82.545: Tree fill ratio (roots/leafs): 4.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 82.545: Stored 478 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 82.545: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 82.545: Est. total memory use: 362.8MB (~1081.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12293025813334856373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12293025813334856373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 17:34:45] [INFO ] Applying decomposition
[2023-03-16 17:34:45] [INFO ] Flatten gal took : 593 ms
[2023-03-16 17:34:46] [INFO ] Decomposing Gal with order
[2023-03-16 17:34:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 17:34:47] [INFO ] Removed a total of 384 redundant transitions.
[2023-03-16 17:34:47] [INFO ] Flatten gal took : 1059 ms
[2023-03-16 17:34:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 230 ms.
[2023-03-16 17:34:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality9363515000038965273.gal : 79 ms
[2023-03-16 17:34:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality3584123699719311871.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9363515000038965273.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3584123699719311871.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((X(G("((((((gtsid0.n6_0+gtsid1.n6_1)+(gtsid2.n6_2+gtsid3.n6_3))+((gtsid4.n6_4+gtsid5.n6_5)+(gtsid6.n6_6+gtsid7.n6_7)))+(((gtsid8.n6_...497
Formula 0 simplified : XF!"((((((gtsid0.n6_0+gtsid1.n6_1)+(gtsid2.n6_2+gtsid3.n6_3))+((gtsid4.n6_4+gtsid5.n6_5)+(gtsid6.n6_6+gtsid7.n6_7)))+(((gtsid8.n6_8+...491
Detected timeout of ITS tools.
[2023-03-16 17:58:30] [INFO ] Flatten gal took : 522 ms
[2023-03-16 17:58:32] [INFO ] Input system was already deterministic with 446 transitions.
[2023-03-16 17:58:32] [INFO ] Transformed 2997 places.
[2023-03-16 17:58:32] [INFO ] Transformed 446 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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
[2023-03-16 17:59:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality16684395987716960679.gal : 30 ms
[2023-03-16 17:59:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality3018622674734178201.ltl : 7 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16684395987716960679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3018622674734178201.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.202303021504/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 : !((X(G("((((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+(((n6_8+n6_9)+(n6_10+n6_11))+((n6_12+n6_13)+(n6_14+n6_15))))+((((n6_1...266
Formula 0 simplified : XF!"((((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+(((n6_8+n6_9)+(n6_10+n6_11))+((n6_12+n6_13)+(n6_14+n6_15))))+((((n6_16+...260
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11631636 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15913016 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="LTLCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-28, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873946000843"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;