About the Execution of ITS-Tools for BridgeAndVehicles-COL-V80P50N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8574.632 | 3600000.00 | 12723230.00 | 7038.60 | ?F?FF?FF?FFFF?TF | 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-165251918100140.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-V80P50N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918100140
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 7.2K Apr 29 21:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 21:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 21:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 21:39 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 4.6K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 3.9K 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-V80P50N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652571246824
Running Version 202205111006
[2022-05-14 23:34:08] [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-14 23:34:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 23:34:08] [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-14 23:34:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 23:34:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 587 ms
[2022-05-14 23:34:08] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-14 23:34:08] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 9 ms.
[2022-05-14 23:34:08] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-15 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 3 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
Finished random walk after 191 steps, including 0 resets, run visited all 4 properties in 14 ms. (steps per millisecond=13 )
[2022-05-14 23:34:09] [INFO ] Flatten gal took : 19 ms
[2022-05-14 23:34:09] [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) 11)]] 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-14 23:34:09] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 98 ms.
[2022-05-14 23:34:09] [INFO ] Unfolded 14 HLPN properties in 4 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 185 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 44 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:34:09] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:34:09] [INFO ] Computed 5 place invariants in 20 ms
[2022-05-14 23:34:10] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
[2022-05-14 23:34:10] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:34:10] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:34:10] [INFO ] Implicit Places using invariants in 51 ms returned []
[2022-05-14 23:34:10] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:34:10] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 23:34:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:34:10] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2022-05-14 23:34:10] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:34:10] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:34:11] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/188 places, 2108/2108 transitions.
Support contains 185 out of 186 places after structural reductions.
[2022-05-14 23:34:11] [INFO ] Flatten gal took : 271 ms
[2022-05-14 23:34:13] [INFO ] Flatten gal took : 295 ms
[2022-05-14 23:34:14] [INFO ] Input system was already deterministic with 2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 645 ms. (steps per millisecond=15 ) properties (out of 15) seen :14
Finished Best-First random walk after 208 steps, including 0 resets, run visited all 1 properties in 30 ms. (steps per millisecond=6 )
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(F(p0)))'
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 437 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 23:34:16] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:34:16] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:34:16] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
[2022-05-14 23:34:16] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:34:16] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 23:34:17] [INFO ] Implicit Places using invariants in 370 ms returned []
[2022-05-14 23:34:17] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:34:17] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 23:34:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:34:19] [INFO ] Implicit Places using invariants and state equation in 1948 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2331 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 235 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 183/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 50) (GEQ s182 1)) (AND (GEQ s0 50) (GEQ s181 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1703 reset in 641 ms.
Product exploration explored 100000 steps with 1677 reset in 556 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 1851 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 80 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
[2022-05-14 23:34:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:34:23] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-14 23:34:23] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-14 23:34:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:34:24] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2022-05-14 23:34:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:34:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:34:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:34:24] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2022-05-14 23:34:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:34:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 853 ms returned sat
[2022-05-14 23:34:26] [INFO ] Deduced a trap composed of 5 places in 375 ms of which 2 ms to minimize.
[2022-05-14 23:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2022-05-14 23:34:26] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 91 ms.
[2022-05-14 23:34:26] [INFO ] Added : 12 causal constraints over 4 iterations in 333 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 219 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:34:26] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:34:26] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:34:27] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
[2022-05-14 23:34:27] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:34:27] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:34:27] [INFO ] Implicit Places using invariants in 318 ms returned []
[2022-05-14 23:34:27] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:34:27] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:34:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:34:28] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
[2022-05-14 23:34:28] [INFO ] Redundant transitions in 133 ms returned []
[2022-05-14 23:34:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:34:28] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:34:29] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2022-05-14 23:34:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:34:30] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:34:30] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-14 23:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:34:30] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2022-05-14 23:34:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:34:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:34:31] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2022-05-14 23:34:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:34:32] [INFO ] [Nat]Added 22 Read/Feed constraints in 841 ms returned sat
[2022-05-14 23:34:32] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
[2022-05-14 23:34:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2022-05-14 23:34:32] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 101 ms.
[2022-05-14 23:34:33] [INFO ] Added : 12 causal constraints over 4 iterations in 284 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1681 reset in 478 ms.
Product exploration explored 100000 steps with 1694 reset in 497 ms.
Built C files in :
/tmp/ltsmin5778540170207685064
[2022-05-14 23:34:34] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 23:34:34] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5778540170207685064
Running compilation step : cd /tmp/ltsmin5778540170207685064;'/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/ltsmin5778540170207685064;'/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/ltsmin5778540170207685064;'/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 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 214 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:34:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:34:39] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:34:40] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
[2022-05-14 23:34:40] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:34:40] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:34:40] [INFO ] Implicit Places using invariants in 323 ms returned []
[2022-05-14 23:34:40] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:34:40] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:34:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:34:41] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1344 ms to find 0 implicit places.
[2022-05-14 23:34:41] [INFO ] Redundant transitions in 100 ms returned []
[2022-05-14 23:34:41] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:34:41] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 23:34:42] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin8274546651930057053
[2022-05-14 23:34:43] [INFO ] Too many transitions (2107) to apply POR reductions. Disabling POR matrices.
[2022-05-14 23:34:43] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8274546651930057053
Running compilation step : cd /tmp/ltsmin8274546651930057053;'/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/ltsmin8274546651930057053;'/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/ltsmin8274546651930057053;'/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-14 23:34:47] [INFO ] Flatten gal took : 87 ms
[2022-05-14 23:34:47] [INFO ] Flatten gal took : 80 ms
[2022-05-14 23:34:47] [INFO ] Time to serialize gal into /tmp/LTL18206092904255615081.gal : 28 ms
[2022-05-14 23:34:49] [INFO ] Time to serialize properties into /tmp/LTL16838308070827944058.ltl : 1996 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/LTL18206092904255615081.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16838308070827944058.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/LTL1820609...268
Read 1 LTL properties
Checking formula 0 : !((G(F("(((CAPACITE_0>=50)&&(VIDANGE_1>=1))||((CAPACITE_0>=50)&&(VIDANGE_0>=1)))"))))
Formula 0 simplified : !GF"(((CAPACITE_0>=50)&&(VIDANGE_1>=1))||((CAPACITE_0>=50)&&(VIDANGE_0>=1)))"
Detected timeout of ITS tools.
[2022-05-14 23:35:04] [INFO ] Flatten gal took : 75 ms
[2022-05-14 23:35:04] [INFO ] Applying decomposition
[2022-05-14 23:35:04] [INFO ] Flatten gal took : 75 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/graph10465493966008896334.txt' '-o' '/tmp/graph10465493966008896334.bin' '-w' '/tmp/graph10465493966008896334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10465493966008896334.bin' '-l' '-1' '-v' '-w' '/tmp/graph10465493966008896334.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:35:04] [INFO ] Decomposing Gal with order
[2022-05-14 23:35:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:35:05] [INFO ] Removed a total of 3795 redundant transitions.
[2022-05-14 23:35:05] [INFO ] Flatten gal took : 819 ms
[2022-05-14 23:35:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 441 labels/synchronizations in 34 ms.
[2022-05-14 23:35:05] [INFO ] Time to serialize gal into /tmp/LTL470125736257383319.gal : 5 ms
[2022-05-14 23:35:05] [INFO ] Time to serialize properties into /tmp/LTL17761300204511221451.ltl : 0 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/LTL470125736257383319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17761300204511221451.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/LTL4701257...245
Read 1 LTL properties
Checking formula 0 : !((G(F("(((u0.CAPACITE_0>=50)&&(u4.VIDANGE_1>=1))||((u0.CAPACITE_0>=50)&&(i0.u1.VIDANGE_0>=1)))"))))
Formula 0 simplified : !GF"(((u0.CAPACITE_0>=50)&&(u4.VIDANGE_1>=1))||((u0.CAPACITE_0>=50)&&(i0.u1.VIDANGE_0>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10801984307854781080
[2022-05-14 23:35:20] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10801984307854781080
Running compilation step : cd /tmp/ltsmin10801984307854781080;'/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/ltsmin10801984307854781080;'/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/ltsmin10801984307854781080;'/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-V80P50N10-LTLFireability-00 finished in 68193 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!G((F(X(p0))&&p1)) U G(p2))))'
Support contains 96 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 10 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:35:23] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:35:23] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:35:24] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
[2022-05-14 23:35:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:35:24] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:35:24] [INFO ] Implicit Places using invariants in 214 ms returned []
[2022-05-14 23:35:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:35:24] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:35:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:35:25] [INFO ] Implicit Places using invariants and state equation in 824 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1053 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 16 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 185/186 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (AND p1 p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s170 1) (GEQ s173 1)) (AND (GEQ s170 1) (GEQ s172 1)) (AND (GEQ s170 1) (GEQ s175 1)) (AND (GEQ s170 1) (GEQ s174 1)) (AND (GEQ s171 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4054 reset in 605 ms.
Product exploration explored 100000 steps with 3894 reset in 599 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/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 4 factoid took 310 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (NOT p2), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-14 23:35:27] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:35:27] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:35:28] [INFO ] After 93ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT (AND p1 p0))), (F (NOT p2)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 5 factoid took 415 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p2), (NOT p2), p1]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p2), p1]
Support contains 13 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 11 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:35:28] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:35:28] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:35:29] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
[2022-05-14 23:35:29] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:35:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:35:29] [INFO ] Implicit Places using invariants in 173 ms returned []
[2022-05-14 23:35:29] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:35:29] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:35:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:35:29] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2022-05-14 23:35:30] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:35:30] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:35:30] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2108/2108 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/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 3 factoid took 268 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p2), p1]
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p2 p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p2)), (F (NOT p1)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 3 factoid took 330 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (NOT p2), p1]
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (NOT p2), p1]
Stuttering acceptance computed with spot in 98 ms :[(NOT p2), (NOT p2), p1]
Product exploration explored 100000 steps with 3951 reset in 588 ms.
Product exploration explored 100000 steps with 4043 reset in 587 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p2), p1]
Support contains 13 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 185 transition count 2108
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 1 rules in 250 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:35:33] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:35:33] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 23:35:34] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
[2022-05-14 23:35:34] [INFO ] Redundant transitions in 42 ms returned []
[2022-05-14 23:35:34] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:35:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:35:34] [INFO ] Dead Transitions using invariants and state equation in 580 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/185 places, 2108/2108 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2108/2108 transitions.
Product exploration explored 100000 steps with 4497 reset in 794 ms.
Product exploration explored 100000 steps with 4019 reset in 729 ms.
Built C files in :
/tmp/ltsmin3268092688540474854
[2022-05-14 23:35:36] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3268092688540474854
Running compilation step : cd /tmp/ltsmin3268092688540474854;'/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/ltsmin3268092688540474854;'/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/ltsmin3268092688540474854;'/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 13 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 13 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:35:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:35:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:35:39] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
[2022-05-14 23:35:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:35:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:35:40] [INFO ] Implicit Places using invariants in 286 ms returned []
[2022-05-14 23:35:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:35:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:35:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:35:42] [INFO ] Implicit Places using invariants and state equation in 2483 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2792 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/185 places, 2108/2108 transitions.
Built C files in :
/tmp/ltsmin2848797794984301427
[2022-05-14 23:35:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2848797794984301427
Running compilation step : cd /tmp/ltsmin2848797794984301427;'/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/ltsmin2848797794984301427;'/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/ltsmin2848797794984301427;'/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-14 23:35:46] [INFO ] Flatten gal took : 76 ms
[2022-05-14 23:35:46] [INFO ] Flatten gal took : 103 ms
[2022-05-14 23:35:46] [INFO ] Time to serialize gal into /tmp/LTL10246534907381542197.gal : 12 ms
[2022-05-14 23:35:46] [INFO ] Time to serialize properties into /tmp/LTL11459947864724002455.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/LTL10246534907381542197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11459947864724002455.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/LTL1024653...268
Read 1 LTL properties
Checking formula 0 : !((X((!(G((F(X("((((((((SUR_PONT_A_0<1)||(((CAPACITE_0>=1)&&(NB_ATTENTE_A_72>=1))&&((ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))))||((((CAPACI...7500
Formula 0 simplified : !X(!G("(SUR_PONT_A_0<1)" & FX"((((((((SUR_PONT_A_0<1)||(((CAPACITE_0>=1)&&(NB_ATTENTE_A_72>=1))&&((ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1...7485
Detected timeout of ITS tools.
[2022-05-14 23:36:01] [INFO ] Flatten gal took : 71 ms
[2022-05-14 23:36:01] [INFO ] Applying decomposition
[2022-05-14 23:36:01] [INFO ] Flatten gal took : 73 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/graph630143060232984101.txt' '-o' '/tmp/graph630143060232984101.bin' '-w' '/tmp/graph630143060232984101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph630143060232984101.bin' '-l' '-1' '-v' '-w' '/tmp/graph630143060232984101.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:36:01] [INFO ] Decomposing Gal with order
[2022-05-14 23:36:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:36:02] [INFO ] Removed a total of 4288 redundant transitions.
[2022-05-14 23:36:02] [INFO ] Flatten gal took : 558 ms
[2022-05-14 23:36:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 534 labels/synchronizations in 37 ms.
[2022-05-14 23:36:02] [INFO ] Time to serialize gal into /tmp/LTL13440033504813497836.gal : 2 ms
[2022-05-14 23:36:02] [INFO ] Time to serialize properties into /tmp/LTL3367458836344804605.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/LTL13440033504813497836.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3367458836344804605.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/LTL1344003...246
Read 1 LTL properties
Checking formula 0 : !((X((!(G((F(X("((((((((i0.u0.SUR_PONT_A_0<1)||(((i0.u2.CAPACITE_0>=1)&&(i1.u1.NB_ATTENTE_A_72>=1))&&((i0.u0.ATTENTE_A_0>=1)&&(u4.CONT...9432
Formula 0 simplified : !X(!G("(i0.u0.SUR_PONT_A_0<1)" & FX"((((((((i0.u0.SUR_PONT_A_0<1)||(((i0.u2.CAPACITE_0>=1)&&(i1.u1.NB_ATTENTE_A_72>=1))&&((i0.u0.ATT...9417
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3040362939640400948
[2022-05-14 23:36:17] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3040362939640400948
Running compilation step : cd /tmp/ltsmin3040362939640400948;'/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/ltsmin3040362939640400948;'/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/ltsmin3040362939640400948;'/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-V80P50N10-LTLFireability-01 finished in 56509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F(!(p0 U p0)))))'
Support contains 93 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2104
Applied a total of 9 rules in 544 ms. Remains 181 /186 variables (removed 5) and now considering 2104/2108 (removed 4) transitions.
[2022-05-14 23:36:20] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 181 cols
[2022-05-14 23:36:21] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 23:36:21] [INFO ] Implicit Places using invariants in 186 ms returned []
[2022-05-14 23:36:21] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 181 cols
[2022-05-14 23:36:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 23:36:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:36:22] [INFO ] Implicit Places using invariants and state equation in 927 ms returned [82, 164]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1119 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/186 places, 2104/2108 transitions.
Applied a total of 0 rules in 210 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 179/186 places, 2104/2108 transitions.
Stuttering acceptance computed with spot in 116 ms :[p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s82 1) (GEQ s165 1) (GEQ s172 1)) (AND (GEQ s30 1) (GEQ s82 1) (GEQ s165 1) (GEQ s178 1)) (AND (GEQ s47 1) (GEQ s82 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 206 reset in 3781 ms.
Product exploration explored 100000 steps with 205 reset in 3704 ms.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Finished random walk after 5529 steps, including 11 resets, run visited all 1 properties in 220 ms. (steps per millisecond=25 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[p0, p0]
Stuttering acceptance computed with spot in 83 ms :[p0, p0]
Support contains 93 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 2104/2104 transitions.
Applied a total of 0 rules in 187 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2022-05-14 23:36:30] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 179 cols
[2022-05-14 23:36:30] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 23:36:31] [INFO ] Implicit Places using invariants in 138 ms returned []
[2022-05-14 23:36:31] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 179 cols
[2022-05-14 23:36:31] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 23:36:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:36:31] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2022-05-14 23:36:31] [INFO ] Redundant transitions in 45 ms returned []
[2022-05-14 23:36:31] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 179 cols
[2022-05-14 23:36:31] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 23:36:32] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 179/179 places, 2104/2104 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 1) seen :0
Finished Best-First random walk after 156 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 118 ms :[p0, p0]
Stuttering acceptance computed with spot in 54 ms :[p0, p0]
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Product exploration explored 100000 steps with 202 reset in 3707 ms.
Product exploration explored 100000 steps with 204 reset in 3710 ms.
Built C files in :
/tmp/ltsmin12025430899905569669
[2022-05-14 23:36:40] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2022-05-14 23:36:40] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12025430899905569669
Running compilation step : cd /tmp/ltsmin12025430899905569669;'/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/ltsmin12025430899905569669;'/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/ltsmin12025430899905569669;'/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 93 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 2104/2104 transitions.
Applied a total of 0 rules in 214 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2022-05-14 23:36:43] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 179 cols
[2022-05-14 23:36:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 23:36:43] [INFO ] Implicit Places using invariants in 136 ms returned []
[2022-05-14 23:36:43] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 179 cols
[2022-05-14 23:36:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 23:36:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:36:44] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2022-05-14 23:36:44] [INFO ] Redundant transitions in 41 ms returned []
[2022-05-14 23:36:44] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 179 cols
[2022-05-14 23:36:44] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 23:36:45] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 179/179 places, 2104/2104 transitions.
Built C files in :
/tmp/ltsmin5609426022589996053
[2022-05-14 23:36:45] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2022-05-14 23:36:45] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5609426022589996053
Running compilation step : cd /tmp/ltsmin5609426022589996053;'/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/ltsmin5609426022589996053;'/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/ltsmin5609426022589996053;'/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-14 23:36:48] [INFO ] Flatten gal took : 95 ms
[2022-05-14 23:36:48] [INFO ] Flatten gal took : 93 ms
[2022-05-14 23:36:48] [INFO ] Time to serialize gal into /tmp/LTL16197827004946923352.gal : 9 ms
[2022-05-14 23:36:48] [INFO ] Time to serialize properties into /tmp/LTL968039421339921062.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/LTL16197827004946923352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL968039421339921062.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/LTL1619782...266
Read 1 LTL properties
Checking formula 0 : !((G(F(F(!(("(((((((((((((NB_ATTENTE_A_9>=1)&&(NB_ATTENTE_B_0>=1))&&((CONTROLEUR_1>=1)&&(COMPTEUR_4>=1)))||(((NB_ATTENTE_A_30>=1)&&(NB...153121
Formula 0 simplified : !GF!"(((((((((((((NB_ATTENTE_A_9>=1)&&(NB_ATTENTE_B_0>=1))&&((CONTROLEUR_1>=1)&&(COMPTEUR_4>=1)))||(((NB_ATTENTE_A_30>=1)&&(NB_ATTEN...76566
Detected timeout of ITS tools.
[2022-05-14 23:37:03] [INFO ] Flatten gal took : 92 ms
[2022-05-14 23:37:03] [INFO ] Applying decomposition
[2022-05-14 23:37:03] [INFO ] Flatten gal took : 135 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/graph13176007868740862109.txt' '-o' '/tmp/graph13176007868740862109.bin' '-w' '/tmp/graph13176007868740862109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13176007868740862109.bin' '-l' '-1' '-v' '-w' '/tmp/graph13176007868740862109.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:37:04] [INFO ] Decomposing Gal with order
[2022-05-14 23:37:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:37:04] [INFO ] Removed a total of 3555 redundant transitions.
[2022-05-14 23:37:04] [INFO ] Flatten gal took : 556 ms
[2022-05-14 23:37:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 338 labels/synchronizations in 25 ms.
[2022-05-14 23:37:04] [INFO ] Time to serialize gal into /tmp/LTL7613239392693997333.gal : 1 ms
[2022-05-14 23:37:04] [INFO ] Time to serialize properties into /tmp/LTL2980967028095451368.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/LTL7613239392693997333.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2980967028095451368.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/LTL7613239...245
Read 1 LTL properties
Checking formula 0 : !((G(F(F(!(("(((((((((((((u0.NB_ATTENTE_A_9>=1)&&(u0.NB_ATTENTE_B_0>=1))&&((u0.CONTROLEUR_1>=1)&&(u2.COMPTEUR_4>=1)))||(((u0.NB_ATTENT...174241
Formula 0 simplified : !GF!"(((((((((((((u0.NB_ATTENTE_A_9>=1)&&(u0.NB_ATTENTE_B_0>=1))&&((u0.CONTROLEUR_1>=1)&&(u2.COMPTEUR_4>=1)))||(((u0.NB_ATTENTE_A_30...87126
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4147989997694191998
[2022-05-14 23:37:19] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4147989997694191998
Running compilation step : cd /tmp/ltsmin4147989997694191998;'/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/ltsmin4147989997694191998;'/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/ltsmin4147989997694191998;'/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-V80P50N10-LTLFireability-02 finished in 62363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!((p0 U X(p1)) U p2))))'
Support contains 98 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 39 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 23:37:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:37:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:37:23] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
[2022-05-14 23:37:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:37:23] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:37:23] [INFO ] Implicit Places using invariants in 121 ms returned []
[2022-05-14 23:37:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:37:23] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:37:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:37:24] [INFO ] Implicit Places using invariants and state equation in 643 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 790 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, p1, p2, (AND p1 p2), (AND p1 p2), p1, p2, p2]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 2}]], initial=6, aps=[p1:(OR (AND (GEQ s169 1) (GEQ s172 1)) (AND (GEQ s169 1) (GEQ s171 1)) (AND (GEQ s169 1) (GEQ s174 1)) (AND (GEQ s169 1) (GEQ s173 1)) (AND (GEQ s170 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 2 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-04 finished in 1724 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X((X((G(p1)||p2))&&p0)))&&!p2)))'
Support contains 87 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 18 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 23:37:24] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:37:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:37:25] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
[2022-05-14 23:37:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:37:25] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:37:25] [INFO ] Implicit Places using invariants in 217 ms returned []
[2022-05-14 23:37:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:37:25] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:37:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:37:26] [INFO ] Implicit Places using invariants and state equation in 924 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (OR (LT s146 1) (LT s166 1)) (OR (LT s107 1) (LT s166 1)) (OR (LT s136 1) (LT s166 1)) (OR (LT s117 1) (LT s166 1)) (OR (LT s97 1) (LT s166 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 372 reset in 2234 ms.
Product exploration explored 100000 steps with 374 reset in 2244 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), true, (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-14 23:37:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:37:31] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 23:37:32] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 23:37:32] [INFO ] After 55ms SMT Verify possible using all constraints in real 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 p2) p0 p1), (X (NOT p2)), true, (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p2) p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 462 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 87 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 23 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:37:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:37:33] [INFO ] Computed 5 place invariants in 17 ms
[2022-05-14 23:37:33] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
[2022-05-14 23:37:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:37:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:37:33] [INFO ] Implicit Places using invariants in 205 ms returned []
[2022-05-14 23:37:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:37:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:37:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:37:34] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2022-05-14 23:37:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:37:34] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:37:35] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2107/2107 transitions.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 72 steps, including 0 resets, run visited all 6 properties in 7 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT (AND p1 (NOT p2) p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 385 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 375 reset in 1854 ms.
Product exploration explored 100000 steps with 373 reset in 1874 ms.
Built C files in :
/tmp/ltsmin4272189356190683558
[2022-05-14 23:37:40] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4272189356190683558
Running compilation step : cd /tmp/ltsmin4272189356190683558;'/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/ltsmin4272189356190683558;'/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/ltsmin4272189356190683558;'/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 87 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 14 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:37:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:37:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:37:44] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
[2022-05-14 23:37:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:37:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:37:44] [INFO ] Implicit Places using invariants in 205 ms returned []
[2022-05-14 23:37:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:37:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:37:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:37:45] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
[2022-05-14 23:37:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2022-05-14 23:37:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:37:45] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin6595223047234985452
[2022-05-14 23:37:45] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6595223047234985452
Running compilation step : cd /tmp/ltsmin6595223047234985452;'/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/ltsmin6595223047234985452;'/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/ltsmin6595223047234985452;'/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-14 23:37:48] [INFO ] Flatten gal took : 69 ms
[2022-05-14 23:37:48] [INFO ] Flatten gal took : 69 ms
[2022-05-14 23:37:48] [INFO ] Time to serialize gal into /tmp/LTL4626268638148267777.gal : 8 ms
[2022-05-14 23:37:48] [INFO ] Time to serialize properties into /tmp/LTL8811672356745200394.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/LTL4626268638148267777.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8811672356745200394.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/LTL4626268...266
Read 1 LTL properties
Checking formula 0 : !((X((F(X(((X((G("((((((((((CAPACITE_0<1)||(NB_ATTENTE_B_21<1))||((ATTENTE_B_0<1)||(CONTROLEUR_1<1)))&&(((CAPACITE_0<1)||(NB_ATTENTE_B...13140
Formula 0 simplified : !X("(((((((((NB_ATTENTE_B_62>=1)&&(ROUTE_B_0>=1))||((NB_ATTENTE_B_23>=1)&&(ROUTE_B_0>=1)))||(((NB_ATTENTE_B_52>=1)&&(ROUTE_B_0>=1))|...13122
Detected timeout of ITS tools.
[2022-05-14 23:38:04] [INFO ] Flatten gal took : 68 ms
[2022-05-14 23:38:04] [INFO ] Applying decomposition
[2022-05-14 23:38:04] [INFO ] Flatten gal took : 121 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/graph9676688886541885026.txt' '-o' '/tmp/graph9676688886541885026.bin' '-w' '/tmp/graph9676688886541885026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9676688886541885026.bin' '-l' '-1' '-v' '-w' '/tmp/graph9676688886541885026.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:38:04] [INFO ] Decomposing Gal with order
[2022-05-14 23:38:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:38:04] [INFO ] Removed a total of 4137 redundant transitions.
[2022-05-14 23:38:05] [INFO ] Flatten gal took : 561 ms
[2022-05-14 23:38:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 553 labels/synchronizations in 23 ms.
[2022-05-14 23:38:05] [INFO ] Time to serialize gal into /tmp/LTL3913373737833606577.gal : 2 ms
[2022-05-14 23:38:05] [INFO ] Time to serialize properties into /tmp/LTL11649050326768676785.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/LTL3913373737833606577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11649050326768676785.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/LTL3913373...246
Read 1 LTL properties
Checking formula 0 : !((X((F(X(((X((G("((((((((((i0.u0.CAPACITE_0<1)||(i2.u1.NB_ATTENTE_B_21<1))||((i0.u3.ATTENTE_B_0<1)||(u2.CONTROLEUR_1<1)))&&(((i0.u0.C...16779
Formula 0 simplified : !X("(((((((((i0.u3.NB_ATTENTE_B_62>=1)&&(i0.u3.ROUTE_B_0>=1))||((i2.u1.NB_ATTENTE_B_23>=1)&&(i0.u3.ROUTE_B_0>=1)))||(((i2.u1.NB_ATTE...16761
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6710957366689388318
[2022-05-14 23:38:20] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6710957366689388318
Running compilation step : cd /tmp/ltsmin6710957366689388318;'/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/ltsmin6710957366689388318;'/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/ltsmin6710957366689388318;'/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-V80P50N10-LTLFireability-05 finished in 58634 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&G(p1))||(X(X(p2))&&X(p1))))'
Support contains 176 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 9 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:38:23] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:38:23] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:38:23] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
[2022-05-14 23:38:23] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:38:23] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:38:23] [INFO ] Implicit Places using invariants in 100 ms returned []
[2022-05-14 23:38:23] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:38:23] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:38:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:38:24] [INFO ] Implicit Places using invariants and state equation in 369 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 480 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 9 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 185/186 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={} source=6 dest: 2}, { cond=(NOT p1), acceptance={} source=6 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 9}], [{ cond=p1, acceptance={} source=8 dest: 2}, { cond=(NOT p1), acceptance={} source=8 dest: 3}], [{ cond=(NOT p1), acceptance={} source=9 dest: 3}, { cond=p1, acceptance={} source=9 dest: 9}]], initial=5, aps=[p2:(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, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-06 finished in 1487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 93 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2104
Applied a total of 9 rules in 294 ms. Remains 181 /186 variables (removed 5) and now considering 2104/2108 (removed 4) transitions.
[2022-05-14 23:38:24] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 181 cols
[2022-05-14 23:38:24] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 23:38:25] [INFO ] Implicit Places using invariants in 169 ms returned []
[2022-05-14 23:38:25] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 181 cols
[2022-05-14 23:38:25] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 23:38:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:38:26] [INFO ] Implicit Places using invariants and state equation in 895 ms returned [82, 164]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1069 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/186 places, 2104/2108 transitions.
Applied a total of 0 rules in 207 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 179/186 places, 2104/2108 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s82 1) (GEQ s165 1) (GEQ s172 1)) (AND (GEQ s30 1) (GEQ s82 1) (GEQ s165 1) (GEQ s178 1)) (AND (GEQ s47 1) (GEQ s82 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 497 steps with 0 reset in 42 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-07 finished in 1676 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(p0 U (!G(F(p1)) U p2)))))'
Support contains 165 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 12 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:38:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:38:26] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:38:26] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
[2022-05-14 23:38:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:38:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:38:27] [INFO ] Implicit Places using invariants in 163 ms returned []
[2022-05-14 23:38:27] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:38:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:38:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:38:27] [INFO ] Implicit Places using invariants and state equation in 655 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 823 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/186 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 330 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s34 1) (GEQ s82 1)) (AND (GEQ s24 1) (GEQ s82 1)) (AND (GEQ s5 1) (GEQ s82 1)) (AND (GEQ s54 1) (GEQ s82 1)) (AND (GEQ s73 1) (GEQ s...], 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 148 reset in 1342 ms.
Product exploration explored 100000 steps with 148 reset in 1278 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 436 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Finished random walk after 5918 steps, including 8 resets, run visited all 5 properties in 60 ms. (steps per millisecond=98 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 588 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
[2022-05-14 23:38:32] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:38:32] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:38:33] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:38:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:38:33] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2022-05-14 23:38:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:38:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:38:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:38:35] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-05-14 23:38:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:38:35] [INFO ] [Nat]Added 22 Read/Feed constraints in 516 ms returned sat
[2022-05-14 23:38:35] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 50 ms.
[2022-05-14 23:38:35] [INFO ] Added : 9 causal constraints over 2 iterations in 170 ms. Result :sat
Could not prove EG p2
Support contains 165 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:38:35] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:38:35] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:38:36] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
[2022-05-14 23:38:36] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:38:36] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:38:36] [INFO ] Implicit Places using invariants in 161 ms returned []
[2022-05-14 23:38:36] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:38:36] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:38:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:38:37] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2022-05-14 23:38:37] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:38:37] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:38:37] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2108/2108 transitions.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 641 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Finished random walk after 4433 steps, including 6 resets, run visited all 5 properties in 70 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 623 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 156 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
[2022-05-14 23:38:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:38:39] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 23:38:40] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:38:41] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2022-05-14 23:38:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:38:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:38:42] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-05-14 23:38:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:38:43] [INFO ] [Nat]Added 22 Read/Feed constraints in 531 ms returned sat
[2022-05-14 23:38:43] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 62 ms.
[2022-05-14 23:38:43] [INFO ] Added : 9 causal constraints over 2 iterations in 192 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 142 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Product exploration explored 100000 steps with 148 reset in 1287 ms.
Product exploration explored 100000 steps with 148 reset in 1284 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 151 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Support contains 165 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 184 transition count 2108
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 1 rules in 163 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:38:46] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:38:46] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:38:47] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
[2022-05-14 23:38:47] [INFO ] Redundant transitions in 41 ms returned []
[2022-05-14 23:38:47] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:38:47] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:38:47] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/184 places, 2108/2108 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2108/2108 transitions.
Product exploration explored 100000 steps with 168 reset in 1081 ms.
Product exploration explored 100000 steps with 168 reset in 1137 ms.
Built C files in :
/tmp/ltsmin9402312144597861228
[2022-05-14 23:38:49] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9402312144597861228
Running compilation step : cd /tmp/ltsmin9402312144597861228;'/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/ltsmin9402312144597861228;'/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/ltsmin9402312144597861228;'/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 165 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:38:52] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:38:52] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:38:53] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
[2022-05-14 23:38:53] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:38:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:38:53] [INFO ] Implicit Places using invariants in 158 ms returned []
[2022-05-14 23:38:53] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:38:53] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:38:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:38:54] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2022-05-14 23:38:54] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2022-05-14 23:38:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:38:54] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2108/2108 transitions.
Built C files in :
/tmp/ltsmin11673687041895342245
[2022-05-14 23:38:54] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11673687041895342245
Running compilation step : cd /tmp/ltsmin11673687041895342245;'/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/ltsmin11673687041895342245;'/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/ltsmin11673687041895342245;'/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-14 23:38:58] [INFO ] Flatten gal took : 90 ms
[2022-05-14 23:38:58] [INFO ] Flatten gal took : 80 ms
[2022-05-14 23:38:58] [INFO ] Time to serialize gal into /tmp/LTL3138720295032781538.gal : 8 ms
[2022-05-14 23:38:58] [INFO ] Time to serialize properties into /tmp/LTL389127604411542076.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/LTL3138720295032781538.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL389127604411542076.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/LTL3138720...265
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("((((((((((NB_ATTENTE_A_33>=1)&&(ROUTE_A_0>=1))||((NB_ATTENTE_A_23>=1)&&(ROUTE_A_0>=1)))||(((NB_ATTENTE_A_4>=1)&&(ROUTE_A_0>...10245
Formula 0 simplified : !XF!("((((((((((NB_ATTENTE_A_33>=1)&&(ROUTE_A_0>=1))||((NB_ATTENTE_A_23>=1)&&(ROUTE_A_0>=1)))||(((NB_ATTENTE_A_4>=1)&&(ROUTE_A_0>=1)...10231
Detected timeout of ITS tools.
[2022-05-14 23:39:13] [INFO ] Flatten gal took : 105 ms
[2022-05-14 23:39:13] [INFO ] Applying decomposition
[2022-05-14 23:39:13] [INFO ] Flatten gal took : 85 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/graph14764464147424882776.txt' '-o' '/tmp/graph14764464147424882776.bin' '-w' '/tmp/graph14764464147424882776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14764464147424882776.bin' '-l' '-1' '-v' '-w' '/tmp/graph14764464147424882776.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:39:13] [INFO ] Decomposing Gal with order
[2022-05-14 23:39:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:39:14] [INFO ] Removed a total of 3713 redundant transitions.
[2022-05-14 23:39:14] [INFO ] Flatten gal took : 603 ms
[2022-05-14 23:39:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 437 labels/synchronizations in 15 ms.
[2022-05-14 23:39:14] [INFO ] Time to serialize gal into /tmp/LTL16044490580367908837.gal : 2 ms
[2022-05-14 23:39:14] [INFO ] Time to serialize properties into /tmp/LTL13877990553002074652.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/LTL16044490580367908837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13877990553002074652.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/LTL1604449...247
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("((((((((((i2.u3.NB_ATTENTE_A_33>=1)&&(i2.u3.ROUTE_A_0>=1))||((i2.u3.NB_ATTENTE_A_23>=1)&&(i2.u3.ROUTE_A_0>=1)))||(((i2.u3.N...12675
Formula 0 simplified : !XF!("((((((((((i2.u3.NB_ATTENTE_A_33>=1)&&(i2.u3.ROUTE_A_0>=1))||((i2.u3.NB_ATTENTE_A_23>=1)&&(i2.u3.ROUTE_A_0>=1)))||(((i2.u3.NB_A...12661
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5863517612500650335
[2022-05-14 23:39:29] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5863517612500650335
Running compilation step : cd /tmp/ltsmin5863517612500650335;'/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/ltsmin5863517612500650335;'/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/ltsmin5863517612500650335;'/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-V80P50N10-LTLFireability-08 finished in 66053 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 93 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2104
Applied a total of 9 rules in 249 ms. Remains 181 /186 variables (removed 5) and now considering 2104/2108 (removed 4) transitions.
[2022-05-14 23:39:32] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 181 cols
[2022-05-14 23:39:32] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 23:39:32] [INFO ] Implicit Places using invariants in 164 ms returned []
[2022-05-14 23:39:32] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
// Phase 1: matrix 366 rows 181 cols
[2022-05-14 23:39:32] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 23:39:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:39:33] [INFO ] Implicit Places using invariants and state equation in 884 ms returned [82, 164]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1078 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/186 places, 2104/2108 transitions.
Applied a total of 0 rules in 181 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 179/186 places, 2104/2108 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s82 1) (GEQ s165 1) (GEQ s172 1)) (AND (GEQ s30 1) (GEQ s82 1) (GEQ s165 1) (GEQ s178 1)) (AND (GEQ s47 1) (GEQ s82 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 497 steps with 0 reset in 25 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-09 finished in 1636 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(X(p0))))||X(X((F(p2)&&p1)))))'
Support contains 167 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 23 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 23:39:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:39:34] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:39:34] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
[2022-05-14 23:39:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:39:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:39:34] [INFO ] Implicit Places using invariants in 134 ms returned []
[2022-05-14 23:39:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:39:34] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:39:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:39:35] [INFO ] Implicit Places using invariants and state equation in 419 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 559 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p2:(OR (AND (GEQ s34 1) (GEQ s82 1)) (AND (GEQ s24 1) (GEQ s82 1)) (AND (GEQ s5 1) (GEQ s82 1)) (AND (GEQ s54 1) (GEQ s82 1)) (AND (GEQ s73 1) (GEQ s82 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-10 finished in 1404 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p0&&(F(p1)||p2))))'
Support contains 97 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 13 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:39:35] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:39:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:39:36] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
[2022-05-14 23:39:36] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:39:36] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:39:36] [INFO ] Implicit Places using invariants in 150 ms returned []
[2022-05-14 23:39:36] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:39:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:39:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:39:36] [INFO ] Implicit Places using invariants and state equation in 792 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 946 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/186 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s104 1) (GEQ s167 1) (GEQ s171 1)) (AND (GEQ s1 1) (GEQ s154 1) (GEQ s167 1) (GEQ s178 1)) (AND (GEQ s1 1) (GEQ s130 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-11 finished in 1812 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((G(F(p0))&&G(p0))))))'
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 22 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 23:39:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:39:37] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:39:37] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
[2022-05-14 23:39:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:39:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:39:38] [INFO ] Implicit Places using invariants in 329 ms returned []
[2022-05-14 23:39:38] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:39:38] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:39:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:39:39] [INFO ] Implicit Places using invariants and state equation in 1313 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1647 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 17 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 183/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-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:(OR (AND (GEQ s168 1) (GEQ s180 1)) (AND (GEQ s169 1) (GEQ s180 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-12 finished in 2349 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F((X(p1)&&p0)))&&F(!p1)))'
Support contains 85 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 22 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 23:39:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:39:39] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:39:40] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
[2022-05-14 23:39:40] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:39:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:39:40] [INFO ] Implicit Places using invariants in 240 ms returned []
[2022-05-14 23:39:40] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:39:40] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:39:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:39:41] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1356 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 12 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 183/186 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (OR (NOT p0) (NOT p1)), p1, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s168 1) (LT s180 1)) (OR (LT s169 1) (LT s180 1)) (OR (LT s146 1) (LT s165 1)) (OR (LT s107 1) (LT s165 1)) (OR (LT s136 1) (LT s165 1)) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 372 reset in 774 ms.
Product exploration explored 100000 steps with 375 reset in 789 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 409 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-14 23:39:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:39:44] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 23:39:44] [INFO ] After 48ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 412 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2022-05-14 23:39:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:39:44] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:39:46] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:39:46] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2022-05-14 23:39:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:39:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-14 23:39:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:39:47] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2022-05-14 23:39:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:39:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-14 23:39:53] [INFO ] [Nat]Added 22 Read/Feed constraints in 6035 ms returned unknown
Could not prove EG (NOT p1)
Support contains 85 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 14 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:39:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:39:53] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:39:54] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
[2022-05-14 23:39:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:39:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:39:54] [INFO ] Implicit Places using invariants in 231 ms returned []
[2022-05-14 23:39:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:39:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:39:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:39:55] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
[2022-05-14 23:39:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:39:55] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:39:56] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 266 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 301 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2022-05-14 23:39:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:39:56] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 23:39:58] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:39:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:39:58] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2022-05-14 23:39:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:39:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:39:59] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-14 23:39:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:40:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-14 23:40:05] [INFO ] [Nat]Added 22 Read/Feed constraints in 6016 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 373 reset in 779 ms.
Product exploration explored 100000 steps with 374 reset in 786 ms.
Built C files in :
/tmp/ltsmin7835416251074131452
[2022-05-14 23:40:07] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7835416251074131452
Running compilation step : cd /tmp/ltsmin7835416251074131452;'/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/ltsmin7835416251074131452;'/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/ltsmin7835416251074131452;'/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 85 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 17 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:40:10] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:40:10] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 23:40:11] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
[2022-05-14 23:40:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:40:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:40:11] [INFO ] Implicit Places using invariants in 272 ms returned []
[2022-05-14 23:40:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:40:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:40:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:40:12] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
[2022-05-14 23:40:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:40:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:40:12] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin10145529403365668728
[2022-05-14 23:40:12] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10145529403365668728
Running compilation step : cd /tmp/ltsmin10145529403365668728;'/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/ltsmin10145529403365668728;'/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/ltsmin10145529403365668728;'/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-14 23:40:16] [INFO ] Flatten gal took : 64 ms
[2022-05-14 23:40:16] [INFO ] Flatten gal took : 64 ms
[2022-05-14 23:40:16] [INFO ] Time to serialize gal into /tmp/LTL11882172641564515044.gal : 8 ms
[2022-05-14 23:40:16] [INFO ] Time to serialize properties into /tmp/LTL1334193987244408889.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/LTL11882172641564515044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1334193987244408889.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/LTL1188217...267
Read 1 LTL properties
Checking formula 0 : !(((F(F((((((((X("(((((((((NB_ATTENTE_B_62<1)||(ROUTE_B_0<1))&&((NB_ATTENTE_B_23<1)||(ROUTE_B_0<1)))&&(((NB_ATTENTE_B_52<1)||(ROUTE_B_...9988
Formula 0 simplified : !(F("(((((((NB_ATTENTE_B_10<1)||(ROUTE_B_0<1))&&((NB_ATTENTE_B_70<1)||(ROUTE_B_0<1)))&&(((NB_ATTENTE_B_55<1)||(ROUTE_B_0<1))&&((NB_A...9957
Detected timeout of ITS tools.
[2022-05-14 23:40:31] [INFO ] Flatten gal took : 80 ms
[2022-05-14 23:40:31] [INFO ] Applying decomposition
[2022-05-14 23:40:31] [INFO ] Flatten gal took : 66 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/graph12362220813589666115.txt' '-o' '/tmp/graph12362220813589666115.bin' '-w' '/tmp/graph12362220813589666115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12362220813589666115.bin' '-l' '-1' '-v' '-w' '/tmp/graph12362220813589666115.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:40:31] [INFO ] Decomposing Gal with order
[2022-05-14 23:40:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:40:32] [INFO ] Removed a total of 4248 redundant transitions.
[2022-05-14 23:40:32] [INFO ] Flatten gal took : 502 ms
[2022-05-14 23:40:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 533 labels/synchronizations in 24 ms.
[2022-05-14 23:40:32] [INFO ] Time to serialize gal into /tmp/LTL6568862836891541253.gal : 2 ms
[2022-05-14 23:40:32] [INFO ] Time to serialize properties into /tmp/LTL14080866050118538401.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/LTL6568862836891541253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14080866050118538401.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/LTL6568862...246
Read 1 LTL properties
Checking formula 0 : !(((F(F((((((((X("(((((((((i1.u1.NB_ATTENTE_B_62<1)||(i0.u4.ROUTE_B_0<1))&&((i0.u4.NB_ATTENTE_B_23<1)||(i0.u4.ROUTE_B_0<1)))&&(((i1.u1...12919
Formula 0 simplified : !(F("(((((((i0.u4.NB_ATTENTE_B_77<1)||(i0.u4.ROUTE_B_0<1))&&((i0.u4.NB_ATTENTE_B_39<1)||(i0.u4.ROUTE_B_0<1)))&&(((i1.u1.NB_ATTENTE_B...12888
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17020119946261213211
[2022-05-14 23:40:47] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17020119946261213211
Running compilation step : cd /tmp/ltsmin17020119946261213211;'/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/ltsmin17020119946261213211;'/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/ltsmin17020119946261213211;'/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-V80P50N10-LTLFireability-13 finished in 70741 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!G((F(X(p0))&&p1)) U G(p2))))'
Found a SL insensitive property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-01
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p2), (AND p1 p0)]
Support contains 96 out of 186 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 31 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:40:50] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:40:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:40:51] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
[2022-05-14 23:40:51] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:40:51] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:40:51] [INFO ] Implicit Places using invariants in 180 ms returned []
[2022-05-14 23:40:51] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2022-05-14 23:40:51] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:40:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:40:52] [INFO ] Implicit Places using invariants and state equation in 765 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 952 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 185/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 19 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 185/186 places, 2108/2108 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s170 1) (GEQ s173 1)) (AND (GEQ s170 1) (GEQ s172 1)) (AND (GEQ s170 1) (GEQ s175 1)) (AND (GEQ s170 1) (GEQ s174 1)) (AND (GEQ s171 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3929 reset in 567 ms.
Product exploration explored 100000 steps with 3858 reset in 606 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/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 4 factoid took 326 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), (NOT p2), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-14 23:40:53] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:40:53] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:40:54] [INFO ] After 50ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT (AND p1 p0))), (F (NOT p2)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 5 factoid took 374 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p2), (NOT p2), p1]
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (NOT p2), p1]
Support contains 13 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 11 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:40:54] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:40:54] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:40:55] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
[2022-05-14 23:40:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:40:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:40:55] [INFO ] Implicit Places using invariants in 174 ms returned []
[2022-05-14 23:40:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:40:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:40:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:40:56] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
[2022-05-14 23:40:56] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:40:56] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-14 23:40:56] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2108/2108 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/185 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 3 factoid took 255 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (NOT p2), p1]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p2 p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p2)), (F (NOT p1)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 3 factoid took 310 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (NOT p2), p1]
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p2), p1]
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p2), p1]
Product exploration explored 100000 steps with 3882 reset in 568 ms.
Product exploration explored 100000 steps with 3976 reset in 566 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (NOT p2), p1]
Support contains 13 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 185 transition count 2108
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 1 rules in 201 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:40:59] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:40:59] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:40:59] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
[2022-05-14 23:40:59] [INFO ] Redundant transitions in 42 ms returned []
[2022-05-14 23:40:59] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:40:59] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:41:00] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/185 places, 2108/2108 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2108/2108 transitions.
Product exploration explored 100000 steps with 4361 reset in 711 ms.
Product exploration explored 100000 steps with 4304 reset in 717 ms.
Built C files in :
/tmp/ltsmin9707935619948162636
[2022-05-14 23:41:01] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9707935619948162636
Running compilation step : cd /tmp/ltsmin9707935619948162636;'/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/ltsmin9707935619948162636;'/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/ltsmin9707935619948162636;'/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 13 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 18 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2022-05-14 23:41:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:41:04] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 23:41:05] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
[2022-05-14 23:41:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:41:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:41:05] [INFO ] Implicit Places using invariants in 251 ms returned []
[2022-05-14 23:41:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2022-05-14 23:41:05] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:41:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:41:09] [INFO ] Implicit Places using invariants and state equation in 4216 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4473 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/185 places, 2108/2108 transitions.
Built C files in :
/tmp/ltsmin17732532335207321111
[2022-05-14 23:41:10] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17732532335207321111
Running compilation step : cd /tmp/ltsmin17732532335207321111;'/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/ltsmin17732532335207321111;'/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/ltsmin17732532335207321111;'/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-14 23:41:13] [INFO ] Flatten gal took : 119 ms
[2022-05-14 23:41:13] [INFO ] Flatten gal took : 63 ms
[2022-05-14 23:41:13] [INFO ] Time to serialize gal into /tmp/LTL6772868521043662217.gal : 8 ms
[2022-05-14 23:41:13] [INFO ] Time to serialize properties into /tmp/LTL6453799936740861638.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/LTL6772868521043662217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6453799936740861638.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/LTL6772868...266
Read 1 LTL properties
Checking formula 0 : !((X((!(G((F(X("((((((((SUR_PONT_A_0<1)||(((CAPACITE_0>=1)&&(NB_ATTENTE_A_72>=1))&&((ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))))||((((CAPACI...7500
Formula 0 simplified : !X(!G("(SUR_PONT_A_0<1)" & FX"((((((((SUR_PONT_A_0<1)||(((CAPACITE_0>=1)&&(NB_ATTENTE_A_72>=1))&&((ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1...7485
Detected timeout of ITS tools.
[2022-05-14 23:41:28] [INFO ] Flatten gal took : 65 ms
[2022-05-14 23:41:28] [INFO ] Applying decomposition
[2022-05-14 23:41:28] [INFO ] Flatten gal took : 66 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/graph4120969660143254311.txt' '-o' '/tmp/graph4120969660143254311.bin' '-w' '/tmp/graph4120969660143254311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4120969660143254311.bin' '-l' '-1' '-v' '-w' '/tmp/graph4120969660143254311.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:41:28] [INFO ] Decomposing Gal with order
[2022-05-14 23:41:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:41:29] [INFO ] Removed a total of 3872 redundant transitions.
[2022-05-14 23:41:29] [INFO ] Flatten gal took : 710 ms
[2022-05-14 23:41:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 595 labels/synchronizations in 20 ms.
[2022-05-14 23:41:29] [INFO ] Time to serialize gal into /tmp/LTL5629667896268268225.gal : 1 ms
[2022-05-14 23:41:29] [INFO ] Time to serialize properties into /tmp/LTL4672362089864854045.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/LTL5629667896268268225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4672362089864854045.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/LTL5629667...245
Read 1 LTL properties
Checking formula 0 : !((X((!(G((F(X("((((((((i0.u0.SUR_PONT_A_0<1)||(((i0.u0.CAPACITE_0>=1)&&(i1.u3.NB_ATTENTE_A_72>=1))&&((i0.u1.ATTENTE_A_0>=1)&&(u4.CONT...9432
Formula 0 simplified : !X(!G("(i0.u0.SUR_PONT_A_0<1)" & FX"((((((((i0.u0.SUR_PONT_A_0<1)||(((i0.u0.CAPACITE_0>=1)&&(i1.u3.NB_ATTENTE_A_72>=1))&&((i0.u1.ATT...9417
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16503944028491517207
[2022-05-14 23:41:44] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16503944028491517207
Running compilation step : cd /tmp/ltsmin16503944028491517207;'/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/ltsmin16503944028491517207;'/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/ltsmin16503944028491517207;'/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-V80P50N10-LTLFireability-01 finished in 57218 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F(!(p0 U p0)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X((X((G(p1)||p2))&&p0)))&&!p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(p0 U (!G(F(p1)) U p2)))))'
Found a CL insensitive property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-08
Stuttering acceptance computed with spot in 250 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Support contains 165 out of 186 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 29 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
[2022-05-14 23:41:48] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:41:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:41:49] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
[2022-05-14 23:41:49] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:41:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:41:49] [INFO ] Implicit Places using invariants in 165 ms returned []
[2022-05-14 23:41:49] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2022-05-14 23:41:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:41:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:41:50] [INFO ] Implicit Places using invariants and state equation in 815 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 986 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 183/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 19 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 183/186 places, 2107/2108 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s34 1) (GEQ s82 1)) (AND (GEQ s24 1) (GEQ s82 1)) (AND (GEQ s5 1) (GEQ s82 1)) (AND (GEQ s54 1) (GEQ s82 1)) (AND (GEQ s73 1) (GEQ s...], 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 168 reset in 1277 ms.
Product exploration explored 100000 steps with 168 reset in 1299 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 593 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Finished random walk after 836 steps, including 1 resets, run visited all 5 properties in 15 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 553 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 129 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
[2022-05-14 23:41:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:41:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:41:55] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-14 23:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:41:55] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2022-05-14 23:41:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:41:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:41:57] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2022-05-14 23:41:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:41:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 102 ms returned sat
[2022-05-14 23:41:57] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 49 ms.
[2022-05-14 23:41:57] [INFO ] Added : 12 causal constraints over 4 iterations in 171 ms. Result :sat
Could not prove EG p2
Support contains 165 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 10 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:41:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:41:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:41:58] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
[2022-05-14 23:41:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:41:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:41:58] [INFO ] Implicit Places using invariants in 159 ms returned []
[2022-05-14 23:41:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:41:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:41:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:41:58] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2022-05-14 23:41:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:41:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:41:59] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 546 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 161 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Finished random walk after 2059 steps, including 3 resets, run visited all 5 properties in 32 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 661 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 146 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
[2022-05-14 23:42:01] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:42:01] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:42:02] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-14 23:42:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:42:02] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2022-05-14 23:42:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:42:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 23:42:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:42:03] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2022-05-14 23:42:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:42:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 99 ms returned sat
[2022-05-14 23:42:04] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 60 ms.
[2022-05-14 23:42:04] [INFO ] Added : 12 causal constraints over 4 iterations in 187 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 146 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Product exploration explored 100000 steps with 168 reset in 1259 ms.
Product exploration explored 100000 steps with 168 reset in 1270 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 134 ms :[p2, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Support contains 165 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 134 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:42:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:42:07] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:42:07] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
[2022-05-14 23:42:07] [INFO ] Redundant transitions in 41 ms returned []
[2022-05-14 23:42:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:42:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:42:08] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Product exploration explored 100000 steps with 168 reset in 1071 ms.
Product exploration explored 100000 steps with 168 reset in 1086 ms.
Built C files in :
/tmp/ltsmin13146803797860582928
[2022-05-14 23:42:10] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13146803797860582928
Running compilation step : cd /tmp/ltsmin13146803797860582928;'/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/ltsmin13146803797860582928;'/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/ltsmin13146803797860582928;'/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 165 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 9 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2022-05-14 23:42:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:42:13] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:42:14] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
[2022-05-14 23:42:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:42:14] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 23:42:14] [INFO ] Implicit Places using invariants in 151 ms returned []
[2022-05-14 23:42:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:42:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 23:42:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:42:14] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2022-05-14 23:42:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2022-05-14 23:42:14] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 23:42:15] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin15355520580733201130
[2022-05-14 23:42:15] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15355520580733201130
Running compilation step : cd /tmp/ltsmin15355520580733201130;'/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/ltsmin15355520580733201130;'/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/ltsmin15355520580733201130;'/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-14 23:42:18] [INFO ] Flatten gal took : 61 ms
[2022-05-14 23:42:18] [INFO ] Flatten gal took : 61 ms
[2022-05-14 23:42:18] [INFO ] Time to serialize gal into /tmp/LTL9148090264838318760.gal : 8 ms
[2022-05-14 23:42:18] [INFO ] Time to serialize properties into /tmp/LTL12025221183662361052.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/LTL9148090264838318760.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12025221183662361052.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/LTL9148090...267
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("((((((((((NB_ATTENTE_A_33>=1)&&(ROUTE_A_0>=1))||((NB_ATTENTE_A_23>=1)&&(ROUTE_A_0>=1)))||(((NB_ATTENTE_A_4>=1)&&(ROUTE_A_0>...10245
Formula 0 simplified : !XF!("((((((((((NB_ATTENTE_A_33>=1)&&(ROUTE_A_0>=1))||((NB_ATTENTE_A_23>=1)&&(ROUTE_A_0>=1)))||(((NB_ATTENTE_A_4>=1)&&(ROUTE_A_0>=1)...10231
Detected timeout of ITS tools.
[2022-05-14 23:42:33] [INFO ] Flatten gal took : 60 ms
[2022-05-14 23:42:33] [INFO ] Applying decomposition
[2022-05-14 23:42:33] [INFO ] Flatten gal took : 96 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/graph3322457933808060671.txt' '-o' '/tmp/graph3322457933808060671.bin' '-w' '/tmp/graph3322457933808060671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3322457933808060671.bin' '-l' '-1' '-v' '-w' '/tmp/graph3322457933808060671.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:42:34] [INFO ] Decomposing Gal with order
[2022-05-14 23:42:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:42:34] [INFO ] Removed a total of 4594 redundant transitions.
[2022-05-14 23:42:34] [INFO ] Flatten gal took : 375 ms
[2022-05-14 23:42:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 509 labels/synchronizations in 22 ms.
[2022-05-14 23:42:34] [INFO ] Time to serialize gal into /tmp/LTL12952741850603160576.gal : 1 ms
[2022-05-14 23:42:34] [INFO ] Time to serialize properties into /tmp/LTL8421903317252028984.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/LTL12952741850603160576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8421903317252028984.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/LTL1295274...246
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("((((((((((u5.NB_ATTENTE_A_33>=1)&&(u5.ROUTE_A_0>=1))||((u5.NB_ATTENTE_A_23>=1)&&(u5.ROUTE_A_0>=1)))||(((u5.NB_ATTENTE_A_4>=...12198
Formula 0 simplified : !XF!("((((((((((u5.NB_ATTENTE_A_33>=1)&&(u5.ROUTE_A_0>=1))||((u5.NB_ATTENTE_A_23>=1)&&(u5.ROUTE_A_0>=1)))||(((u5.NB_ATTENTE_A_4>=1)&...12184
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16464085112379612024
[2022-05-14 23:42:49] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16464085112379612024
Running compilation step : cd /tmp/ltsmin16464085112379612024;'/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/ltsmin16464085112379612024;'/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/ltsmin16464085112379612024;'/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-V80P50N10-LTLFireability-08 finished in 64868 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F((X(p1)&&p0)))&&F(!p1)))'
Found a CL insensitive property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-13
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p0) (NOT p1)), p1, (NOT p1)]
Support contains 85 out of 186 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2106
Applied a total of 5 rules in 50 ms. Remains 183 /186 variables (removed 3) and now considering 2106/2108 (removed 2) transitions.
[2022-05-14 23:42:52] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 183 cols
[2022-05-14 23:42:52] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 23:42:53] [INFO ] Implicit Places using invariants in 424 ms returned []
[2022-05-14 23:42:53] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 183 cols
[2022-05-14 23:42:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 23:42:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:42:54] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned [82, 164]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1763 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 181/186 places, 2106/2108 transitions.
Applied a total of 0 rules in 22 ms. Remains 181 /181 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 181/186 places, 2106/2108 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s166 1) (LT s178 1)) (OR (LT s167 1) (LT s178 1)) (OR (LT s144 1) (LT s163 1)) (OR (LT s105 1) (LT s163 1)) (OR (LT s134 1) (LT s163 1)) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 423 reset in 747 ms.
Product exploration explored 100000 steps with 419 reset in 767 ms.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/181 stabilizing places and 322/2106 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 344 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-14 23:42:56] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 181 cols
[2022-05-14 23:42:56] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 23:42:56] [INFO ] After 37ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 434 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2022-05-14 23:42:57] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 181 cols
[2022-05-14 23:42:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 23:42:58] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-14 23:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:42:59] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-05-14 23:42:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:43:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-14 23:43:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:43:00] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2022-05-14 23:43:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:43:03] [INFO ] [Nat]Added 22 Read/Feed constraints in 2967 ms returned sat
[2022-05-14 23:43:03] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2022-05-14 23:43:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2022-05-14 23:43:03] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 48 ms.
[2022-05-14 23:43:03] [INFO ] Added : 12 causal constraints over 6 iterations in 255 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 85 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 2106/2106 transitions.
Applied a total of 0 rules in 14 ms. Remains 181 /181 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2022-05-14 23:43:03] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 181 cols
[2022-05-14 23:43:03] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 23:43:04] [INFO ] Implicit Places using invariants in 203 ms returned []
[2022-05-14 23:43:04] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 181 cols
[2022-05-14 23:43:04] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 23:43:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:43:05] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
[2022-05-14 23:43:05] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 181 cols
[2022-05-14 23:43:05] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 23:43:05] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/181 places, 2106/2106 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/181 stabilizing places and 322/2106 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 256 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2022-05-14 23:43:06] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 181 cols
[2022-05-14 23:43:06] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 23:43:07] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-14 23:43:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:43:07] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2022-05-14 23:43:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:43:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-05-14 23:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:43:09] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2022-05-14 23:43:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:43:12] [INFO ] [Nat]Added 22 Read/Feed constraints in 2957 ms returned sat
[2022-05-14 23:43:12] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
[2022-05-14 23:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2022-05-14 23:43:12] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 46 ms.
[2022-05-14 23:43:12] [INFO ] Added : 12 causal constraints over 6 iterations in 243 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 422 reset in 756 ms.
Product exploration explored 100000 steps with 423 reset in 726 ms.
Built C files in :
/tmp/ltsmin7616980675781006734
[2022-05-14 23:43:14] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7616980675781006734
Running compilation step : cd /tmp/ltsmin7616980675781006734;'/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/ltsmin7616980675781006734;'/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/ltsmin7616980675781006734;'/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 85 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 2106/2106 transitions.
Applied a total of 0 rules in 15 ms. Remains 181 /181 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2022-05-14 23:43:17] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 181 cols
[2022-05-14 23:43:17] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 23:43:17] [INFO ] Implicit Places using invariants in 207 ms returned []
[2022-05-14 23:43:17] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 181 cols
[2022-05-14 23:43:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 23:43:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 23:43:18] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2022-05-14 23:43:18] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 181 cols
[2022-05-14 23:43:18] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 23:43:18] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/181 places, 2106/2106 transitions.
Built C files in :
/tmp/ltsmin3317862894626727825
[2022-05-14 23:43:18] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3317862894626727825
Running compilation step : cd /tmp/ltsmin3317862894626727825;'/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/ltsmin3317862894626727825;'/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/ltsmin3317862894626727825;'/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-14 23:43:22] [INFO ] Flatten gal took : 93 ms
[2022-05-14 23:43:22] [INFO ] Flatten gal took : 72 ms
[2022-05-14 23:43:22] [INFO ] Time to serialize gal into /tmp/LTL3797706225829758660.gal : 14 ms
[2022-05-14 23:43:22] [INFO ] Time to serialize properties into /tmp/LTL4861489637092761040.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/LTL3797706225829758660.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4861489637092761040.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/LTL3797706...266
Read 1 LTL properties
Checking formula 0 : !(((F(F((((((((X("(((((((((NB_ATTENTE_B_62<1)||(ROUTE_B_0<1))&&((NB_ATTENTE_B_23<1)||(ROUTE_B_0<1)))&&(((NB_ATTENTE_B_52<1)||(ROUTE_B_...9988
Formula 0 simplified : !(F("(((((((NB_ATTENTE_B_10<1)||(ROUTE_B_0<1))&&((NB_ATTENTE_B_70<1)||(ROUTE_B_0<1)))&&(((NB_ATTENTE_B_55<1)||(ROUTE_B_0<1))&&((NB_A...9957
Detected timeout of ITS tools.
[2022-05-14 23:43:37] [INFO ] Flatten gal took : 61 ms
[2022-05-14 23:43:37] [INFO ] Applying decomposition
[2022-05-14 23:43:37] [INFO ] Flatten gal took : 58 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/graph2599343871702896437.txt' '-o' '/tmp/graph2599343871702896437.bin' '-w' '/tmp/graph2599343871702896437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2599343871702896437.bin' '-l' '-1' '-v' '-w' '/tmp/graph2599343871702896437.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:43:37] [INFO ] Decomposing Gal with order
[2022-05-14 23:43:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:43:37] [INFO ] Removed a total of 4478 redundant transitions.
[2022-05-14 23:43:37] [INFO ] Flatten gal took : 344 ms
[2022-05-14 23:43:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 484 labels/synchronizations in 20 ms.
[2022-05-14 23:43:38] [INFO ] Time to serialize gal into /tmp/LTL7260145822557071799.gal : 2 ms
[2022-05-14 23:43:38] [INFO ] Time to serialize properties into /tmp/LTL6683284461058981456.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/LTL7260145822557071799.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6683284461058981456.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/LTL7260145...245
Read 1 LTL properties
Checking formula 0 : !(((F(F((((((((X("(((((((((i1.u16.NB_ATTENTE_B_62<1)||(i1.u16.ROUTE_B_0<1))&&((i1.u16.NB_ATTENTE_B_23<1)||(i1.u16.ROUTE_B_0<1)))&&(((i...13351
Formula 0 simplified : !(F("(((((((i1.u5.NB_ATTENTE_B_10<1)||(i1.u16.ROUTE_B_0<1))&&((i1.u16.NB_ATTENTE_B_70<1)||(i1.u16.ROUTE_B_0<1)))&&(((i1.u16.NB_ATTEN...13320
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8302001863632649295
[2022-05-14 23:43:53] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8302001863632649295
Running compilation step : cd /tmp/ltsmin8302001863632649295;'/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/ltsmin8302001863632649295;'/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/ltsmin8302001863632649295;'/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-V80P50N10-LTLFireability-13 finished in 63442 ms.
[2022-05-14 23:43:56] [INFO ] Flatten gal took : 99 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1236414762605103833
[2022-05-14 23:43:56] [INFO ] Too many transitions (2108) to apply POR reductions. Disabling POR matrices.
[2022-05-14 23:43:56] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1236414762605103833
Running compilation step : cd /tmp/ltsmin1236414762605103833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '120' '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-14 23:43:56] [INFO ] Applying decomposition
[2022-05-14 23:43:56] [INFO ] Flatten gal took : 100 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/graph14019999252638832795.txt' '-o' '/tmp/graph14019999252638832795.bin' '-w' '/tmp/graph14019999252638832795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14019999252638832795.bin' '-l' '-1' '-v' '-w' '/tmp/graph14019999252638832795.weights' '-q' '0' '-e' '0.001'
[2022-05-14 23:43:56] [INFO ] Decomposing Gal with order
[2022-05-14 23:43:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 23:43:57] [INFO ] Removed a total of 4644 redundant transitions.
[2022-05-14 23:43:57] [INFO ] Flatten gal took : 585 ms
[2022-05-14 23:43:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 635 labels/synchronizations in 24 ms.
[2022-05-14 23:43:57] [INFO ] Time to serialize gal into /tmp/LTLFireability6543277250814248741.gal : 2 ms
[2022-05-14 23:43:57] [INFO ] Time to serialize properties into /tmp/LTLFireability8680700521147217372.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/LTLFireability6543277250814248741.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8680700521147217372.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...267
Read 6 LTL properties
Checking formula 0 : !((G(F("(((u3.CAPACITE_0>=50)&&(i0.u0.VIDANGE_1>=1))||((u3.CAPACITE_0>=50)&&(i1.u2.VIDANGE_0>=1)))"))))
Formula 0 simplified : !GF"(((u3.CAPACITE_0>=50)&&(i0.u0.VIDANGE_1>=1))||((u3.CAPACITE_0>=50)&&(i1.u2.VIDANGE_0>=1)))"
Compilation finished in 5504 ms.
Running link step : cd /tmp/ltsmin1236414762605103833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin1236414762605103833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1236414762605103833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1236414762605103833;'/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(())&&(LTLAPp2==true))) U []((LTLAPp3==true))))' '--buchi-type=spotba'
LTSmin run took 2166 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin1236414762605103833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(<>(!((LTLAPp4==true) U (LTLAPp4==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1236414762605103833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(<>(!((LTLAPp4==true) U (LTLAPp4==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1236414762605103833;'/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((X(([]((LTLAPp6==true))||(LTLAPp7==true)))&&(LTLAPp5==true))))&&!(LTLAPp7==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 00:07:13] [INFO ] Applying decomposition
[2022-05-15 00:07:14] [INFO ] Flatten gal took : 304 ms
[2022-05-15 00:07:14] [INFO ] Decomposing Gal with order
[2022-05-15 00:07:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 00:07:14] [INFO ] Removed a total of 11550 redundant transitions.
[2022-05-15 00:07:15] [INFO ] Flatten gal took : 587 ms
[2022-05-15 00:07:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 69 ms.
[2022-05-15 00:07:15] [INFO ] Time to serialize gal into /tmp/LTLFireability12057332000876282663.gal : 62 ms
[2022-05-15 00:07:15] [INFO ] Time to serialize properties into /tmp/LTLFireability14961592293514635166.ltl : 28 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/LTLFireability12057332000876282663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14961592293514635166.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 5 LTL properties
Checking formula 0 : !((G(F("(((CAPACITE.CAPACITE_0>=50)&&(sens1.VIDANGE_1>=1))||((CAPACITE.CAPACITE_0>=50)&&(sens0.VIDANGE_0>=1)))"))))
Formula 0 simplified : !GF"(((CAPACITE.CAPACITE_0>=50)&&(sens1.VIDANGE_1>=1))||((CAPACITE.CAPACITE_0>=50)&&(sens0.VIDANGE_0>=1)))"
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1236414762605103833;'/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((X(([]((LTLAPp6==true))||(LTLAPp7==true)))&&(LTLAPp5==true))))&&!(LTLAPp7==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1236414762605103833;'/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(<>(!((LTLAPp8==true) U ()) U !(LTLAPp7==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1236414762605103833;'/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(<>(!((LTLAPp8==true) U ()) U !(LTLAPp7==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1236414762605103833;'/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((LTLAPp7==true))&&(LTLAPp10==true))))&&<>(!(LTLAPp7==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 00:30:32] [INFO ] Flatten gal took : 251 ms
[2022-05-15 00:30:32] [INFO ] Input system was already deterministic with 2108 transitions.
[2022-05-15 00:30:32] [INFO ] Transformed 186 places.
[2022-05-15 00:30:32] [INFO ] Transformed 2108 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 00:30:32] [INFO ] Time to serialize gal into /tmp/LTLFireability1237709732356020518.gal : 7 ms
[2022-05-15 00:30:32] [INFO ] Time to serialize properties into /tmp/LTLFireability3362006963071478717.ltl : 72 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/LTLFireability1237709732356020518.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3362006963071478717.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...333
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(((CAPACITE_0>=50)&&(VIDANGE_1>=1))||((CAPACITE_0>=50)&&(VIDANGE_0>=1)))"))))
Formula 0 simplified : !GF"(((CAPACITE_0>=50)&&(VIDANGE_1>=1))||((CAPACITE_0>=50)&&(VIDANGE_0>=1)))"
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1236414762605103833;'/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((LTLAPp7==true))&&(LTLAPp10==true))))&&<>(!(LTLAPp7==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin1236414762605103833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
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-V80P50N10"
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-V80P50N10, 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-165251918100140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N10.tgz
mv BridgeAndVehicles-COL-V80P50N10 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 ;