About the Execution of ITS-Tools for BridgeAndVehicles-COL-V80P50N20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.760 | 3600000.00 | 12205624.00 | 8034.90 | FFTFFFFTF?TFF?FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918100148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-COL-V80P50N20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918100148
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 7.5K Apr 29 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 29 22:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 22:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 45K May 10 09:33 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 BridgeAndVehicles-COL-V80P50N20-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652574264748
Running Version 202205111006
[2022-05-15 00:24:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 00:24:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 00:24:26] [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.
[2022-05-15 00:24:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 00:24:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 626 ms
[2022-05-15 00:24:26] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-15 00:24:26] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 7 ms.
[2022-05-15 00:24:26] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Remains 8 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 00:24:26] [INFO ] Computed 4 place invariants in 10 ms
[2022-05-15 00:24:27] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-05-15 00:24:27] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 00:24:27] [INFO ] Flatten gal took : 15 ms
[2022-05-15 00:24:27] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2022-05-15 00:24:27] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions 28830 arcs in 146 ms.
[2022-05-15 00:24:27] [INFO ] Unfolded 14 HLPN properties in 6 ms.
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 196 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 196 transition count 3728
Applied a total of 2 rules in 54 ms. Remains 196 /198 variables (removed 2) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:24:27] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:24:27] [INFO ] Computed 5 place invariants in 21 ms
[2022-05-15 00:24:29] [INFO ] Dead Transitions using invariants and state equation in 1282 ms found 0 transitions.
[2022-05-15 00:24:29] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:24:29] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 00:24:29] [INFO ] Implicit Places using invariants in 51 ms returned []
[2022-05-15 00:24:29] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:24:29] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 00:24:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:24:29] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2022-05-15 00:24:29] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:24:29] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 00:24:30] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/198 places, 3728/3728 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/198 places, 3728/3728 transitions.
Support contains 196 out of 196 places after structural reductions.
[2022-05-15 00:24:31] [INFO ] Flatten gal took : 322 ms
[2022-05-15 00:24:32] [INFO ] Flatten gal took : 370 ms
[2022-05-15 00:24:34] [INFO ] Input system was already deterministic with 3728 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1279 ms. (steps per millisecond=7 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 1281 ms. (steps per millisecond=7 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-05-15 00:24:36] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:24:36] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-15 00:24:38] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 00:24:46] [INFO ] After 8220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 00:24:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 00:24:54] [INFO ] After 7603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 00:24:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:25:01] [INFO ] After 7489ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 00:25:09] [INFO ] After 15277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
[2022-05-15 00:25:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 00:25:12] [INFO ] After 26245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 5 ms.
Support contains 104 out of 196 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 706 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2022-05-15 00:25:13] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:25:13] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 00:25:14] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/196 places, 3727/3728 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 1332 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 96409 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96409 steps, saw 28828 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 00:25:19] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:25:19] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-15 00:25:20] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 00:25:28] [INFO ] After 7998ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 00:25:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 00:25:36] [INFO ] After 8266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 00:25:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:25:44] [INFO ] After 7556ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 00:25:51] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 4 ms to minimize.
[2022-05-15 00:25:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2022-05-15 00:25:51] [INFO ] After 15488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
[2022-05-15 00:25:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 00:25:54] [INFO ] After 26341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 8 ms.
Support contains 104 out of 195 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 493 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3727/3727 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 478 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2022-05-15 00:25:55] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:25:55] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 00:25:55] [INFO ] Implicit Places using invariants in 277 ms returned []
[2022-05-15 00:25:55] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:25:55] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:25:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:25:56] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1551 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 193/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 503 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 193/195 places, 3727/3727 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 1339 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102876 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102876 steps, saw 30429 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 00:26:02] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-15 00:26:02] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 00:26:03] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 00:26:11] [INFO ] After 8478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 00:26:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 00:26:19] [INFO ] After 7711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 00:26:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:26:27] [INFO ] After 7685ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 00:26:35] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2022-05-15 00:26:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2022-05-15 00:26:35] [INFO ] After 15755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
[2022-05-15 00:26:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 00:26:38] [INFO ] After 26281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 6 ms.
Support contains 104 out of 193 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 471 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 3727/3727 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 505 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2022-05-15 00:26:39] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-15 00:26:39] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-15 00:26:39] [INFO ] Implicit Places using invariants in 260 ms returned []
[2022-05-15 00:26:39] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-15 00:26:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:26:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:26:40] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
[2022-05-15 00:26:40] [INFO ] Redundant transitions in 235 ms returned []
[2022-05-15 00:26:40] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-15 00:26:40] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 00:26:41] [INFO ] Dead Transitions using invariants and state equation in 1124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 3727/3727 transitions.
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 169 stabilizing places and 324 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)&&F(p1)))&&F(p2)))'
Support contains 106 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 17 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:26:41] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:26:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:26:42] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
[2022-05-15 00:26:42] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:26:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:26:43] [INFO ] Implicit Places using invariants in 241 ms returned []
[2022-05-15 00:26:43] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:26:43] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 00:26:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:26:44] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1284 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 21 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 194/196 places, 3728/3728 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p2), true]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s165 1), p2:(OR (AND (GEQ s170 1) (GEQ s191 1)) (AND (GEQ s169 1) (GEQ s191 1))), p0:(AND (GEQ s165 1) (OR (AND (GEQ s1 1) (GEQ s154 1) (GEQ s167 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 356 steps with 3 reset in 22 ms.
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N20-LTLFireability-01 finished in 2805 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F((G(p0)&&!p0))))||X(F(!p0))))'
Support contains 103 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 38 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2022-05-15 00:26:44] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:26:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:26:45] [INFO ] Dead Transitions using invariants and state equation in 1092 ms found 0 transitions.
[2022-05-15 00:26:45] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:26:45] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 00:26:46] [INFO ] Implicit Places using invariants in 246 ms returned []
[2022-05-15 00:26:46] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:26:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:26:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:26:47] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1269 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/196 places, 3727/3728 transitions.
Applied a total of 0 rules in 18 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 193/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 93 ms :[p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s154 1) (LT s166 1) (LT s177 1)) (OR (LT s1 1) (LT s130 1) (LT s166 1) (LT s175 1)) (OR (LT s1 1) (LT s142 1) (LT s166 1) (LT s1...], 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 673 steps with 2 reset in 55 ms.
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N20-LTLFireability-03 finished in 2642 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 103 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 193 transition count 3726
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 191 transition count 3724
Applied a total of 9 rules in 1188 ms. Remains 191 /196 variables (removed 5) and now considering 3724/3728 (removed 4) transitions.
[2022-05-15 00:26:48] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
// Phase 1: matrix 406 rows 191 cols
[2022-05-15 00:26:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 00:26:48] [INFO ] Implicit Places using invariants in 239 ms returned []
[2022-05-15 00:26:48] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
// Phase 1: matrix 406 rows 191 cols
[2022-05-15 00:26:48] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-15 00:26:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:26:50] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned [82, 164]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1591 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 189/196 places, 3724/3728 transitions.
Applied a total of 0 rules in 644 ms. Remains 189 /189 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 189/196 places, 3724/3728 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s152 1) (GEQ s164 1) (GEQ s175 1)) (AND (GEQ s0 1) (GEQ s128 1) (GEQ s164 1) (GEQ s173 1)) (AND (GEQ s0 1) (GEQ s140 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 493 steps with 1 reset in 41 ms.
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N20-LTLFireability-04 finished in 3559 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(X(X(p0)))))))'
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 37 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2022-05-15 00:26:50] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:26:50] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 00:26:51] [INFO ] Dead Transitions using invariants and state equation in 1091 ms found 0 transitions.
[2022-05-15 00:26:51] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:26:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 00:26:52] [INFO ] Implicit Places using invariants in 505 ms returned []
[2022-05-15 00:26:52] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:26:52] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 00:26:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:26:54] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2349 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/196 places, 3727/3728 transitions.
Applied a total of 0 rules in 23 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 193/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (AND (GEQ s0 50) (GEQ s192 1)) (AND (GEQ s0 50) (GEQ s191 1)))], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N20-LTLFireability-06 finished in 3777 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(X(!(!X(!p0) U (p1 U p2)))))||p3)))'
Support contains 109 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 19 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:26:54] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:26:54] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:26:55] [INFO ] Dead Transitions using invariants and state equation in 1098 ms found 0 transitions.
[2022-05-15 00:26:55] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:26:55] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 00:26:55] [INFO ] Implicit Places using invariants in 175 ms returned []
[2022-05-15 00:26:55] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:26:55] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:26:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:26:56] [INFO ] Implicit Places using invariants and state equation in 895 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1085 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 195/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 19 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 195/196 places, 3728/3728 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND p2 (NOT p3)), (AND p0 p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(GEQ s83 1), p2:(OR (AND (GEQ s0 50) (GEQ s194 1)) (AND (GEQ s0 50) (GEQ s193 1))), p0:(OR (AND (GEQ s0 1) (GEQ s105 1) (GEQ s166 1) (GEQ s169 1)) (AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6985 reset in 1496 ms.
Product exploration explored 100000 steps with 7138 reset in 1554 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/195 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2) p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2)))))]
Knowledge based reduction with 12 factoid took 599 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 150 ms :[(AND p2 (NOT p3)), (AND p0 p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 1433 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 00:27:03] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:27:03] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 00:27:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 00:27:04] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 00:27:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 00:27:04] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2) p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p3) p0 p1))), (G (NOT (AND p2 (NOT p3) p0)))]
False Knowledge obtained : [(X (X (AND (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (F (AND (NOT p2) (NOT p3) p1)), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (AND (NOT p2) (NOT p3) p0)), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 14 factoid took 629 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 75 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3))]
Support contains 107 out of 195 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 3728/3728 transitions.
Applied a total of 0 rules in 670 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:27:05] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:27:05] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 00:27:06] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
[2022-05-15 00:27:06] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:27:06] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:27:06] [INFO ] Implicit Places using invariants in 177 ms returned []
[2022-05-15 00:27:06] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:27:06] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:27:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:27:07] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
[2022-05-15 00:27:07] [INFO ] Redundant transitions in 145 ms returned []
[2022-05-15 00:27:07] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:27:07] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:27:08] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3728/3728 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/195 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p2) (NOT p3) p1))))]
Knowledge based reduction with 7 factoid took 340 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 87 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3))]
Finished random walk after 183 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (F p3), (F (AND (NOT p2) (NOT p3) p1)), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 7 factoid took 352 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 88 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 86 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3))]
Product exploration explored 100000 steps with 7479 reset in 1137 ms.
Product exploration explored 100000 steps with 7302 reset in 1119 ms.
Built C files in :
/tmp/ltsmin6503862956793450827
[2022-05-15 00:27:12] [INFO ] Too many transitions (3728) to apply POR reductions. Disabling POR matrices.
[2022-05-15 00:27:12] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6503862956793450827
Running compilation step : cd /tmp/ltsmin6503862956793450827;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6503862956793450827;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6503862956793450827;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 107 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 3728/3728 transitions.
Applied a total of 0 rules in 665 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:27:15] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:27:15] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:27:17] [INFO ] Dead Transitions using invariants and state equation in 1085 ms found 0 transitions.
[2022-05-15 00:27:17] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:27:17] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-15 00:27:17] [INFO ] Implicit Places using invariants in 219 ms returned []
[2022-05-15 00:27:17] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:27:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:27:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:27:18] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
[2022-05-15 00:27:18] [INFO ] Redundant transitions in 174 ms returned []
[2022-05-15 00:27:18] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:27:18] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:27:19] [INFO ] Dead Transitions using invariants and state equation in 1110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3728/3728 transitions.
Built C files in :
/tmp/ltsmin10331042940290883700
[2022-05-15 00:27:19] [INFO ] Too many transitions (3728) to apply POR reductions. Disabling POR matrices.
[2022-05-15 00:27:19] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10331042940290883700
Running compilation step : cd /tmp/ltsmin10331042940290883700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10331042940290883700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10331042940290883700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 00:27:23] [INFO ] Flatten gal took : 164 ms
[2022-05-15 00:27:23] [INFO ] Flatten gal took : 170 ms
[2022-05-15 00:27:23] [INFO ] Time to serialize gal into /tmp/LTL12349105772825844357.gal : 40 ms
[2022-05-15 00:27:23] [INFO ] Time to serialize properties into /tmp/LTL2689010388344492671.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12349105772825844357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2689010388344492671.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1234910...267
Read 1 LTL properties
Checking formula 0 : !((F((G(F(X(!((!(X(!("((((((((((CAPACITE_0>=1)&&(NB_ATTENTE_B_21>=1))&&((ATTENTE_B_0>=1)&&(CONTROLEUR_1>=1)))||(((CAPACITE_0>=1)&&(NB_...153717
Formula 0 simplified : !F("(SUR_PONT_A_0>=1)" | GFX!(!X!"((((((((((CAPACITE_0>=1)&&(NB_ATTENTE_B_21>=1))&&((ATTENTE_B_0>=1)&&(CONTROLEUR_1>=1)))||(((CAPACI...153698
Detected timeout of ITS tools.
[2022-05-15 00:27:38] [INFO ] Flatten gal took : 143 ms
[2022-05-15 00:27:38] [INFO ] Applying decomposition
[2022-05-15 00:27:39] [INFO ] Flatten gal took : 148 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6889459112293787582.txt' '-o' '/tmp/graph6889459112293787582.bin' '-w' '/tmp/graph6889459112293787582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6889459112293787582.bin' '-l' '-1' '-v' '-w' '/tmp/graph6889459112293787582.weights' '-q' '0' '-e' '0.001'
[2022-05-15 00:27:39] [INFO ] Decomposing Gal with order
[2022-05-15 00:27:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 00:27:41] [INFO ] Removed a total of 7112 redundant transitions.
[2022-05-15 00:27:41] [INFO ] Flatten gal took : 1842 ms
[2022-05-15 00:27:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 635 labels/synchronizations in 70 ms.
[2022-05-15 00:27:41] [INFO ] Time to serialize gal into /tmp/LTL12170369845684391849.gal : 3 ms
[2022-05-15 00:27:41] [INFO ] Time to serialize properties into /tmp/LTL2317151327794166262.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12170369845684391849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2317151327794166262.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1217036...246
Read 1 LTL properties
Checking formula 0 : !((F((G(F(X(!((!(X(!("((((((((((i2.u0.CAPACITE_0>=1)&&(i0.u1.NB_ATTENTE_B_21>=1))&&((i2.u3.ATTENTE_B_0>=1)&&(u4.CONTROLEUR_1>=1)))||((...195744
Formula 0 simplified : !F("(i2.u0.SUR_PONT_A_0>=1)" | GFX!(!X!"((((((((((i2.u0.CAPACITE_0>=1)&&(i0.u1.NB_ATTENTE_B_21>=1))&&((i2.u3.ATTENTE_B_0>=1)&&(u4.CO...195725
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5841940588216956743
[2022-05-15 00:27:56] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5841940588216956743
Running compilation step : cd /tmp/ltsmin5841940588216956743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5841940588216956743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5841940588216956743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N20-LTLFireability-09 finished in 65399 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X(p1)||G(p2)||G(p1))&&p0))))'
Support contains 166 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 19 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:27:59] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:28:00] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 00:28:01] [INFO ] Dead Transitions using invariants and state equation in 1083 ms found 0 transitions.
[2022-05-15 00:28:01] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:28:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 00:28:01] [INFO ] Implicit Places using invariants in 253 ms returned []
[2022-05-15 00:28:01] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:28:01] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:28:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:28:02] [INFO ] Implicit Places using invariants and state equation in 814 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1075 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 195/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 18 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 195/196 places, 3728/3728 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s73 1) (LT s83 1) (LT s168 1)) (OR (LT s0 1) (LT s18 1) (LT s83 1) (LT s168 1)) (OR (LT s0 1) (LT s49 1) (LT s83 1) (LT s168 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2569 reset in 3282 ms.
Product exploration explored 100000 steps with 2518 reset in 3372 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/195 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p0 p2)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 784 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 291 steps, including 0 resets, run visited all 10 properties in 16 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p0 p2)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 9 factoid took 732 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 166 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 3728/3728 transitions.
Applied a total of 0 rules in 18 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:28:11] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:28:11] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 00:28:12] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 0 transitions.
[2022-05-15 00:28:12] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:28:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 00:28:12] [INFO ] Implicit Places using invariants in 267 ms returned []
[2022-05-15 00:28:12] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:28:12] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-15 00:28:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:28:13] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2022-05-15 00:28:13] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:28:13] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:28:14] [INFO ] Dead Transitions using invariants and state equation in 1101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3728/3728 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/195 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p0 p2)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 564 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 274 steps, including 0 resets, run visited all 10 properties in 17 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p0 p2)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 9 factoid took 760 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 2557 reset in 3257 ms.
Product exploration explored 100000 steps with 2646 reset in 3261 ms.
Built C files in :
/tmp/ltsmin17678413500872871642
[2022-05-15 00:28:23] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17678413500872871642
Running compilation step : cd /tmp/ltsmin17678413500872871642;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17678413500872871642;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17678413500872871642;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 166 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 3728/3728 transitions.
Applied a total of 0 rules in 16 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:28:26] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:28:26] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 00:28:27] [INFO ] Dead Transitions using invariants and state equation in 1098 ms found 0 transitions.
[2022-05-15 00:28:27] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:28:27] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:28:28] [INFO ] Implicit Places using invariants in 247 ms returned []
[2022-05-15 00:28:28] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:28:28] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:28:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:28:29] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2022-05-15 00:28:29] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:28:29] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:28:30] [INFO ] Dead Transitions using invariants and state equation in 1164 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3728/3728 transitions.
Built C files in :
/tmp/ltsmin1637322362700534332
[2022-05-15 00:28:30] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1637322362700534332
Running compilation step : cd /tmp/ltsmin1637322362700534332;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1637322362700534332;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1637322362700534332;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 00:28:33] [INFO ] Flatten gal took : 113 ms
[2022-05-15 00:28:33] [INFO ] Flatten gal took : 120 ms
[2022-05-15 00:28:33] [INFO ] Time to serialize gal into /tmp/LTL15545839423752088101.gal : 19 ms
[2022-05-15 00:28:33] [INFO ] Time to serialize properties into /tmp/LTL11957655157496154465.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15545839423752088101.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11957655157496154465.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1554583...268
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((((((((CAPACITE_0<1)||(NB_ATTENTE_A_72<1))||((ATTENTE_A_0<1)||(CONTROLEUR_0<1)))&&(((CAPACITE_0<1)||(NB_ATTENTE_A_17<1))||(...9880
Formula 0 simplified : !XF("(((((((((CAPACITE_0<1)||(NB_ATTENTE_A_72<1))||((ATTENTE_A_0<1)||(CONTROLEUR_0<1)))&&(((CAPACITE_0<1)||(NB_ATTENTE_A_17<1))||((A...9860
Detected timeout of ITS tools.
[2022-05-15 00:28:49] [INFO ] Flatten gal took : 108 ms
[2022-05-15 00:28:49] [INFO ] Applying decomposition
[2022-05-15 00:28:49] [INFO ] Flatten gal took : 110 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7317249412923497145.txt' '-o' '/tmp/graph7317249412923497145.bin' '-w' '/tmp/graph7317249412923497145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7317249412923497145.bin' '-l' '-1' '-v' '-w' '/tmp/graph7317249412923497145.weights' '-q' '0' '-e' '0.001'
[2022-05-15 00:28:49] [INFO ] Decomposing Gal with order
[2022-05-15 00:28:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 00:28:50] [INFO ] Removed a total of 7112 redundant transitions.
[2022-05-15 00:28:50] [INFO ] Flatten gal took : 1336 ms
[2022-05-15 00:28:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 635 labels/synchronizations in 45 ms.
[2022-05-15 00:28:50] [INFO ] Time to serialize gal into /tmp/LTL3014881207394906960.gal : 3 ms
[2022-05-15 00:28:50] [INFO ] Time to serialize properties into /tmp/LTL7743709202814044131.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3014881207394906960.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7743709202814044131.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3014881...245
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((((((((i1.u2.CAPACITE_0<1)||(i0.u3.NB_ATTENTE_A_72<1))||((i1.u1.ATTENTE_A_0<1)||(u4.CONTROLEUR_0<1)))&&(((i1.u2.CAPACITE_0<...12061
Formula 0 simplified : !XF("(((((((((i1.u2.CAPACITE_0<1)||(i0.u3.NB_ATTENTE_A_72<1))||((i1.u1.ATTENTE_A_0<1)||(u4.CONTROLEUR_0<1)))&&(((i1.u2.CAPACITE_0<1)...12041
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16355026165518244032
[2022-05-15 00:29:06] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16355026165518244032
Running compilation step : cd /tmp/ltsmin16355026165518244032;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16355026165518244032;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16355026165518244032;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N20-LTLFireability-11 finished in 69073 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 83 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 31 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2022-05-15 00:29:09] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:29:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 00:29:10] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
[2022-05-15 00:29:10] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:29:10] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:29:10] [INFO ] Implicit Places using invariants in 385 ms returned []
[2022-05-15 00:29:10] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:29:10] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:29:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:29:12] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/196 places, 3727/3728 transitions.
Applied a total of 0 rules in 20 ms. Remains 194 /194 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 194/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N20-LTLFireability-12 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:(AND (OR (LT s0 1) (LT s105 1) (LT s165 1) (LT s168 1)) (OR (LT s0 1) (LT s136 1) (LT s165 1) (LT s168 1)) (OR (LT s0 1) (LT s129 1) (LT s165 1) (LT s1...], 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 64 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N20-LTLFireability-12 finished in 3402 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0 U X(p1))&&(G((F(p3)||p4))||p2))))'
Support contains 110 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 32 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
[2022-05-15 00:29:12] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:29:12] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:29:13] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
[2022-05-15 00:29:13] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:29:13] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:29:13] [INFO ] Implicit Places using invariants in 188 ms returned []
[2022-05-15 00:29:13] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:29:13] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:29:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:29:14] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
[2022-05-15 00:29:14] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:29:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 00:29:15] [INFO ] Dead Transitions using invariants and state equation in 1287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 195/196 places, 3727/3728 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/196 places, 3727/3728 transitions.
Stuttering acceptance computed with spot in 640 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p1), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p4) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p4 (NOT p3))), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p2) p4 (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p4 (NOT p3))), acceptance={0} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p4) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2 (NOT p4) (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 8}, { cond=(AND p0 p2), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p3)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p4) (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p4 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p2 (NOT p4) (NOT p3)), acceptance={0} source=6 dest: 7}, { cond=(AND (NOT p0) p2 p4 (NOT p3)), acceptance={} source=6 dest: 10}, { cond=(AND p0 p2 p4 (NOT p3)), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p3) (NOT p1)), acceptance={0} source=7 dest: 2}, { cond=(OR (AND (NOT p0) p2 (NOT p3) (NOT p1)) (AND (NOT p0) p4 (NOT p3) (NOT p1))), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p2) p4 (NOT p3) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p0 p2 (NOT p3) (NOT p1)) (AND p0 p4 (NOT p3) (NOT p1))), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND p0 p2 (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p3) (NOT p1)), acceptance={0} source=10 dest: 5}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p1)), acceptance={0} source=10 dest: 7}, { cond=(AND (NOT p0) p4 (NOT p3) (NOT p1)), acceptance={} source=10 dest: 10}, { cond=(AND p0 p4 (NOT p3) (NOT p1)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p3) (NOT p1)), acceptance={0} source=11 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p4) (NOT p3) (NOT p1)), acceptance={0} source=11 dest: 5}, { cond=(AND (NOT p2) p4 (NOT p3) (NOT p1)), acceptance={} source=11 dest: 6}, { cond=(AND p0 p2 (NOT p4) (NOT p3) (NOT p1)), acceptance={0} source=11 dest: 7}, { cond=(AND (NOT p0) p2 p4 (NOT p3) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(AND p0 p2 p4 (NOT p3) (NOT p1)), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(OR (AND (GEQ s171 1) (GEQ s192 1)) (AND (GEQ s170 1) (GEQ s192 1))), p2:(OR (AND (GEQ s0 50) (GEQ s194 1)) (AND (GEQ s0 50) (GEQ s193 1))), p4:(AND (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 541 reset in 6437 ms.
Product exploration explored 100000 steps with 470 reset in 6585 ms.
Computed a total of 168 stabilizing places and 323 stable transitions
Computed a total of 168 stabilizing places and 323 stable transitions
Detected a total of 168/195 stabilizing places and 323/3727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p4 p3 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p4) (NOT p3) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p4) (NOT p3)))), (X (NOT (AND p0 p2))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p4 (NOT p3))))), (X (NOT (AND (NOT p2) p4 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p4 (NOT p3))))), (X (NOT (AND (NOT p2) (NOT p4) (NOT p3)))), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p2) (NOT p4) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p4) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p4) (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3) (NOT p1)) (AND (NOT p0) p4 (NOT p3) (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p4 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p4 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 p2 (NOT p3) (NOT p1)) (AND p0 p4 (NOT p3) (NOT p1)))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p4 (NOT p3)))))), (X (X (NOT (AND (NOT p0) (NOT p4) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) p4 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 p4 (NOT p3))))), (X (X (NOT (AND p0 p2 p4 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p4) (NOT p3) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p4) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 41 factoid took 3032 ms. Reduced automaton from 12 states, 52 edges and 5 AP to 12 states, 50 edges and 5 AP.
Stuttering acceptance computed with spot in 622 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p1), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1556 ms. (steps per millisecond=6 ) properties (out of 30) seen :16
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 1931 ms. (steps per millisecond=5 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 1647 ms. (steps per millisecond=6 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 1619 ms. (steps per millisecond=6 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 1574 ms. (steps per millisecond=6 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 1659 ms. (steps per millisecond=6 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 1663 ms. (steps per millisecond=6 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 1612 ms. (steps per millisecond=6 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 1581 ms. (steps per millisecond=6 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 1608 ms. (steps per millisecond=6 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-05-15 00:29:50] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:29:50] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 00:30:01] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 00:30:01] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:4
[2022-05-15 00:30:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 00:30:01] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 11 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p4 p3 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p4) (NOT p3) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p4) (NOT p3)))), (X (NOT (AND p0 p2))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p4 (NOT p3))))), (X (NOT (AND (NOT p2) p4 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p4 (NOT p3))))), (X (NOT (AND (NOT p2) (NOT p4) (NOT p3)))), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p2) (NOT p4) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p4) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p4) (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3) (NOT p1)) (AND (NOT p0) p4 (NOT p3) (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p4 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p4 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 p2 (NOT p3) (NOT p1)) (AND p0 p4 (NOT p3) (NOT p1)))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p4 (NOT p3)))))), (X (X (NOT (AND (NOT p0) (NOT p4) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) p4 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 p4 (NOT p3))))), (X (X (NOT (AND p0 p2 p4 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p4) (NOT p3) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p4) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND p0 (NOT p3) (NOT p1) p2 (NOT p4)))), (G (NOT (AND p0 (NOT p3) (NOT p1) p2 p4))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p1) p2 p4))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p1) p2 (NOT p4)))), (G (NOT (AND p0 (NOT p3) (NOT p1) (NOT p4)))), (G (NOT (AND p0 (NOT p3) p2 (NOT p4)))), (G (NOT (AND (NOT p0) (NOT p3) p2 (NOT p4)))), (G (NOT (AND p0 (NOT p3) p2 p4))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3) (NOT p1) p4)), (F (AND (NOT p3) (NOT p2) p4)), (F (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) (NOT p3) p4))), (F p2), (F (OR (AND p0 (NOT p3) p2) (AND p0 (NOT p3) p4))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p3) (NOT p2) (NOT p4))), (F (AND p0 (NOT p3) (NOT p1) p4)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p3) (NOT p1) (NOT p4))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p3) p2 p4)), (F (AND p0 (NOT p3) (NOT p1))), (F (AND (NOT p0) (NOT p3) (NOT p1))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (OR (AND p0 (NOT p3) (NOT p1) p2) (AND p0 (NOT p3) (NOT p1) p4))), (F (AND (NOT p3) (NOT p1) (NOT p2) p4)), (F (OR (AND (NOT p0) (NOT p3) (NOT p1) p2) (AND (NOT p0) (NOT p3) (NOT p1) p4))), (F (AND (NOT p3) (NOT p1) (NOT p2) (NOT p4)))]
Knowledge based reduction with 52 factoid took 4369 ms. Reduced automaton from 12 states, 50 edges and 5 AP to 12 states, 34 edges and 5 AP.
Stuttering acceptance computed with spot in 860 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p1), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) p4)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 572 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p1), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) p4)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))]
[2022-05-15 00:30:07] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:30:07] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:30:08] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2022-05-15 00:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 00:30:09] [INFO ] [Real]Absence check using state equation in 1262 ms returned sat
[2022-05-15 00:30:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 00:30:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-15 00:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 00:30:10] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2022-05-15 00:30:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:30:12] [INFO ] [Nat]Added 42 Read/Feed constraints in 1941 ms returned sat
[2022-05-15 00:30:12] [INFO ] Deduced a trap composed of 5 places in 368 ms of which 0 ms to minimize.
[2022-05-15 00:30:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 899 ms
[2022-05-15 00:30:13] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 226 transitions) in 162 ms.
[2022-05-15 00:30:14] [INFO ] Added : 49 causal constraints over 13 iterations in 812 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 110 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 21 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2022-05-15 00:30:14] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:30:14] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:30:15] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
[2022-05-15 00:30:15] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:30:15] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:30:15] [INFO ] Implicit Places using invariants in 195 ms returned []
[2022-05-15 00:30:15] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:30:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:30:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:30:16] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2022-05-15 00:30:16] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:30:16] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 00:30:17] [INFO ] Dead Transitions using invariants and state equation in 1138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3727/3727 transitions.
Computed a total of 168 stabilizing places and 323 stable transitions
Computed a total of 168 stabilizing places and 323 stable transitions
Detected a total of 168/195 stabilizing places and 323/3727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3 p4), (X (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p3) p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p3) p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) p4)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 3059 ms. Reduced automaton from 12 states, 34 edges and 5 AP to 12 states, 34 edges and 5 AP.
Stuttering acceptance computed with spot in 511 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p1), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) p4)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1293 ms. (steps per millisecond=7 ) properties (out of 14) seen :12
Finished Best-First random walk after 634 steps, including 0 resets, run visited all 2 properties in 108 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3 p4), (X (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p3) p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p3) p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) p4)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p3) (NOT p1) (NOT p4))), (F (AND (NOT p0) (NOT p3) (NOT p1))), (F (AND (NOT p3) (NOT p2) p4)), (F (AND (NOT p0) (NOT p3) p4)), (F (AND (NOT p3) (NOT p1) (NOT p2) p4)), (F p2), (F (AND (NOT p0) (NOT p3) (NOT p1) p4)), (F (AND p0 (NOT p3) p4)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p3) (NOT p2) (NOT p4))), (F (AND p0 (NOT p1))), (F (AND (NOT p3) p2)), (F (AND p0 (NOT p3) (NOT p1)))]
Knowledge based reduction with 15 factoid took 3466 ms. Reduced automaton from 12 states, 34 edges and 5 AP to 12 states, 34 edges and 5 AP.
Stuttering acceptance computed with spot in 600 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p1), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) p4)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 655 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p1), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) p4)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))]
[2022-05-15 00:30:27] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:30:27] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:30:27] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-05-15 00:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 00:30:28] [INFO ] [Real]Absence check using state equation in 1270 ms returned sat
[2022-05-15 00:30:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 00:30:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-15 00:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 00:30:29] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2022-05-15 00:30:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:30:31] [INFO ] [Nat]Added 42 Read/Feed constraints in 1916 ms returned sat
[2022-05-15 00:30:32] [INFO ] Deduced a trap composed of 5 places in 389 ms of which 1 ms to minimize.
[2022-05-15 00:30:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 925 ms
[2022-05-15 00:30:32] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 226 transitions) in 238 ms.
[2022-05-15 00:30:33] [INFO ] Added : 49 causal constraints over 13 iterations in 814 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 601 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p1), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) p4)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))]
Product exploration explored 100000 steps with 450 reset in 3600 ms.
Product exploration explored 100000 steps with 490 reset in 3518 ms.
Built C files in :
/tmp/ltsmin9630831651534168222
[2022-05-15 00:30:41] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9630831651534168222
Running compilation step : cd /tmp/ltsmin9630831651534168222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9630831651534168222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9630831651534168222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 110 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 28 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2022-05-15 00:30:44] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:30:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:30:46] [INFO ] Dead Transitions using invariants and state equation in 1863 ms found 0 transitions.
[2022-05-15 00:30:46] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:30:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:30:46] [INFO ] Implicit Places using invariants in 182 ms returned []
[2022-05-15 00:30:46] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:30:46] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:30:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:30:47] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
[2022-05-15 00:30:47] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-15 00:30:47] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:30:48] [INFO ] Dead Transitions using invariants and state equation in 1097 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3727/3727 transitions.
Built C files in :
/tmp/ltsmin12624343869652403750
[2022-05-15 00:30:48] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12624343869652403750
Running compilation step : cd /tmp/ltsmin12624343869652403750;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12624343869652403750;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12624343869652403750;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 00:30:52] [INFO ] Flatten gal took : 152 ms
[2022-05-15 00:30:52] [INFO ] Flatten gal took : 157 ms
[2022-05-15 00:30:52] [INFO ] Time to serialize gal into /tmp/LTL16116505683463259272.gal : 19 ms
[2022-05-15 00:30:52] [INFO ] Time to serialize properties into /tmp/LTL2604376581404885000.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16116505683463259272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2604376581404885000.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1611650...267
Read 1 LTL properties
Checking formula 0 : !((F(((!("(((CHOIX_1>=1)&&(COMPTEUR_20>=1))||((CHOIX_0>=1)&&(COMPTEUR_20>=1)))"))U(X("(((CAPACITE_0>=50)&&(VIDANGE_1>=1))||((CAPACITE_...143805
Formula 0 simplified : !F((!"(((CHOIX_1>=1)&&(COMPTEUR_20>=1))||((CHOIX_0>=1)&&(COMPTEUR_20>=1)))" U X"(((CAPACITE_0>=50)&&(VIDANGE_1>=1))||((CAPACITE_0>=5...143787
Detected timeout of ITS tools.
[2022-05-15 00:31:07] [INFO ] Flatten gal took : 144 ms
[2022-05-15 00:31:07] [INFO ] Applying decomposition
[2022-05-15 00:31:07] [INFO ] Flatten gal took : 143 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10075522141620925142.txt' '-o' '/tmp/graph10075522141620925142.bin' '-w' '/tmp/graph10075522141620925142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10075522141620925142.bin' '-l' '-1' '-v' '-w' '/tmp/graph10075522141620925142.weights' '-q' '0' '-e' '0.001'
[2022-05-15 00:31:08] [INFO ] Decomposing Gal with order
[2022-05-15 00:31:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 00:31:09] [INFO ] Removed a total of 7271 redundant transitions.
[2022-05-15 00:31:09] [INFO ] Flatten gal took : 1549 ms
[2022-05-15 00:31:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 873 labels/synchronizations in 52 ms.
[2022-05-15 00:31:10] [INFO ] Time to serialize gal into /tmp/LTL4591482444051570387.gal : 2 ms
[2022-05-15 00:31:10] [INFO ] Time to serialize properties into /tmp/LTL6016298066386837465.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4591482444051570387.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6016298066386837465.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4591482...245
Read 1 LTL properties
Checking formula 0 : !((F(((!("(((i0.u1.CHOIX_1>=1)&&(i1.u3.COMPTEUR_20>=1))||((i0.u1.CHOIX_0>=1)&&(i1.u3.COMPTEUR_20>=1)))"))U(X("(((i0.u1.CAPACITE_0>=50)...185169
Formula 0 simplified : !F((!"(((i0.u1.CHOIX_1>=1)&&(i1.u3.COMPTEUR_20>=1))||((i0.u1.CHOIX_0>=1)&&(i1.u3.COMPTEUR_20>=1)))" U X"(((i0.u1.CAPACITE_0>=50)&&(i...185151
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8345156540749344960
[2022-05-15 00:31:25] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8345156540749344960
Running compilation step : cd /tmp/ltsmin8345156540749344960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8345156540749344960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8345156540749344960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N20-LTLFireability-13 finished in 135718 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 21 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:31:28] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:31:28] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 00:31:29] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
[2022-05-15 00:31:29] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:31:29] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:31:29] [INFO ] Implicit Places using invariants in 611 ms returned []
[2022-05-15 00:31:29] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:31:29] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 00:31:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:31:33] [INFO ] Implicit Places using invariants and state equation in 4082 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4709 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 21 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 194/196 places, 3728/3728 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s165 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 ms.
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N20-LTLFireability-14 finished in 5873 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(X(!(!X(!p0) U (p1 U p2)))))||p3)))'
Found a CL insensitive property : BridgeAndVehicles-COL-V80P50N20-LTLFireability-09
Stuttering acceptance computed with spot in 130 ms :[(AND p2 (NOT p3)), (AND p0 p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Support contains 109 out of 196 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 38 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:31:34] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:31:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 00:31:35] [INFO ] Dead Transitions using invariants and state equation in 1110 ms found 0 transitions.
[2022-05-15 00:31:35] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:31:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 00:31:35] [INFO ] Implicit Places using invariants in 170 ms returned []
[2022-05-15 00:31:35] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:31:35] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 00:31:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:31:36] [INFO ] Implicit Places using invariants and state equation in 855 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1030 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 195/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 34 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 195/196 places, 3728/3728 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(GEQ s83 1), p2:(OR (AND (GEQ s0 50) (GEQ s194 1)) (AND (GEQ s0 50) (GEQ s193 1))), p0:(OR (AND (GEQ s0 1) (GEQ s105 1) (GEQ s166 1) (GEQ s169 1)) (AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6976 reset in 1462 ms.
Product exploration explored 100000 steps with 7030 reset in 1377 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/195 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2) p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2)))))]
Knowledge based reduction with 12 factoid took 582 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 173 ms :[(AND p2 (NOT p3)), (AND p0 p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 1323 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 00:31:42] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:31:42] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:31:43] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 00:31:43] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 00:31:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 00:31:43] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2) p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p3) p0 p1))), (G (NOT (AND p2 (NOT p3) p0)))]
False Knowledge obtained : [(X (X (AND (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (F (AND (NOT p2) (NOT p3) p1)), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (AND (NOT p2) (NOT p3) p0)), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 14 factoid took 734 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 73 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3))]
Support contains 107 out of 195 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 3728/3728 transitions.
Applied a total of 0 rules in 640 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:31:45] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:31:45] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:31:46] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
[2022-05-15 00:31:46] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:31:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:31:46] [INFO ] Implicit Places using invariants in 171 ms returned []
[2022-05-15 00:31:46] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:31:46] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 00:31:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:31:47] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
[2022-05-15 00:31:47] [INFO ] Redundant transitions in 177 ms returned []
[2022-05-15 00:31:47] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:31:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 00:31:48] [INFO ] Dead Transitions using invariants and state equation in 1089 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3728/3728 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/195 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p2) (NOT p3) p1))))]
Knowledge based reduction with 7 factoid took 271 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3))]
Finished random walk after 207 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (F p3), (F (AND (NOT p2) (NOT p3) p1)), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 76 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 90 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3))]
Product exploration explored 100000 steps with 7355 reset in 1149 ms.
Product exploration explored 100000 steps with 7107 reset in 1133 ms.
Built C files in :
/tmp/ltsmin2903137087480320800
[2022-05-15 00:31:51] [INFO ] Too many transitions (3728) to apply POR reductions. Disabling POR matrices.
[2022-05-15 00:31:52] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2903137087480320800
Running compilation step : cd /tmp/ltsmin2903137087480320800;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2903137087480320800;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2903137087480320800;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 107 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 3728/3728 transitions.
Applied a total of 0 rules in 638 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:31:55] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:31:55] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 00:31:56] [INFO ] Dead Transitions using invariants and state equation in 1090 ms found 0 transitions.
[2022-05-15 00:31:56] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:31:56] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:31:56] [INFO ] Implicit Places using invariants in 223 ms returned []
[2022-05-15 00:31:56] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:31:56] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:31:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:31:57] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
[2022-05-15 00:31:57] [INFO ] Redundant transitions in 184 ms returned []
[2022-05-15 00:31:57] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:31:57] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:31:59] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3728/3728 transitions.
Built C files in :
/tmp/ltsmin1769469092214974240
[2022-05-15 00:31:59] [INFO ] Too many transitions (3728) to apply POR reductions. Disabling POR matrices.
[2022-05-15 00:31:59] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1769469092214974240
Running compilation step : cd /tmp/ltsmin1769469092214974240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1769469092214974240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1769469092214974240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 00:32:02] [INFO ] Flatten gal took : 166 ms
[2022-05-15 00:32:02] [INFO ] Flatten gal took : 149 ms
[2022-05-15 00:32:02] [INFO ] Time to serialize gal into /tmp/LTL11153546654129231546.gal : 16 ms
[2022-05-15 00:32:02] [INFO ] Time to serialize properties into /tmp/LTL12525223216412948458.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11153546654129231546.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12525223216412948458.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1115354...268
Read 1 LTL properties
Checking formula 0 : !((F((G(F(X(!((!(X(!("((((((((((CAPACITE_0>=1)&&(NB_ATTENTE_B_21>=1))&&((ATTENTE_B_0>=1)&&(CONTROLEUR_1>=1)))||(((CAPACITE_0>=1)&&(NB_...153717
Formula 0 simplified : !F("(SUR_PONT_A_0>=1)" | GFX!(!X!"((((((((((CAPACITE_0>=1)&&(NB_ATTENTE_B_21>=1))&&((ATTENTE_B_0>=1)&&(CONTROLEUR_1>=1)))||(((CAPACI...153698
Detected timeout of ITS tools.
[2022-05-15 00:32:17] [INFO ] Flatten gal took : 147 ms
[2022-05-15 00:32:17] [INFO ] Applying decomposition
[2022-05-15 00:32:18] [INFO ] Flatten gal took : 149 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16025505334398973776.txt' '-o' '/tmp/graph16025505334398973776.bin' '-w' '/tmp/graph16025505334398973776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16025505334398973776.bin' '-l' '-1' '-v' '-w' '/tmp/graph16025505334398973776.weights' '-q' '0' '-e' '0.001'
[2022-05-15 00:32:18] [INFO ] Decomposing Gal with order
[2022-05-15 00:32:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 00:32:19] [INFO ] Removed a total of 7112 redundant transitions.
[2022-05-15 00:32:19] [INFO ] Flatten gal took : 1298 ms
[2022-05-15 00:32:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 635 labels/synchronizations in 38 ms.
[2022-05-15 00:32:19] [INFO ] Time to serialize gal into /tmp/LTL13976036651956636831.gal : 3 ms
[2022-05-15 00:32:19] [INFO ] Time to serialize properties into /tmp/LTL11840899329305451375.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13976036651956636831.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11840899329305451375.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1397603...247
Read 1 LTL properties
Checking formula 0 : !((F((G(F(X(!((!(X(!("((((((((((i1.u1.CAPACITE_0>=1)&&(i0.u4.NB_ATTENTE_B_21>=1))&&((i1.u2.ATTENTE_B_0>=1)&&(u3.CONTROLEUR_1>=1)))||((...195744
Formula 0 simplified : !F("(i1.u1.SUR_PONT_A_0>=1)" | GFX!(!X!"((((((((((i1.u1.CAPACITE_0>=1)&&(i0.u4.NB_ATTENTE_B_21>=1))&&((i1.u2.ATTENTE_B_0>=1)&&(u3.CO...195725
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17378265789983595575
[2022-05-15 00:32:34] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17378265789983595575
Running compilation step : cd /tmp/ltsmin17378265789983595575;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17378265789983595575;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17378265789983595575;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N20-LTLFireability-09 finished in 63973 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X(p1)||G(p2)||G(p1))&&p0))))'
Found a CL insensitive property : BridgeAndVehicles-COL-V80P50N20-LTLFireability-11
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 166 out of 196 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 46 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:32:38] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:32:38] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:32:39] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
[2022-05-15 00:32:39] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:32:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:32:39] [INFO ] Implicit Places using invariants in 261 ms returned []
[2022-05-15 00:32:39] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2022-05-15 00:32:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:32:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:32:40] [INFO ] Implicit Places using invariants and state equation in 874 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1148 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 195/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 29 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 195/196 places, 3728/3728 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s73 1) (LT s83 1) (LT s168 1)) (OR (LT s0 1) (LT s18 1) (LT s83 1) (LT s168 1)) (OR (LT s0 1) (LT s49 1) (LT s83 1) (LT s168 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2568 reset in 3291 ms.
Product exploration explored 100000 steps with 2643 reset in 3201 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/195 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p0 p2)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 551 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 364 steps, including 0 resets, run visited all 10 properties in 22 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p0 p2)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 9 factoid took 708 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 166 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 3728/3728 transitions.
Applied a total of 0 rules in 19 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:32:49] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:32:49] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:32:50] [INFO ] Dead Transitions using invariants and state equation in 1030 ms found 0 transitions.
[2022-05-15 00:32:50] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:32:50] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:32:50] [INFO ] Implicit Places using invariants in 265 ms returned []
[2022-05-15 00:32:50] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:32:50] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 00:32:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:32:51] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2022-05-15 00:32:51] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:32:51] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:32:52] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3728/3728 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/195 stabilizing places and 324/3728 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p0 p2)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 521 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 245 steps, including 0 resets, run visited all 10 properties in 19 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p0 p2)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 9 factoid took 701 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 2516 reset in 3277 ms.
Product exploration explored 100000 steps with 2625 reset in 3276 ms.
Built C files in :
/tmp/ltsmin17605402318052145475
[2022-05-15 00:33:01] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17605402318052145475
Running compilation step : cd /tmp/ltsmin17605402318052145475;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17605402318052145475;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17605402318052145475;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 166 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 3728/3728 transitions.
Applied a total of 0 rules in 20 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-05-15 00:33:04] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:33:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 00:33:05] [INFO ] Dead Transitions using invariants and state equation in 1281 ms found 0 transitions.
[2022-05-15 00:33:05] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:33:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:33:05] [INFO ] Implicit Places using invariants in 308 ms returned []
[2022-05-15 00:33:05] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:33:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 00:33:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 00:33:06] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2022-05-15 00:33:06] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2022-05-15 00:33:06] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:33:07] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3728/3728 transitions.
Built C files in :
/tmp/ltsmin17233941863568200048
[2022-05-15 00:33:07] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17233941863568200048
Running compilation step : cd /tmp/ltsmin17233941863568200048;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17233941863568200048;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17233941863568200048;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 00:33:11] [INFO ] Flatten gal took : 107 ms
[2022-05-15 00:33:11] [INFO ] Flatten gal took : 109 ms
[2022-05-15 00:33:11] [INFO ] Time to serialize gal into /tmp/LTL2919607637207701828.gal : 15 ms
[2022-05-15 00:33:11] [INFO ] Time to serialize properties into /tmp/LTL13054781200916790937.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2919607637207701828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13054781200916790937.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2919607...267
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((((((((CAPACITE_0<1)||(NB_ATTENTE_A_72<1))||((ATTENTE_A_0<1)||(CONTROLEUR_0<1)))&&(((CAPACITE_0<1)||(NB_ATTENTE_A_17<1))||(...9880
Formula 0 simplified : !XF("(((((((((CAPACITE_0<1)||(NB_ATTENTE_A_72<1))||((ATTENTE_A_0<1)||(CONTROLEUR_0<1)))&&(((CAPACITE_0<1)||(NB_ATTENTE_A_17<1))||((A...9860
Detected timeout of ITS tools.
[2022-05-15 00:33:26] [INFO ] Flatten gal took : 118 ms
[2022-05-15 00:33:26] [INFO ] Applying decomposition
[2022-05-15 00:33:26] [INFO ] Flatten gal took : 120 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12103229509711337863.txt' '-o' '/tmp/graph12103229509711337863.bin' '-w' '/tmp/graph12103229509711337863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12103229509711337863.bin' '-l' '-1' '-v' '-w' '/tmp/graph12103229509711337863.weights' '-q' '0' '-e' '0.001'
[2022-05-15 00:33:27] [INFO ] Decomposing Gal with order
[2022-05-15 00:33:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 00:33:28] [INFO ] Removed a total of 7112 redundant transitions.
[2022-05-15 00:33:28] [INFO ] Flatten gal took : 1314 ms
[2022-05-15 00:33:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 715 labels/synchronizations in 32 ms.
[2022-05-15 00:33:28] [INFO ] Time to serialize gal into /tmp/LTL8653717977775639133.gal : 4 ms
[2022-05-15 00:33:28] [INFO ] Time to serialize properties into /tmp/LTL14623528345619877972.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8653717977775639133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14623528345619877972.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8653717...246
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((((((((u0.CAPACITE_0<1)||(i2.u3.NB_ATTENTE_A_72<1))||((i2.u2.ATTENTE_A_0<1)||(i1.u4.CONTROLEUR_0<1)))&&(((u0.CAPACITE_0<1)|...12538
Formula 0 simplified : !XF("(((((((((u0.CAPACITE_0<1)||(i2.u3.NB_ATTENTE_A_72<1))||((i2.u2.ATTENTE_A_0<1)||(i1.u4.CONTROLEUR_0<1)))&&(((u0.CAPACITE_0<1)||(...12518
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15222290070124553232
[2022-05-15 00:33:43] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15222290070124553232
Running compilation step : cd /tmp/ltsmin15222290070124553232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15222290070124553232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15222290070124553232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N20-LTLFireability-11 finished in 68556 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0 U X(p1))&&(G((F(p3)||p4))||p2))))'
[2022-05-15 00:33:46] [INFO ] Flatten gal took : 167 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2369521586740218791
[2022-05-15 00:33:47] [INFO ] Too many transitions (3728) to apply POR reductions. Disabling POR matrices.
[2022-05-15 00:33:47] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2369521586740218791
Running compilation step : cd /tmp/ltsmin2369521586740218791;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 00:33:47] [INFO ] Applying decomposition
[2022-05-15 00:33:47] [INFO ] Flatten gal took : 174 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13696161095344528336.txt' '-o' '/tmp/graph13696161095344528336.bin' '-w' '/tmp/graph13696161095344528336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13696161095344528336.bin' '-l' '-1' '-v' '-w' '/tmp/graph13696161095344528336.weights' '-q' '0' '-e' '0.001'
[2022-05-15 00:33:47] [INFO ] Decomposing Gal with order
[2022-05-15 00:33:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 00:33:49] [INFO ] Removed a total of 7271 redundant transitions.
[2022-05-15 00:33:49] [INFO ] Flatten gal took : 1735 ms
[2022-05-15 00:33:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 873 labels/synchronizations in 38 ms.
[2022-05-15 00:33:49] [INFO ] Time to serialize gal into /tmp/LTLFireability16550413158727096355.gal : 7 ms
[2022-05-15 00:33:49] [INFO ] Time to serialize properties into /tmp/LTLFireability4341038968828993052.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16550413158727096355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4341038968828993052.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((F((G(F(X(!((!(X(!("((((((((((i1.u2.CAPACITE_0>=1)&&(i2.u5.NB_ATTENTE_B_21>=1))&&((i2.u4.ATTENTE_B_0>=1)&&(i0.u3.CONTROLEUR_1>=1)))|...195987
Formula 0 simplified : !F("(i1.u2.SUR_PONT_A_0>=1)" | GFX!(!X!"((((((((((i1.u2.CAPACITE_0>=1)&&(i2.u5.NB_ATTENTE_B_21>=1))&&((i2.u4.ATTENTE_B_0>=1)&&(i0.u3...195968
Compilation finished in 13088 ms.
Running link step : cd /tmp/ltsmin2369521586740218791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin2369521586740218791;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(X(!(!X(!(LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp2==true))))))||(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin2369521586740218791;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(X(!(!X(!(LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp2==true))))))||(LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2369521586740218791;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((X((LTLAPp3==true))||[]((LTLAPp5==true))||[]((LTLAPp3==true)))&&(LTLAPp4==true))))' '--buchi-type=spotba'
LTSmin run took 654 ms.
FORMULA BridgeAndVehicles-COL-V80P50N20-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2369521586740218791;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((!(LTLAPp6==true) U X((LTLAPp2==true)))&&([]((<>((LTLAPp8==true))||(LTLAPp9==true)))||(LTLAPp7==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 00:56:57] [INFO ] Applying decomposition
[2022-05-15 00:56:57] [INFO ] Flatten gal took : 365 ms
[2022-05-15 00:56:58] [INFO ] Decomposing Gal with order
[2022-05-15 00:56:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 00:56:59] [INFO ] Removed a total of 21190 redundant transitions.
[2022-05-15 00:57:00] [INFO ] Flatten gal took : 1814 ms
[2022-05-15 00:57:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 127 ms.
[2022-05-15 00:57:00] [INFO ] Time to serialize gal into /tmp/LTLFireability11237335466618494755.gal : 86 ms
[2022-05-15 00:57:00] [INFO ] Time to serialize properties into /tmp/LTLFireability12197109560462505801.ltl : 89 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11237335466618494755.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12197109560462505801.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !((F((G(F(X(!((!(X(!("((((((((((CAPACITE.CAPACITE_0>=1)&&(voitureB21.NB_ATTENTE_B_21>=1))&&((ATTENTE_B.ATTENTE_B_0>=1)&&(sens1.CONTROL...219480
Formula 0 simplified : !F("(SUR_PONT_A.SUR_PONT_A_0>=1)" | GFX!(!X!"((((((((((CAPACITE.CAPACITE_0>=1)&&(voitureB21.NB_ATTENTE_B_21>=1))&&((ATTENTE_B.ATTENT...219461
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin2369521586740218791;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((!(LTLAPp6==true) U X((LTLAPp2==true)))&&([]((<>((LTLAPp8==true))||(LTLAPp9==true)))||(LTLAPp7==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin2369521586740218791;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(X(!(!X(!(LTLAPp0==true)) U ((LTLAPp1==true) U (LTLAPp2==true))))))||(LTLAPp3==true)))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2022-05-15 01:17:03] [INFO ] Flatten gal took : 332 ms
[2022-05-15 01:17:05] [INFO ] Input system was already deterministic with 3728 transitions.
[2022-05-15 01:17:06] [INFO ] Transformed 196 places.
[2022-05-15 01:17:06] [INFO ] Transformed 3728 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//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
[2022-05-15 01:17:07] [INFO ] Time to serialize gal into /tmp/LTLFireability13161049108186007173.gal : 44 ms
[2022-05-15 01:17:07] [INFO ] Time to serialize properties into /tmp/LTLFireability4388081557393060125.ltl : 47 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13161049108186007173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4388081557393060125.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(F(X(!((!(X(!("((((((((((CAPACITE_0>=1)&&(NB_ATTENTE_B_21>=1))&&((ATTENTE_B_0>=1)&&(CONTROLEUR_1>=1)))||(((CAPACITE_0>=1)&&(NB_...153717
Formula 0 simplified : !F("(SUR_PONT_A_0>=1)" | GFX!(!X!"((((((((((CAPACITE_0>=1)&&(NB_ATTENTE_B_21>=1))&&((ATTENTE_B_0>=1)&&(CONTROLEUR_1>=1)))||(((CAPACI...153698
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="BridgeAndVehicles-COL-V80P50N20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V80P50N20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918100148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N20.tgz
mv BridgeAndVehicles-COL-V80P50N20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;