About the Execution of ITS-Tools for BridgeAndVehicles-PT-V50P20N50
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 2880326.00 | 0.00 | 0.00 | T?FFFFF?F?TFTT?F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918300244.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-PT-V50P20N50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918300244
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.3M
-rw-r--r-- 1 mcc users 18K Apr 29 23:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 29 23:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 747K Apr 29 23:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 29 23:08 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 13K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 246K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 775K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.2K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 4.5M 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-PT-V50P20N50-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652597364869
Running Version 202205111006
[2022-05-15 06:49:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 06:49:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 06:49:26] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2022-05-15 06:49:26] [INFO ] Transformed 168 places.
[2022-05-15 06:49:26] [INFO ] Transformed 5408 transitions.
[2022-05-15 06:49:26] [INFO ] Parsed PT model containing 168 places and 5408 transitions in 456 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 47 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 166 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 5408
Applied a total of 2 rules in 74 ms. Remains 166 /168 variables (removed 2) and now considering 5408/5408 (removed 0) transitions.
[2022-05-15 06:49:27] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:49:27] [INFO ] Computed 5 place invariants in 19 ms
[2022-05-15 06:49:28] [INFO ] Dead Transitions using invariants and state equation in 1751 ms found 0 transitions.
[2022-05-15 06:49:28] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:49:28] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 06:49:28] [INFO ] Implicit Places using invariants in 56 ms returned []
[2022-05-15 06:49:28] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:49:28] [INFO ] Computed 5 place invariants in 11 ms
[2022-05-15 06:49:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:49:29] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2022-05-15 06:49:29] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:49:29] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:49:30] [INFO ] Dead Transitions using invariants and state equation in 1467 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/168 places, 5408/5408 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/168 places, 5408/5408 transitions.
Support contains 166 out of 166 places after structural reductions.
[2022-05-15 06:49:31] [INFO ] Flatten gal took : 447 ms
[2022-05-15 06:49:32] [INFO ] Flatten gal took : 363 ms
[2022-05-15 06:49:33] [INFO ] Input system was already deterministic with 5408 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 1830 ms. (steps per millisecond=5 ) properties (out of 29) seen :22
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 2283 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 2098 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-05-15 06:49:42] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:49:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:49:47] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 06:50:01] [INFO ] After 14396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 06:50:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 06:50:26] [INFO ] After 24715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 06:50:26] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:50:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 06:50:26] [INFO ] After 25069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 108 out of 166 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 163 transition count 5406
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 161 transition count 5404
Applied a total of 9 rules in 1258 ms. Remains 161 /166 variables (removed 5) and now considering 5404/5408 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 161/166 places, 5404/5408 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 1274 ms. (steps per millisecond=7 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-15 06:50:30] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 161 cols
[2022-05-15 06:50:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 06:50:30] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 06:50:31] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 06:50:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 06:50:31] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 06:50:31] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:50:32] [INFO ] After 673ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 06:50:33] [INFO ] After 1685ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 565 ms.
[2022-05-15 06:50:33] [INFO ] After 2767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 74 ms.
Support contains 12 out of 161 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 5404/5404 transitions.
Applied a total of 0 rules in 866 ms. Remains 161 /161 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 5404/5404 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 81008 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 81008 steps, saw 28106 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-15 06:50:38] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 161 cols
[2022-05-15 06:50:38] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 06:50:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 06:50:39] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 06:50:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 06:50:39] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 06:50:39] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:50:40] [INFO ] After 658ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 06:50:41] [INFO ] After 1620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 525 ms.
[2022-05-15 06:50:42] [INFO ] After 2640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 55 ms.
Support contains 12 out of 161 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 5404/5404 transitions.
Applied a total of 0 rules in 1112 ms. Remains 161 /161 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 5404/5404 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 5404/5404 transitions.
Applied a total of 0 rules in 966 ms. Remains 161 /161 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
[2022-05-15 06:50:44] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 161 cols
[2022-05-15 06:50:44] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-15 06:50:44] [INFO ] Implicit Places using invariants in 450 ms returned []
[2022-05-15 06:50:44] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 161 cols
[2022-05-15 06:50:44] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-15 06:50:45] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:50:47] [INFO ] Implicit Places using invariants and state equation in 2701 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3167 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 159/161 places, 5404/5404 transitions.
Applied a total of 0 rules in 912 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 159/161 places, 5404/5404 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 84219 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84219 steps, saw 29232 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-15 06:50:52] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 06:50:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 06:50:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 06:50:52] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 06:50:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 06:50:53] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 06:50:53] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:50:53] [INFO ] After 555ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 06:50:56] [INFO ] After 2733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1993 ms.
[2022-05-15 06:50:58] [INFO ] After 5242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 44 ms.
Support contains 12 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 848 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 5404/5404 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 867 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
[2022-05-15 06:50:59] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 06:50:59] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-15 06:51:00] [INFO ] Implicit Places using invariants in 418 ms returned []
[2022-05-15 06:51:00] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 06:51:00] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 06:51:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:51:01] [INFO ] Implicit Places using invariants and state equation in 1483 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
[2022-05-15 06:51:02] [INFO ] Redundant transitions in 469 ms returned []
[2022-05-15 06:51:02] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 06:51:02] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 06:51:03] [INFO ] Dead Transitions using invariants and state equation in 1394 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 5404/5404 transitions.
Ensure Unique test removed 4998 transitions
Reduce isomorphic transitions removed 4998 transitions.
Iterating post reduction 0 with 4998 rules applied. Total rules applied 4998 place count 159 transition count 406
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5000 place count 159 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5002 place count 157 transition count 404
Applied a total of 5002 rules in 18 ms. Remains 157 /159 variables (removed 2) and now considering 404/5404 (removed 5000) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 404 rows 157 cols
[2022-05-15 06:51:03] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 06:51:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 06:51:03] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 06:51:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 06:51:04] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 06:51:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 06:51:04] [INFO ] After 103ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 06:51:04] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-05-15 06:51:04] [INFO ] After 605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-15 06:51:04] [INFO ] Flatten gal took : 14 ms
[2022-05-15 06:51:04] [INFO ] Flatten gal took : 13 ms
[2022-05-15 06:51:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4169843994782777804.gal : 5 ms
[2022-05-15 06:51:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15139209768598640726.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5964495077103330410;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4169843994782777804.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15139209768598640726.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality15139209768598640726.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :20 after 42
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :42 after 82
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :82 after 157
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :157 after 202
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :202 after 2020
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2020 after 21210
Reachability property AtomicPropp26 is true.
Reachability property AtomicPropp25 is true.
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :21210 after 524796
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :524796 after 768408
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :768408 after 1.55439e+06
Reachability property AtomicPropp14 is true.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.55439e+06 after 5.44127e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.44127e+06 after 1.16952e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.16952e+07 after 2.73589e+07
Reachability property AtomicPropp27 is true.
Reachability property AtomicPropp24 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9.84992e+07,3.72082,125836,2,43305,24,295260,6,0,1039,174975,0
Total reachable state count : 98499240
Verifying 5 reachability properties.
Reachability property AtomicPropp14 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp14,1,3.76128,125836,2,158,24,295260,7,0,1047,174975,0
Reachability property AtomicPropp24 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp24,1,3.79682,125836,2,158,24,295260,8,0,1052,174975,0
Reachability property AtomicPropp25 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp25,1,3.86293,125836,2,158,24,295260,9,0,1059,174975,0
Reachability property AtomicPropp26 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp26,1,3.86335,125836,2,158,24,295260,9,0,1059,174975,0
Reachability property AtomicPropp27 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp27,1,3.97733,125836,2,158,24,295260,10,0,1064,174975,0
Computed a total of 109 stabilizing places and 204 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U (p1 U p1)))||F(p2)))'
Support contains 56 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 22 ms. Remains 166 /166 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2022-05-15 06:51:09] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:51:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:51:10] [INFO ] Dead Transitions using invariants and state equation in 1615 ms found 0 transitions.
[2022-05-15 06:51:10] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:51:10] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:51:11] [INFO ] Implicit Places using invariants in 506 ms returned []
[2022-05-15 06:51:11] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:51:11] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:51:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:51:13] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2468 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 21 ms. Remains 164 /164 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 164/166 places, 5408/5408 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (OR (LT s108 1) (LT s126 1)) (OR (LT s107 1) (LT s116 1)) (OR (LT s108 1) (LT s130 1)) (OR (LT s108 1) (LT s134 1)) (OR (LT s107 1) (LT s124 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2535 ms.
Product exploration explored 100000 steps with 50000 reset in 2469 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/164 stabilizing places and 204/5408 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p1)))
Knowledge based reduction with 6 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-00 finished in 9689 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0) U X(G(p1))))||F(p2))))'
Support contains 110 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 49 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2022-05-15 06:51:18] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:18] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:51:20] [INFO ] Dead Transitions using invariants and state equation in 1591 ms found 0 transitions.
[2022-05-15 06:51:20] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:20] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:51:20] [INFO ] Implicit Places using invariants in 282 ms returned []
[2022-05-15 06:51:20] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:20] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 06:51:21] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2022-05-15 06:51:21] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:21] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 06:51:22] [INFO ] Dead Transitions using invariants and state equation in 1419 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 165/166 places, 5407/5408 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s54 1) (GEQ s56 1) (GEQ s65 1) (GEQ s108 1)) (AND (GEQ s54 1) (GEQ s56 1) (GEQ s104 1) (GEQ s108 1)) (AND (GEQ s54 1) (GEQ s56 1) (GEQ s8...], 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 20950 reset in 2588 ms.
Product exploration explored 100000 steps with 21109 reset in 2633 ms.
Computed a total of 108 stabilizing places and 203 stable transitions
Computed a total of 108 stabilizing places and 203 stable transitions
Detected a total of 108/165 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 366 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 162 steps, including 0 resets, run visited all 4 properties in 9 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (NOT (AND (NOT p2) p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 8 factoid took 378 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 110 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 5407/5407 transitions.
Applied a total of 0 rules in 24 ms. Remains 165 /165 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2022-05-15 06:51:29] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:29] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 06:51:30] [INFO ] Dead Transitions using invariants and state equation in 1390 ms found 0 transitions.
[2022-05-15 06:51:30] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:51:30] [INFO ] Implicit Places using invariants in 286 ms returned []
[2022-05-15 06:51:30] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:30] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 06:51:31] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2022-05-15 06:51:31] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:31] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 06:51:32] [INFO ] Dead Transitions using invariants and state equation in 1528 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/165 places, 5407/5407 transitions.
Computed a total of 108 stabilizing places and 203 stable transitions
Computed a total of 108 stabilizing places and 203 stable transitions
Detected a total of 108/165 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 401 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 193 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (NOT (AND (NOT p2) p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 8 factoid took 458 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 21001 reset in 2736 ms.
Product exploration explored 100000 steps with 20917 reset in 2795 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 110 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 5407/5407 transitions.
Applied a total of 0 rules in 1602 ms. Remains 165 /165 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2022-05-15 06:51:41] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:41] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 06:51:43] [INFO ] Dead Transitions using invariants and state equation in 1484 ms found 0 transitions.
[2022-05-15 06:51:43] [INFO ] Redundant transitions in 334 ms returned []
[2022-05-15 06:51:43] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:43] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 06:51:45] [INFO ] Dead Transitions using invariants and state equation in 1497 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/165 places, 5407/5407 transitions.
Product exploration explored 100000 steps with 21008 reset in 4637 ms.
Product exploration explored 100000 steps with 20971 reset in 4512 ms.
Built C files in :
/tmp/ltsmin7960160766539454610
[2022-05-15 06:51:54] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7960160766539454610
Running compilation step : cd /tmp/ltsmin7960160766539454610;'/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/ltsmin7960160766539454610;'/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/ltsmin7960160766539454610;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 110 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 5407/5407 transitions.
Applied a total of 0 rules in 35 ms. Remains 165 /165 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2022-05-15 06:51:57] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:57] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:51:58] [INFO ] Dead Transitions using invariants and state equation in 1383 ms found 0 transitions.
[2022-05-15 06:51:59] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:59] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:51:59] [INFO ] Implicit Places using invariants in 297 ms returned []
[2022-05-15 06:51:59] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:59] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:51:59] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2022-05-15 06:51:59] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:51:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:52:01] [INFO ] Dead Transitions using invariants and state equation in 1368 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/165 places, 5407/5407 transitions.
Built C files in :
/tmp/ltsmin3109203502044312587
[2022-05-15 06:52:01] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3109203502044312587
Running compilation step : cd /tmp/ltsmin3109203502044312587;'/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/ltsmin3109203502044312587;'/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/ltsmin3109203502044312587;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 06:52:04] [INFO ] Flatten gal took : 179 ms
[2022-05-15 06:52:05] [INFO ] Flatten gal took : 185 ms
[2022-05-15 06:52:05] [INFO ] Time to serialize gal into /tmp/LTL9761837592426053959.gal : 48 ms
[2022-05-15 06:52:05] [INFO ] Time to serialize properties into /tmp/LTL14008575068966763992.ltl : 557 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/LTL9761837592426053959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14008575068966763992.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/LTL9761837...267
Read 1 LTL properties
Checking formula 0 : !((X((G((F("((((((((CHOIX_1>=1)&&(COMPTEUR_50>=1))||((CHOIX_2>=1)&&(COMPTEUR_50>=1)))||((((NB_ATTENTE_A_6>=1)&&(ATTENTE_A>=1))&&((CAPA...10133
Formula 0 simplified : !X(G(F"((((((((CHOIX_1>=1)&&(COMPTEUR_50>=1))||((CHOIX_2>=1)&&(COMPTEUR_50>=1)))||((((NB_ATTENTE_A_6>=1)&&(ATTENTE_A>=1))&&((CAPACIT...10118
Detected timeout of ITS tools.
[2022-05-15 06:52:20] [INFO ] Flatten gal took : 166 ms
[2022-05-15 06:52:20] [INFO ] Applying decomposition
[2022-05-15 06:52:21] [INFO ] Flatten gal took : 168 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/graph8972698156455935300.txt' '-o' '/tmp/graph8972698156455935300.bin' '-w' '/tmp/graph8972698156455935300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8972698156455935300.bin' '-l' '-1' '-v' '-w' '/tmp/graph8972698156455935300.weights' '-q' '0' '-e' '0.001'
[2022-05-15 06:52:21] [INFO ] Decomposing Gal with order
[2022-05-15 06:52:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 06:52:24] [INFO ] Removed a total of 10691 redundant transitions.
[2022-05-15 06:52:24] [INFO ] Flatten gal took : 2409 ms
[2022-05-15 06:52:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 693 labels/synchronizations in 85 ms.
[2022-05-15 06:52:24] [INFO ] Time to serialize gal into /tmp/LTL7984119615465013915.gal : 2 ms
[2022-05-15 06:52:24] [INFO ] Time to serialize properties into /tmp/LTL12662983035242797624.ltl : 3 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/LTL7984119615465013915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12662983035242797624.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/LTL7984119...246
Read 1 LTL properties
Checking formula 0 : !((X((G((F("((((((((i0.u1.CHOIX_1>=1)&&(i2.u5.COMPTEUR_50>=1))||((i0.u1.CHOIX_2>=1)&&(i2.u5.COMPTEUR_50>=1)))||((((i2.u2.NB_ATTENTE_A_...13169
Formula 0 simplified : !X(G(F"((((((((i0.u1.CHOIX_1>=1)&&(i2.u5.COMPTEUR_50>=1))||((i0.u1.CHOIX_2>=1)&&(i2.u5.COMPTEUR_50>=1)))||((((i2.u2.NB_ATTENTE_A_6>=...13154
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14199927062169647065
[2022-05-15 06:52:39] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14199927062169647065
Running compilation step : cd /tmp/ltsmin14199927062169647065;'/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/ltsmin14199927062169647065;'/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/ltsmin14199927062169647065;'/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-PT-V50P20N50-LTLFireability-01 finished in 84209 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((((X(!G((!p1 U p2)))||p0) U G(p3)) U p4)))'
Support contains 158 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 1278 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2022-05-15 06:52:44] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:52:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:52:45] [INFO ] Dead Transitions using invariants and state equation in 1617 ms found 0 transitions.
[2022-05-15 06:52:45] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:52:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:52:45] [INFO ] Implicit Places using invariants in 62 ms returned []
[2022-05-15 06:52:45] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:52:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:52:46] [INFO ] Implicit Places using invariants and state equation in 233 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 307 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 1232 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 164/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p4), p2, (NOT p3), (NOT p4), (AND p0 p2 (NOT p3))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p4) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p4), acceptance={} source=0 dest: 2}, { cond=(NOT p4), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p4) p3 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p4), acceptance={} source=3 dest: 2}, { cond=(NOT p4), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p4) p3 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p3) p0 (NOT p1)) (AND (NOT p3) p0 p2)), acceptance={} source=4 dest: 1}, { cond=(OR (AND p3 p0 (NOT p1)) (AND p3 p0 p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p4:(OR (AND (GEQ s99 1) (GEQ s112 1)) (AND (GEQ s60 1) (GEQ s112 1)) (AND (GEQ s70 1) (GEQ s112 1)) (AND (GEQ s89 1) (GEQ s112 1)) (AND (GEQ s80 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration timeout after 54480 steps with 162 reset in 10001 ms.
Product exploration timeout after 53070 steps with 153 reset in 10003 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/164 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND p4 (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X p4), (X (AND (NOT p3) (NOT p0))), (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND (NOT p3) p0 p2)))), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p4) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p4) p3 (NOT p0)))), (X (NOT (OR (AND p3 p0 (NOT p1)) (AND p3 p0 p2)))), (X (X p4)), (X (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND (NOT p3) p0 p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p3 p0 (NOT p1)) (AND p3 p0 p2))))), (X (X (NOT (AND (NOT p4) p3 (NOT p0))))), (F (OR (G p4) (G (NOT p4))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 17 factoid took 2664 ms. Reduced automaton from 5 states, 17 edges and 5 AP to 5 states, 17 edges and 5 AP.
Stuttering acceptance computed with spot in 247 ms :[(NOT p4), p2, (NOT p3), (NOT p4), (AND p0 p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 2848 ms. (steps per millisecond=3 ) properties (out of 10) seen :8
Interrupted Best-First random walk after 4190 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4241 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 2 properties.
[2022-05-15 06:53:23] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 06:53:23] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:55:11] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 06:55:11] [INFO ] After 836ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 06:55:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 06:55:12] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p4 (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X p4), (X (AND (NOT p3) (NOT p0))), (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND (NOT p3) p0 p2)))), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p4) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p4) p3 (NOT p0)))), (X (NOT (OR (AND p3 p0 (NOT p1)) (AND p3 p0 p2)))), (X (X p4)), (X (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND (NOT p3) p0 p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p3 p0 (NOT p1)) (AND p3 p0 p2))))), (X (X (NOT (AND (NOT p4) p3 (NOT p0))))), (F (OR (G p4) (G (NOT p4)))), (G (NOT (OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) p2)))), (G (NOT (OR (AND p0 p3 (NOT p1)) (AND p0 p3 p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F p3), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND (NOT p0) (NOT p4) (NOT p3))), (F (AND (NOT p0) (NOT p4) p3)), (F (NOT p4)), (F (AND (NOT p0) p3))]
Knowledge based reduction with 19 factoid took 1400 ms. Reduced automaton from 5 states, 17 edges and 5 AP to 4 states, 12 edges and 5 AP.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (AND (NOT p0) p2), (NOT p3), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4)))]
Stuttering acceptance computed with spot in 198 ms :[(OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (AND (NOT p0) p2), (NOT p3), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4)))]
Support contains 158 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 5407/5407 transitions.
Applied a total of 0 rules in 1115 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2022-05-15 06:55:15] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 06:55:15] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 06:55:16] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
[2022-05-15 06:55:16] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 06:55:16] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:55:16] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-15 06:55:16] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 06:55:16] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:55:16] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:55:17] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2022-05-15 06:55:17] [INFO ] Redundant transitions in 423 ms returned []
[2022-05-15 06:55:17] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 06:55:17] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:55:19] [INFO ] Dead Transitions using invariants and state equation in 1531 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 5407/5407 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/164 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3) p4), (X (NOT p3)), (X (NOT (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4)))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4)))))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4))))), (F (OR (G p4) (G (NOT p4))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 12 factoid took 822 ms. Reduced automaton from 4 states, 12 edges and 5 AP to 4 states, 12 edges and 5 AP.
Stuttering acceptance computed with spot in 209 ms :[(OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (AND (NOT p0) p2), (NOT p3), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4)))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 1509 ms. (steps per millisecond=6 ) properties (out of 7) seen :6
Interrupted Best-First random walk after 7135 steps, including 5 resets, run timeout after 5003 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 1 properties.
[2022-05-15 06:55:27] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 06:55:27] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 06:55:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 06:55:34] [INFO ] After 293ms 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 p1) (NOT p2) (NOT p0) (NOT p3) p4), (X (NOT p3)), (X (NOT (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4)))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4)))))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4))))), (F (OR (G p4) (G (NOT p4)))), (G (OR (NOT p0) (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p3), (F (NOT (AND (NOT p0) (NOT p3)))), (F (OR (AND (NOT p0) (NOT p4)) (AND (NOT p4) p1 (NOT p2)))), (F (AND (NOT p0) (NOT p4) (NOT p3)))]
Knowledge based reduction with 13 factoid took 896 ms. Reduced automaton from 4 states, 12 edges and 5 AP to 4 states, 12 edges and 5 AP.
Stuttering acceptance computed with spot in 180 ms :[(NOT p4), p2, (NOT p3), (NOT p4)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p4), p2, (NOT p3), (NOT p4)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p4), p2, (NOT p3), (NOT p4)]
Product exploration timeout after 43880 steps with 107 reset in 10001 ms.
Product exploration timeout after 43610 steps with 107 reset in 10001 ms.
Built C files in :
/tmp/ltsmin9641922983353787753
[2022-05-15 06:55:56] [INFO ] Too many transitions (5407) to apply POR reductions. Disabling POR matrices.
[2022-05-15 06:55:56] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9641922983353787753
Running compilation step : cd /tmp/ltsmin9641922983353787753;'/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/ltsmin9641922983353787753;'/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/ltsmin9641922983353787753;'/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 158 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 5407/5407 transitions.
Applied a total of 0 rules in 1198 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2022-05-15 06:56:00] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 06:56:00] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 06:56:02] [INFO ] Dead Transitions using invariants and state equation in 1534 ms found 0 transitions.
[2022-05-15 06:56:02] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 06:56:02] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:56:02] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-15 06:56:02] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 06:56:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:56:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:56:02] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2022-05-15 06:56:03] [INFO ] Redundant transitions in 445 ms returned []
[2022-05-15 06:56:03] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 06:56:03] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:56:04] [INFO ] Dead Transitions using invariants and state equation in 1478 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 5407/5407 transitions.
Built C files in :
/tmp/ltsmin5945806454500513367
[2022-05-15 06:56:04] [INFO ] Too many transitions (5407) to apply POR reductions. Disabling POR matrices.
[2022-05-15 06:56:04] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5945806454500513367
Running compilation step : cd /tmp/ltsmin5945806454500513367;'/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/ltsmin5945806454500513367;'/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/ltsmin5945806454500513367;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 06:56:08] [INFO ] Flatten gal took : 317 ms
[2022-05-15 06:56:08] [INFO ] Flatten gal took : 370 ms
[2022-05-15 06:56:08] [INFO ] Time to serialize gal into /tmp/LTL12667620953731352740.gal : 26 ms
[2022-05-15 06:56:08] [INFO ] Time to serialize properties into /tmp/LTL8341531142450983374.ltl : 56 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/LTL12667620953731352740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8341531142450983374.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/LTL1266762...267
Read 1 LTL properties
Checking formula 0 : !((G(((((((((((((((X(!(G((!("(((((((((((((((NB_ATTENTE_A_23>=1)&&(CONTROLEUR_2>=1))&&((NB_ATTENTE_B_0>=1)&&(COMPTEUR_33>=1)))||(((NB_A...676443
Formula 0 simplified : !G((("(((((((((((((NB_ATTENTE_A_5>=1)&&(CONTROLEUR_2>=1))&&((NB_ATTENTE_B_0>=1)&&(COMPTEUR_5>=1)))||(((NB_ATTENTE_A_16>=1)&&(CONTROL...676395
Detected timeout of ITS tools.
[2022-05-15 06:56:24] [INFO ] Flatten gal took : 314 ms
[2022-05-15 06:56:24] [INFO ] Applying decomposition
[2022-05-15 06:56:24] [INFO ] Flatten gal took : 310 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/graph7053472293712765453.txt' '-o' '/tmp/graph7053472293712765453.bin' '-w' '/tmp/graph7053472293712765453.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7053472293712765453.bin' '-l' '-1' '-v' '-w' '/tmp/graph7053472293712765453.weights' '-q' '0' '-e' '0.001'
[2022-05-15 06:56:25] [INFO ] Decomposing Gal with order
[2022-05-15 06:56:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 06:56:27] [INFO ] Removed a total of 10592 redundant transitions.
[2022-05-15 06:56:27] [INFO ] Flatten gal took : 2019 ms
[2022-05-15 06:56:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 545 labels/synchronizations in 73 ms.
[2022-05-15 06:56:27] [INFO ] Time to serialize gal into /tmp/LTL10544334800977328770.gal : 2 ms
[2022-05-15 06:56:27] [INFO ] Time to serialize properties into /tmp/LTL10637058386393822575.ltl : 42 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/LTL10544334800977328770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10637058386393822575.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/LTL1054433...247
Read 1 LTL properties
Checking formula 0 : !((G(((((((((((((((X(!(G((!("(((((((((((((((i0.u3.NB_ATTENTE_A_23>=1)&&(i0.u3.CONTROLEUR_2>=1))&&((i0.u3.NB_ATTENTE_B_0>=1)&&(i0.u1.CO...838452
Formula 0 simplified : !G((("(((((((((((((i0.u3.NB_ATTENTE_A_5>=1)&&(i0.u3.CONTROLEUR_2>=1))&&((i0.u3.NB_ATTENTE_B_0>=1)&&(i0.u1.COMPTEUR_5>=1)))||(((i0.u3...838404
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10381391602590966481
[2022-05-15 06:56:43] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10381391602590966481
Running compilation step : cd /tmp/ltsmin10381391602590966481;'/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/ltsmin10381391602590966481;'/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/ltsmin10381391602590966481;'/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-PT-V50P20N50-LTLFireability-02 finished in 243166 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(X(X(X(p1))))))))'
Support contains 55 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 51 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2022-05-15 06:56:46] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:56:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:56:47] [INFO ] Dead Transitions using invariants and state equation in 1395 ms found 0 transitions.
[2022-05-15 06:56:47] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:56:47] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 06:56:48] [INFO ] Implicit Places using invariants in 517 ms returned []
[2022-05-15 06:56:48] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:56:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:56:48] [INFO ] Implicit Places using invariants and state equation in 927 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1457 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 24 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 164/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (OR (LT s54 20) (LT s111 1)) (OR (LT s54 20) (LT s110 1))), p1:(OR (AND (GEQ s7 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)) (AND (GEQ s26 1) (GEQ s52 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-05 finished in 3221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 163 transition count 5406
Applied a total of 5 rules in 1056 ms. Remains 163 /166 variables (removed 3) and now considering 5406/5408 (removed 2) transitions.
[2022-05-15 06:56:50] [INFO ] Flow matrix only has 408 transitions (discarded 4998 similar events)
// Phase 1: matrix 408 rows 163 cols
[2022-05-15 06:56:50] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 06:56:51] [INFO ] Implicit Places using invariants in 669 ms returned []
[2022-05-15 06:56:51] [INFO ] Flow matrix only has 408 transitions (discarded 4998 similar events)
// Phase 1: matrix 408 rows 163 cols
[2022-05-15 06:56:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 06:56:51] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:56:53] [INFO ] Implicit Places using invariants and state equation in 2346 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3031 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/166 places, 5406/5408 transitions.
Applied a total of 0 rules in 984 ms. Remains 161 /161 variables (removed 0) and now considering 5406/5406 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 161/166 places, 5406/5408 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s105 1) (GEQ s160 1)) (AND (GEQ s106 1) (GEQ s160 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 79298 steps with 389 reset in 1165 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-06 finished in 6301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(F(p0) U (X(p1)||G(p2)))||F(p0))))'
Support contains 105 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 25 ms. Remains 166 /166 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2022-05-15 06:56:55] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:56:55] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 06:56:56] [INFO ] Dead Transitions using invariants and state equation in 1356 ms found 0 transitions.
[2022-05-15 06:56:56] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:56:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:56:57] [INFO ] Implicit Places using invariants in 365 ms returned []
[2022-05-15 06:56:57] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:56:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:56:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:56:59] [INFO ] Implicit Places using invariants and state equation in 2322 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2707 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 34 ms. Remains 165 /165 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 165/166 places, 5408/5408 transitions.
Stuttering acceptance computed with spot in 466 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s110 1), p2:(OR (AND (GEQ s99 1) (GEQ s113 1)) (AND (GEQ s60 1) (GEQ s113 1)) (AND (GEQ s70 1) (GEQ s113 1)) (AND (GEQ s89 1) (GEQ s113 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 666 reset in 1256 ms.
Product exploration explored 100000 steps with 639 reset in 1347 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/165 stabilizing places and 204/5408 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 (NOT p0)), (X (AND (NOT p0) p2)), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p0) p1))), (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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 422 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 264 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p0) p1))), (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 p0)]
Knowledge based reduction with 8 factoid took 358 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2022-05-15 06:57:03] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 06:57:03] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:57:05] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 06:57:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 06:57:05] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2022-05-15 06:57:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 06:57:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 06:57:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 06:57:07] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2022-05-15 06:57:07] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:57:08] [INFO ] [Nat]Added 102 Read/Feed constraints in 948 ms returned sat
[2022-05-15 06:57:08] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 257 transitions) in 273 ms.
[2022-05-15 06:57:09] [INFO ] Added : 78 causal constraints over 16 iterations in 984 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 165 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 5408/5408 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 164 transition count 5407
Applied a total of 2 rules in 1019 ms. Remains 164 /165 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2022-05-15 06:57:10] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 06:57:10] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:57:11] [INFO ] Dead Transitions using invariants and state equation in 1470 ms found 0 transitions.
[2022-05-15 06:57:11] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 06:57:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:57:11] [INFO ] Implicit Places using invariants in 370 ms returned []
[2022-05-15 06:57:11] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 06:57:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:57:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:57:13] [INFO ] Implicit Places using invariants and state equation in 1373 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1758 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/165 places, 5407/5408 transitions.
Applied a total of 0 rules in 984 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 163/165 places, 5407/5408 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/163 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 204 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=40 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2022-05-15 06:57:14] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:57:14] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:57:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 06:57:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 06:57:16] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2022-05-15 06:57:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 06:57:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 06:57:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 06:57:18] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2022-05-15 06:57:18] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:57:20] [INFO ] [Nat]Added 102 Read/Feed constraints in 2571 ms returned sat
[2022-05-15 06:57:21] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 256 transitions) in 267 ms.
[2022-05-15 06:57:21] [INFO ] Added : 46 causal constraints over 10 iterations in 805 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 710 reset in 1374 ms.
Product exploration explored 100000 steps with 687 reset in 1446 ms.
Built C files in :
/tmp/ltsmin18017499523426960925
[2022-05-15 06:57:24] [INFO ] Too many transitions (5407) to apply POR reductions. Disabling POR matrices.
[2022-05-15 06:57:24] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18017499523426960925
Running compilation step : cd /tmp/ltsmin18017499523426960925;'/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/ltsmin18017499523426960925;'/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/ltsmin18017499523426960925;'/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 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Applied a total of 0 rules in 887 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2022-05-15 06:57:28] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:57:28] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:57:29] [INFO ] Dead Transitions using invariants and state equation in 1400 ms found 0 transitions.
[2022-05-15 06:57:29] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:57:29] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:57:30] [INFO ] Implicit Places using invariants in 680 ms returned []
[2022-05-15 06:57:30] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:57:30] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:57:30] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:57:34] [INFO ] Implicit Places using invariants and state equation in 3538 ms returned []
Implicit Place search using SMT with State Equation took 4219 ms to find 0 implicit places.
[2022-05-15 06:57:34] [INFO ] Redundant transitions in 412 ms returned []
[2022-05-15 06:57:34] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:57:34] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 06:57:35] [INFO ] Dead Transitions using invariants and state equation in 1390 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 5407/5407 transitions.
Built C files in :
/tmp/ltsmin14805683170962494109
[2022-05-15 06:57:35] [INFO ] Too many transitions (5407) to apply POR reductions. Disabling POR matrices.
[2022-05-15 06:57:36] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14805683170962494109
Running compilation step : cd /tmp/ltsmin14805683170962494109;'/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/ltsmin14805683170962494109;'/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/ltsmin14805683170962494109;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 06:57:39] [INFO ] Flatten gal took : 274 ms
[2022-05-15 06:57:39] [INFO ] Flatten gal took : 163 ms
[2022-05-15 06:57:39] [INFO ] Time to serialize gal into /tmp/LTL10347515092745675361.gal : 19 ms
[2022-05-15 06:57:39] [INFO ] Time to serialize properties into /tmp/LTL12306671417249424966.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/LTL10347515092745675361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12306671417249424966.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/LTL1034751...268
Read 1 LTL properties
Checking formula 0 : !((X((!((F("(SUR_PONT_B>=1)"))U((X("((((((((ROUTE_A>=1)&&(NB_ATTENTE_A_20>=1))||((ROUTE_A>=1)&&(NB_ATTENTE_A_22>=1)))||(((ROUTE_A>=1)&...4151
Formula 0 simplified : !X(F"(SUR_PONT_B>=1)" | !(F"(SUR_PONT_B>=1)" U (X"((((((((ROUTE_A>=1)&&(NB_ATTENTE_A_20>=1))||((ROUTE_A>=1)&&(NB_ATTENTE_A_22>=1)))|...4135
Detected timeout of ITS tools.
[2022-05-15 06:57:55] [INFO ] Flatten gal took : 348 ms
[2022-05-15 06:57:55] [INFO ] Applying decomposition
[2022-05-15 06:57:55] [INFO ] Flatten gal took : 173 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/graph3140220252938587687.txt' '-o' '/tmp/graph3140220252938587687.bin' '-w' '/tmp/graph3140220252938587687.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3140220252938587687.bin' '-l' '-1' '-v' '-w' '/tmp/graph3140220252938587687.weights' '-q' '0' '-e' '0.001'
[2022-05-15 06:57:55] [INFO ] Decomposing Gal with order
[2022-05-15 06:57:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 06:57:57] [INFO ] Removed a total of 10493 redundant transitions.
[2022-05-15 06:57:57] [INFO ] Flatten gal took : 1659 ms
[2022-05-15 06:57:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 447 labels/synchronizations in 58 ms.
[2022-05-15 06:57:57] [INFO ] Time to serialize gal into /tmp/LTL3470078424764412986.gal : 2 ms
[2022-05-15 06:57:57] [INFO ] Time to serialize properties into /tmp/LTL10985216995014441390.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/LTL3470078424764412986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10985216995014441390.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/LTL3470078...246
Read 1 LTL properties
Checking formula 0 : !((X((!((F("(u0.SUR_PONT_B>=1)"))U((X("((((((((u2.ROUTE_A>=1)&&(u2.NB_ATTENTE_A_20>=1))||((u2.ROUTE_A>=1)&&(u2.NB_ATTENTE_A_22>=1)))||...5075
Formula 0 simplified : !X(F"(u0.SUR_PONT_B>=1)" | !(F"(u0.SUR_PONT_B>=1)" U (X"((((((((u2.ROUTE_A>=1)&&(u2.NB_ATTENTE_A_20>=1))||((u2.ROUTE_A>=1)&&(u2.NB_A...5059
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16556611224137530702
[2022-05-15 06:58:12] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16556611224137530702
Running compilation step : cd /tmp/ltsmin16556611224137530702;'/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/ltsmin16556611224137530702;'/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/ltsmin16556611224137530702;'/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-PT-V50P20N50-LTLFireability-07 finished in 80068 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(X(G(!p0))))) U (!p0 U X(p1))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 23 ms. Remains 166 /166 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2022-05-15 06:58:15] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:58:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:58:17] [INFO ] Dead Transitions using invariants and state equation in 1375 ms found 0 transitions.
[2022-05-15 06:58:17] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:58:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:58:17] [INFO ] Implicit Places using invariants in 686 ms returned []
[2022-05-15 06:58:17] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 06:58:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:58:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:58:21] [INFO ] Implicit Places using invariants and state equation in 3497 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4196 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 23 ms. Remains 164 /164 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 164/166 places, 5408/5408 transitions.
Stuttering acceptance computed with spot in 404 ms :[p0, true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 0}, { cond=p0, acceptance={0} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 8}]], initial=2, aps=[p0:(AND (GEQ s108 1) (GEQ s130 1)), p1:(GEQ s52 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][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 138 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-08 finished in 6071 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(G((F((G(p0)&&p0))||p1))))||p2)))'
Support contains 8 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 1253 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2022-05-15 06:58:22] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:58:22] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:58:24] [INFO ] Dead Transitions using invariants and state equation in 1354 ms found 0 transitions.
[2022-05-15 06:58:24] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:58:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:58:24] [INFO ] Implicit Places using invariants in 562 ms returned []
[2022-05-15 06:58:24] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 06:58:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:58:25] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1650 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 1304 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 163/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s54 1) (LT s60 1) (LT s129 1)), p2:(AND (GEQ s53 20) (GEQ s109 1)), p1:(AND (GEQ s0 1) (GEQ s6 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 286 reset in 1461 ms.
Product exploration explored 100000 steps with 285 reset in 1449 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/163 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 384 ms. Reduced automaton from 1 states, 4 edges and 3 AP to 1 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 06:58:31] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:58:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:58:31] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 06:58:31] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 06:58:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 06:58:32] [INFO ] After 1268ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-15 06:58:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:58:32] [INFO ] After 239ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-15 06:58:33] [INFO ] After 495ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 202 ms.
[2022-05-15 06:58:33] [INFO ] After 2032ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 585 ms.
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Applied a total of 0 rules in 1005 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2022-05-15 06:58:34] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:58:34] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:58:36] [INFO ] Dead Transitions using invariants and state equation in 1518 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 5407/5407 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 130735 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130735 steps, saw 35190 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 06:58:39] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:58:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:58:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 06:58:39] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 06:58:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 06:58:40] [INFO ] After 828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 06:58:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:58:41] [INFO ] After 259ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 06:58:41] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 202 ms.
[2022-05-15 06:58:41] [INFO ] After 1610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 624 ms.
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Applied a total of 0 rules in 910 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 5407/5407 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Applied a total of 0 rules in 928 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2022-05-15 06:58:43] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:58:43] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:58:44] [INFO ] Implicit Places using invariants in 572 ms returned []
[2022-05-15 06:58:44] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:58:44] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 06:58:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:58:46] [INFO ] Implicit Places using invariants and state equation in 1882 ms returned []
Implicit Place search using SMT with State Equation took 2456 ms to find 0 implicit places.
[2022-05-15 06:58:46] [INFO ] Redundant transitions in 428 ms returned []
[2022-05-15 06:58:46] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:58:46] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:58:48] [INFO ] Dead Transitions using invariants and state equation in 1516 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 5407/5407 transitions.
Ensure Unique test removed 4998 transitions
Reduce isomorphic transitions removed 4998 transitions.
Iterating post reduction 0 with 4998 rules applied. Total rules applied 4998 place count 163 transition count 409
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5000 place count 162 transition count 408
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5001 place count 162 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5002 place count 161 transition count 407
Applied a total of 5002 rules in 15 ms. Remains 161 /163 variables (removed 2) and now considering 407/5407 (removed 5000) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 407 rows 161 cols
[2022-05-15 06:58:48] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:58:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 06:58:48] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 06:58:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 06:58:58] [INFO ] After 9260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-15 06:58:58] [INFO ] Flatten gal took : 14 ms
[2022-05-15 06:58:58] [INFO ] Flatten gal took : 14 ms
[2022-05-15 06:58:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9401625686972012107.gal : 3 ms
[2022-05-15 06:58:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3531463007141825056.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5915375689073404786;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9401625686972012107.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3531463007141825056.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3531463007141825056.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :19 after 29
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :29 after 49
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :49 after 85
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :85 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 253
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :253 after 8855
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8855 after 141680
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :141680 after 1.56379e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.56379e+06 after 1.24446e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.24446e+07 after 2.7494e+07
Detected timeout of ITS tools.
[2022-05-15 06:59:13] [INFO ] Flatten gal took : 20 ms
[2022-05-15 06:59:13] [INFO ] Applying decomposition
[2022-05-15 06:59:13] [INFO ] Flatten gal took : 12 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/graph10126976885747094669.txt' '-o' '/tmp/graph10126976885747094669.bin' '-w' '/tmp/graph10126976885747094669.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10126976885747094669.bin' '-l' '-1' '-v' '-w' '/tmp/graph10126976885747094669.weights' '-q' '0' '-e' '0.001'
[2022-05-15 06:59:13] [INFO ] Decomposing Gal with order
[2022-05-15 06:59:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 06:59:13] [INFO ] Removed a total of 343 redundant transitions.
[2022-05-15 06:59:13] [INFO ] Flatten gal took : 36 ms
[2022-05-15 06:59:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 2 ms.
[2022-05-15 06:59:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8100331720358090783.gal : 1 ms
[2022-05-15 06:59:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14191586381608579764.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5915375689073404786;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8100331720358090783.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14191586381608579764.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality14191586381608579764.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 204
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :204 after 459
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :459 after 1377
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1377 after 2907
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2907 after 22103
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.50576e+09,4.22957,80520,163,2771,9319,108344,112,31795,587,890221,0
Total reachable state count : 8505755258
Verifying 1 reachability properties.
Reachability property apf3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,1,4.23421,80520,12,135,9319,108344,139,31795,616,890221,49
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 11 factoid took 1004 ms. Reduced automaton from 1 states, 4 edges and 3 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Support contains 6 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Applied a total of 0 rules in 1238 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2022-05-15 06:59:19] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:19] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:59:21] [INFO ] Dead Transitions using invariants and state equation in 1378 ms found 0 transitions.
[2022-05-15 06:59:21] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:59:21] [INFO ] Implicit Places using invariants in 537 ms returned []
[2022-05-15 06:59:21] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:21] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 06:59:21] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:59:25] [INFO ] Implicit Places using invariants and state equation in 3342 ms returned []
Implicit Place search using SMT with State Equation took 3881 ms to find 0 implicit places.
[2022-05-15 06:59:25] [INFO ] Redundant transitions in 417 ms returned []
[2022-05-15 06:59:25] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:25] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:59:26] [INFO ] Dead Transitions using invariants and state equation in 1382 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 5407/5407 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 06:59:27] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:27] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 06:59:27] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 06:59:27] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 06:59:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 06:59:28] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 06:59:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:59:28] [INFO ] After 153ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 06:59:28] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 187 ms.
[2022-05-15 06:59:28] [INFO ] After 965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Applied a total of 0 rules in 933 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2022-05-15 06:59:29] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:29] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 06:59:31] [INFO ] Dead Transitions using invariants and state equation in 1389 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 5407/5407 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 134193 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134193 steps, saw 36128 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 06:59:34] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:34] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 06:59:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 06:59:34] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 06:59:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 06:59:34] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 06:59:34] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:59:35] [INFO ] After 151ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 06:59:35] [INFO ] After 474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 186 ms.
[2022-05-15 06:59:35] [INFO ] After 959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Applied a total of 0 rules in 846 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 5407/5407 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Applied a total of 0 rules in 933 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2022-05-15 06:59:37] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:37] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 06:59:37] [INFO ] Implicit Places using invariants in 562 ms returned []
[2022-05-15 06:59:37] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:37] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 06:59:38] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:59:40] [INFO ] Implicit Places using invariants and state equation in 2849 ms returned []
Implicit Place search using SMT with State Equation took 3412 ms to find 0 implicit places.
[2022-05-15 06:59:41] [INFO ] Redundant transitions in 437 ms returned []
[2022-05-15 06:59:41] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:41] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 06:59:42] [INFO ] Dead Transitions using invariants and state equation in 1401 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 5407/5407 transitions.
Ensure Unique test removed 4998 transitions
Reduce isomorphic transitions removed 4998 transitions.
Iterating post reduction 0 with 4998 rules applied. Total rules applied 4998 place count 163 transition count 409
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5000 place count 162 transition count 408
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5002 place count 162 transition count 406
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5004 place count 160 transition count 406
Applied a total of 5004 rules in 17 ms. Remains 160 /163 variables (removed 3) and now considering 406/5407 (removed 5001) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 406 rows 160 cols
[2022-05-15 06:59:42] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 06:59:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 06:59:42] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 06:59:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 06:59:42] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 06:59:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 06:59:42] [INFO ] After 44ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 06:59:43] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-15 06:59:43] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 06:59:43] [INFO ] Flatten gal took : 15 ms
[2022-05-15 06:59:43] [INFO ] Flatten gal took : 14 ms
[2022-05-15 06:59:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13797730478835513813.gal : 1 ms
[2022-05-15 06:59:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5596044810452757034.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4191588072084953914;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13797730478835513813.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5596044810452757034.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5596044810452757034.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :19 after 29
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :29 after 49
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :49 after 85
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :85 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 253
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :253 after 8855
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8855 after 141680
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :141680 after 1.6913e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.6913e+06 after 1.23208e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.23208e+07 after 2.79198e+07
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.01192e+08,2.87237,72156,2,26332,18,308606,6,0,1053,113419,0
Total reachable state count : 101192410
Verifying 1 reachability properties.
Reachability property apf1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,21,3.20392,72156,2,181,18,308606,7,0,1086,113419,0
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 280 reset in 1430 ms.
Product exploration explored 100000 steps with 277 reset in 1453 ms.
Built C files in :
/tmp/ltsmin12061699417021812781
[2022-05-15 06:59:49] [INFO ] Too many transitions (5407) to apply POR reductions. Disabling POR matrices.
[2022-05-15 06:59:49] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12061699417021812781
Running compilation step : cd /tmp/ltsmin12061699417021812781;'/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/ltsmin12061699417021812781;'/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/ltsmin12061699417021812781;'/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 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Applied a total of 0 rules in 1306 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2022-05-15 06:59:53] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:53] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 06:59:55] [INFO ] Dead Transitions using invariants and state equation in 1493 ms found 0 transitions.
[2022-05-15 06:59:55] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 06:59:56] [INFO ] Implicit Places using invariants in 558 ms returned []
[2022-05-15 06:59:56] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:56] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 06:59:56] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 06:59:58] [INFO ] Implicit Places using invariants and state equation in 2164 ms returned []
Implicit Place search using SMT with State Equation took 2725 ms to find 0 implicit places.
[2022-05-15 06:59:58] [INFO ] Redundant transitions in 346 ms returned []
[2022-05-15 06:59:58] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2022-05-15 06:59:58] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 07:00:00] [INFO ] Dead Transitions using invariants and state equation in 1491 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 5407/5407 transitions.
Built C files in :
/tmp/ltsmin8510488025433118807
[2022-05-15 07:00:00] [INFO ] Too many transitions (5407) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:00:00] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8510488025433118807
Running compilation step : cd /tmp/ltsmin8510488025433118807;'/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/ltsmin8510488025433118807;'/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/ltsmin8510488025433118807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 07:00:03] [INFO ] Flatten gal took : 165 ms
[2022-05-15 07:00:03] [INFO ] Flatten gal took : 171 ms
[2022-05-15 07:00:03] [INFO ] Time to serialize gal into /tmp/LTL16914975489908164361.gal : 23 ms
[2022-05-15 07:00:03] [INFO ] Time to serialize properties into /tmp/LTL14470143681763885157.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/LTL16914975489908164361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14470143681763885157.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/LTL1691497...268
Read 1 LTL properties
Checking formula 0 : !((F((X(X(G((F((G("(((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB_ATTENTE_B_4<1)||(COMPTEUR_17<1)))"))&&("(((NB_ATTENTE_A_0<1)||(CONTRO...295
Formula 0 simplified : !F("((CAPACITE>=20)&&(VIDANGE_1>=1))" | XXG("((ROUTE_A>=1)&&(NB_ATTENTE_A_5>=1))" | F("(((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB...278
Detected timeout of ITS tools.
[2022-05-15 07:00:18] [INFO ] Flatten gal took : 166 ms
[2022-05-15 07:00:18] [INFO ] Applying decomposition
[2022-05-15 07:00:19] [INFO ] Flatten gal took : 172 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/graph15774546241573843383.txt' '-o' '/tmp/graph15774546241573843383.bin' '-w' '/tmp/graph15774546241573843383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15774546241573843383.bin' '-l' '-1' '-v' '-w' '/tmp/graph15774546241573843383.weights' '-q' '0' '-e' '0.001'
[2022-05-15 07:00:19] [INFO ] Decomposing Gal with order
[2022-05-15 07:00:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 07:00:21] [INFO ] Removed a total of 10493 redundant transitions.
[2022-05-15 07:00:21] [INFO ] Flatten gal took : 1898 ms
[2022-05-15 07:00:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 447 labels/synchronizations in 54 ms.
[2022-05-15 07:00:21] [INFO ] Time to serialize gal into /tmp/LTL251627554914854176.gal : 2 ms
[2022-05-15 07:00:21] [INFO ] Time to serialize properties into /tmp/LTL9992564041595754390.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/LTL251627554914854176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9992564041595754390.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/LTL2516275...244
Read 1 LTL properties
Checking formula 0 : !((F((X(X(G((F((G("(((u2.NB_ATTENTE_A_0<1)||(u2.CONTROLEUR_1<1))||((u2.NB_ATTENTE_B_4<1)||(i2.u3.COMPTEUR_17<1)))"))&&("(((u2.NB_ATTEN...346
Formula 0 simplified : !F("((u0.CAPACITE>=20)&&(i2.u1.VIDANGE_1>=1))" | XXG("((i2.u1.ROUTE_A>=1)&&(i2.u1.NB_ATTENTE_A_5>=1))" | F("(((u2.NB_ATTENTE_A_0<1)|...329
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13806701359051967456
[2022-05-15 07:00:36] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13806701359051967456
Running compilation step : cd /tmp/ltsmin13806701359051967456;'/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/ltsmin13806701359051967456;'/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/ltsmin13806701359051967456;'/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-PT-V50P20N50-LTLFireability-09 finished in 138042 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!(p0 U X(!X(p1)))||X(G(!p0))))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 45 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2022-05-15 07:00:39] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 07:00:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:00:41] [INFO ] Dead Transitions using invariants and state equation in 1431 ms found 0 transitions.
[2022-05-15 07:00:41] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 07:00:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:00:41] [INFO ] Implicit Places using invariants in 698 ms returned []
[2022-05-15 07:00:41] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 07:00:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:00:43] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2134 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 24 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 163/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 411 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), true, (NOT p1), (NOT p1), p0]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 8}, { cond=p0, acceptance={} source=4 dest: 9}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 5}], [{ cond=true, acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=p0, acceptance={} source=10 dest: 7}, { cond=(NOT p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (GEQ s53 20) (GEQ s110 1)), p1:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 251 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-11 finished in 4088 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0) U (!X(p0)&&p1)))||F(X(p2))))'
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 26 ms. Remains 166 /166 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2022-05-15 07:00:43] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 07:00:43] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:00:46] [INFO ] Dead Transitions using invariants and state equation in 2131 ms found 0 transitions.
[2022-05-15 07:00:46] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 07:00:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:00:46] [INFO ] Implicit Places using invariants in 631 ms returned []
[2022-05-15 07:00:46] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 07:00:46] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 07:00:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:00:49] [INFO ] Implicit Places using invariants and state equation in 2588 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3235 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 24 ms. Remains 165 /165 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 165/166 places, 5408/5408 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s53 1), p2:(OR (AND (GEQ s25 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)) (GEQ s110 1)), p0:(AND (GEQ s25 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10314 reset in 1729 ms.
Product exploration explored 100000 steps with 10261 reset in 1607 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/165 stabilizing places and 204/5408 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 380 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 07:00:53] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:00:53] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:00:53] [INFO ] After 37ms 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 p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) p1 p0))), (G (NOT (AND (NOT p2) (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 12 factoid took 532 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p2))]
[2022-05-15 07:00:54] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:00:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:00:55] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-05-15 07:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 07:00:56] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2022-05-15 07:00:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 07:00:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 07:00:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 07:00:57] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2022-05-15 07:00:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:00:58] [INFO ] [Nat]Added 102 Read/Feed constraints in 955 ms returned sat
[2022-05-15 07:00:59] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 257 transitions) in 157 ms.
[2022-05-15 07:00:59] [INFO ] Added : 40 causal constraints over 10 iterations in 556 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 5408/5408 transitions.
Applied a total of 0 rules in 938 ms. Remains 165 /165 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2022-05-15 07:01:00] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:01:00] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:01:01] [INFO ] Dead Transitions using invariants and state equation in 1392 ms found 0 transitions.
[2022-05-15 07:01:01] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:01:01] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 07:01:02] [INFO ] Implicit Places using invariants in 597 ms returned []
[2022-05-15 07:01:02] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:01:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:01:03] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2022-05-15 07:01:03] [INFO ] Redundant transitions in 315 ms returned []
[2022-05-15 07:01:03] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:01:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:01:05] [INFO ] Dead Transitions using invariants and state equation in 1468 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/165 places, 5408/5408 transitions.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/165 stabilizing places and 204/5408 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p2) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p2) (NOT p1))]
[2022-05-15 07:01:05] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:01:05] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:01:07] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-05-15 07:01:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 07:01:07] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2022-05-15 07:01:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 07:01:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 07:01:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 07:01:09] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2022-05-15 07:01:09] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:01:09] [INFO ] [Nat]Added 102 Read/Feed constraints in 188 ms returned sat
[2022-05-15 07:01:09] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 257 transitions) in 154 ms.
[2022-05-15 07:01:10] [INFO ] Added : 79 causal constraints over 16 iterations in 786 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p1))
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 11359 reset in 1643 ms.
Product exploration explored 100000 steps with 11334 reset in 1570 ms.
Built C files in :
/tmp/ltsmin3962988255278472996
[2022-05-15 07:01:13] [INFO ] Too many transitions (5408) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:01:13] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3962988255278472996
Running compilation step : cd /tmp/ltsmin3962988255278472996;'/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/ltsmin3962988255278472996;'/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/ltsmin3962988255278472996;'/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 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 5408/5408 transitions.
Applied a total of 0 rules in 945 ms. Remains 165 /165 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2022-05-15 07:01:17] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:01:17] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 07:01:19] [INFO ] Dead Transitions using invariants and state equation in 1523 ms found 0 transitions.
[2022-05-15 07:01:19] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:01:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:01:19] [INFO ] Implicit Places using invariants in 607 ms returned []
[2022-05-15 07:01:19] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:01:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:01:20] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
[2022-05-15 07:01:21] [INFO ] Redundant transitions in 320 ms returned []
[2022-05-15 07:01:21] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:01:21] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:01:22] [INFO ] Dead Transitions using invariants and state equation in 1601 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/165 places, 5408/5408 transitions.
Built C files in :
/tmp/ltsmin1935197239130239650
[2022-05-15 07:01:22] [INFO ] Too many transitions (5408) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:01:22] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1935197239130239650
Running compilation step : cd /tmp/ltsmin1935197239130239650;'/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/ltsmin1935197239130239650;'/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/ltsmin1935197239130239650;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 07:01:26] [INFO ] Flatten gal took : 170 ms
[2022-05-15 07:01:26] [INFO ] Flatten gal took : 175 ms
[2022-05-15 07:01:26] [INFO ] Time to serialize gal into /tmp/LTL199163013271726714.gal : 22 ms
[2022-05-15 07:01:26] [INFO ] Time to serialize properties into /tmp/LTL8255085530732893718.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/LTL199163013271726714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8255085530732893718.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/LTL1991630...265
Read 1 LTL properties
Checking formula 0 : !(((F((G("(((NB_ATTENTE_A_24>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))"))U((!(X("(((NB_ATTENTE_A_24>=1)&&(ATTENTE_A>=1...331
Formula 0 simplified : !(F(G"(((NB_ATTENTE_A_24>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))" U ("(SUR_PONT_A>=1)" & !X"(((NB_ATTENTE_A_24>=1)...315
Detected timeout of ITS tools.
[2022-05-15 07:01:41] [INFO ] Flatten gal took : 159 ms
[2022-05-15 07:01:41] [INFO ] Applying decomposition
[2022-05-15 07:01:41] [INFO ] Flatten gal took : 166 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/graph18013412491267013345.txt' '-o' '/tmp/graph18013412491267013345.bin' '-w' '/tmp/graph18013412491267013345.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18013412491267013345.bin' '-l' '-1' '-v' '-w' '/tmp/graph18013412491267013345.weights' '-q' '0' '-e' '0.001'
[2022-05-15 07:01:42] [INFO ] Decomposing Gal with order
[2022-05-15 07:01:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 07:01:44] [INFO ] Removed a total of 10592 redundant transitions.
[2022-05-15 07:01:44] [INFO ] Flatten gal took : 1828 ms
[2022-05-15 07:01:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 545 labels/synchronizations in 56 ms.
[2022-05-15 07:01:44] [INFO ] Time to serialize gal into /tmp/LTL10452071235020299241.gal : 2 ms
[2022-05-15 07:01:44] [INFO ] Time to serialize properties into /tmp/LTL7393586355848043978.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/LTL10452071235020299241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7393586355848043978.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/LTL1045207...246
Read 1 LTL properties
Checking formula 0 : !(((F((G("(((i2.u1.NB_ATTENTE_A_24>=1)&&(i0.u0.ATTENTE_A>=1))&&((i0.u2.CAPACITE>=1)&&(u3.CONTROLEUR_1>=1)))"))U((!(X("(((i2.u1.NB_ATTE...406
Formula 0 simplified : !(F(G"(((i2.u1.NB_ATTENTE_A_24>=1)&&(i0.u0.ATTENTE_A>=1))&&((i0.u2.CAPACITE>=1)&&(u3.CONTROLEUR_1>=1)))" U ("(i0.u2.SUR_PONT_A>=1)" ...390
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15547306068905154256
[2022-05-15 07:01:59] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15547306068905154256
Running compilation step : cd /tmp/ltsmin15547306068905154256;'/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/ltsmin15547306068905154256;'/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/ltsmin15547306068905154256;'/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-PT-V50P20N50-LTLFireability-12 finished in 78381 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(!(G(F(p0)) U (G(p2)&&p1)))))))'
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 968 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2022-05-15 07:02:03] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 07:02:03] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 07:02:04] [INFO ] Dead Transitions using invariants and state equation in 1542 ms found 0 transitions.
[2022-05-15 07:02:04] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 07:02:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:02:05] [INFO ] Implicit Places using invariants in 581 ms returned []
[2022-05-15 07:02:05] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 07:02:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:02:06] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1654 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 1137 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 164/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND p1 p2), (AND p1 p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s32 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)), p2:(AND (GEQ s109 1) (GEQ s154 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 245 reset in 1496 ms.
Product exploration explored 100000 steps with 245 reset in 1479 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND p1 p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 07:02:11] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2022-05-15 07:02:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:02:11] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 07:02:11] [INFO ] After 68ms 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 p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p2))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 p2)))
Knowledge based reduction with 6 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-13 finished in 9217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F(p0))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 163 transition count 5406
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 161 transition count 5404
Applied a total of 9 rules in 1133 ms. Remains 161 /166 variables (removed 5) and now considering 5404/5408 (removed 4) transitions.
[2022-05-15 07:02:12] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 161 cols
[2022-05-15 07:02:12] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 07:02:13] [INFO ] Implicit Places using invariants in 545 ms returned []
[2022-05-15 07:02:13] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 161 cols
[2022-05-15 07:02:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 07:02:13] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:02:15] [INFO ] Implicit Places using invariants and state equation in 2492 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3055 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/166 places, 5404/5408 transitions.
Applied a total of 0 rules in 1201 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 159/166 places, 5404/5408 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-14 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 (LT s1 1) (LT s52 1) (LT s78 1) (LT s148 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 328 reset in 1736 ms.
Product exploration explored 100000 steps with 328 reset in 1731 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 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 57 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 112021 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112021 steps, saw 38758 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 07:02:23] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:02:23] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 07:02:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 07:02:24] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 07:02:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 07:02:24] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 07:02:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:02:24] [INFO ] After 188ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 07:02:24] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-15 07:02:24] [INFO ] After 707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 846 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 5404/5404 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 112212 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112212 steps, saw 38819 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 07:02:28] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:02:28] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 07:02:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 07:02:29] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 07:02:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 07:02:29] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 07:02:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:02:29] [INFO ] After 197ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 07:02:29] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2022-05-15 07:02:29] [INFO ] After 570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 841 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 5404/5404 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 977 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
[2022-05-15 07:02:31] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:02:31] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 07:02:32] [INFO ] Implicit Places using invariants in 552 ms returned []
[2022-05-15 07:02:32] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:02:32] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 07:02:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:02:33] [INFO ] Implicit Places using invariants and state equation in 1443 ms returned []
Implicit Place search using SMT with State Equation took 1997 ms to find 0 implicit places.
[2022-05-15 07:02:33] [INFO ] Redundant transitions in 306 ms returned []
[2022-05-15 07:02:33] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:02:33] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 07:02:35] [INFO ] Dead Transitions using invariants and state equation in 1370 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 5404/5404 transitions.
Ensure Unique test removed 4998 transitions
Reduce isomorphic transitions removed 4998 transitions.
Iterating post reduction 0 with 4998 rules applied. Total rules applied 4998 place count 159 transition count 406
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5000 place count 159 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5002 place count 157 transition count 404
Applied a total of 5002 rules in 12 ms. Remains 157 /159 variables (removed 2) and now considering 404/5404 (removed 5000) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 404 rows 157 cols
[2022-05-15 07:02:35] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 07:02:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 07:02:35] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 07:02:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 07:02:35] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 07:02:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 07:02:35] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 07:02:35] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-15 07:02:35] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 07:02:35] [INFO ] Flatten gal took : 13 ms
[2022-05-15 07:02:35] [INFO ] Flatten gal took : 10 ms
[2022-05-15 07:02:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1633561431070501243.gal : 4 ms
[2022-05-15 07:02:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4016042193933349284.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6980904793571845009;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1633561431070501243.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4016042193933349284.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4016042193933349284.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 42
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :42 after 82
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :82 after 157
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :157 after 202
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :202 after 2020
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2020 after 21210
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :21210 after 524796
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :524796 after 781740
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :781740 after 3.90143e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.90143e+06 after 1.71674e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.71674e+07 after 6.59267e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.54636e+08,5.69326,154204,2,52651,19,381602,7,0,1040,240123,0
Total reachable state count : 354636250
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,5.69783,154204,2,158,19,381602,7,0,1047,240123,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 1010 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
[2022-05-15 07:02:42] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:02:42] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 07:02:43] [INFO ] Implicit Places using invariants in 537 ms returned []
[2022-05-15 07:02:43] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:02:43] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 07:02:43] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:02:44] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
[2022-05-15 07:02:44] [INFO ] Redundant transitions in 305 ms returned []
[2022-05-15 07:02:44] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:02:44] [INFO ] Computed 4 place invariants in 14 ms
[2022-05-15 07:02:46] [INFO ] Dead Transitions using invariants and state equation in 1394 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 5404/5404 transitions.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 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 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 107504 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107504 steps, saw 37179 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 07:02:49] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:02:49] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 07:02:49] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 07:02:49] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 07:02:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 07:02:50] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 07:02:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:02:50] [INFO ] After 198ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 07:02:50] [INFO ] After 311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2022-05-15 07:02:50] [INFO ] After 569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 857 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 5404/5404 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 111918 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111918 steps, saw 38725 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 07:02:54] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:02:54] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 07:02:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 07:02:54] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 07:02:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2022-05-15 07:02:55] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 07:02:55] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:02:55] [INFO ] After 198ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 07:02:55] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-05-15 07:02:55] [INFO ] After 607ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 842 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 5404/5404 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 962 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
[2022-05-15 07:02:57] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:02:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 07:02:57] [INFO ] Implicit Places using invariants in 525 ms returned []
[2022-05-15 07:02:57] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:02:57] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 07:02:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:02:59] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 1921 ms to find 0 implicit places.
[2022-05-15 07:02:59] [INFO ] Redundant transitions in 303 ms returned []
[2022-05-15 07:02:59] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:02:59] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 07:03:00] [INFO ] Dead Transitions using invariants and state equation in 1347 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 5404/5404 transitions.
Ensure Unique test removed 4998 transitions
Reduce isomorphic transitions removed 4998 transitions.
Iterating post reduction 0 with 4998 rules applied. Total rules applied 4998 place count 159 transition count 406
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5000 place count 159 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5002 place count 157 transition count 404
Applied a total of 5002 rules in 13 ms. Remains 157 /159 variables (removed 2) and now considering 404/5404 (removed 5000) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 404 rows 157 cols
[2022-05-15 07:03:00] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 07:03:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 07:03:01] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 07:03:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 07:03:01] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 07:03:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 07:03:01] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 07:03:01] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-15 07:03:01] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 07:03:01] [INFO ] Flatten gal took : 13 ms
[2022-05-15 07:03:01] [INFO ] Flatten gal took : 10 ms
[2022-05-15 07:03:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5053039854718162285.gal : 2 ms
[2022-05-15 07:03:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17621368447486445923.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14821632789121569457;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5053039854718162285.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17621368447486445923.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality17621368447486445923.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 42
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :42 after 82
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :82 after 157
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :157 after 202
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :202 after 2020
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2020 after 21210
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :21210 after 524796
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :524796 after 781740
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :781740 after 3.90143e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.90143e+06 after 1.71674e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.71674e+07 after 6.59267e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.54636e+08,5.60431,154648,2,52651,19,381937,7,0,1040,240123,0
Total reachable state count : 354636250
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,5.60927,154648,2,158,19,381937,7,0,1047,240123,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 328 reset in 1718 ms.
Product exploration explored 100000 steps with 328 reset in 1720 ms.
Built C files in :
/tmp/ltsmin2541451727311517639
[2022-05-15 07:03:10] [INFO ] Too many transitions (5404) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:03:10] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2541451727311517639
Running compilation step : cd /tmp/ltsmin2541451727311517639;'/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/ltsmin2541451727311517639;'/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/ltsmin2541451727311517639;'/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 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 1159 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
[2022-05-15 07:03:14] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:03:14] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 07:03:15] [INFO ] Implicit Places using invariants in 517 ms returned []
[2022-05-15 07:03:15] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:03:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 07:03:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:03:17] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 2130 ms to find 0 implicit places.
[2022-05-15 07:03:17] [INFO ] Redundant transitions in 297 ms returned []
[2022-05-15 07:03:17] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2022-05-15 07:03:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 07:03:18] [INFO ] Dead Transitions using invariants and state equation in 1549 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 5404/5404 transitions.
Built C files in :
/tmp/ltsmin7679054477981010094
[2022-05-15 07:03:18] [INFO ] Too many transitions (5404) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:03:18] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7679054477981010094
Running compilation step : cd /tmp/ltsmin7679054477981010094;'/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/ltsmin7679054477981010094;'/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/ltsmin7679054477981010094;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 07:03:22] [INFO ] Flatten gal took : 150 ms
[2022-05-15 07:03:22] [INFO ] Flatten gal took : 156 ms
[2022-05-15 07:03:22] [INFO ] Time to serialize gal into /tmp/LTL8998378389409662791.gal : 35 ms
[2022-05-15 07:03:22] [INFO ] Time to serialize properties into /tmp/LTL6015527127788960085.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/LTL8998378389409662791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6015527127788960085.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/LTL8998378...266
Read 1 LTL properties
Checking formula 0 : !((G(F(F("(((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB_ATTENTE_B_24<1)||(COMPTEUR_40<1)))")))))
Formula 0 simplified : !GF"(((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB_ATTENTE_B_24<1)||(COMPTEUR_40<1)))"
Detected timeout of ITS tools.
[2022-05-15 07:03:37] [INFO ] Flatten gal took : 153 ms
[2022-05-15 07:03:37] [INFO ] Applying decomposition
[2022-05-15 07:03:37] [INFO ] Flatten gal took : 156 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/graph15832887300487679543.txt' '-o' '/tmp/graph15832887300487679543.bin' '-w' '/tmp/graph15832887300487679543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15832887300487679543.bin' '-l' '-1' '-v' '-w' '/tmp/graph15832887300487679543.weights' '-q' '0' '-e' '0.001'
[2022-05-15 07:03:38] [INFO ] Decomposing Gal with order
[2022-05-15 07:03:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 07:03:39] [INFO ] Removed a total of 10395 redundant transitions.
[2022-05-15 07:03:39] [INFO ] Flatten gal took : 1605 ms
[2022-05-15 07:03:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 447 labels/synchronizations in 48 ms.
[2022-05-15 07:03:40] [INFO ] Time to serialize gal into /tmp/LTL12625836269696589262.gal : 1 ms
[2022-05-15 07:03:40] [INFO ] Time to serialize properties into /tmp/LTL1678784024077631292.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/LTL12625836269696589262.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1678784024077631292.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/LTL1262583...246
Read 1 LTL properties
Checking formula 0 : !((G(F(F("(((u2.NB_ATTENTE_A_0<1)||(u2.CONTROLEUR_1<1))||((u2.NB_ATTENTE_B_24<1)||(i0.u0.COMPTEUR_40<1)))")))))
Formula 0 simplified : !GF"(((u2.NB_ATTENTE_A_0<1)||(u2.CONTROLEUR_1<1))||((u2.NB_ATTENTE_B_24<1)||(i0.u0.COMPTEUR_40<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8626068068256581947
[2022-05-15 07:03:55] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8626068068256581947
Running compilation step : cd /tmp/ltsmin8626068068256581947;'/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/ltsmin8626068068256581947;'/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/ltsmin8626068068256581947;'/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-PT-V50P20N50-LTLFireability-14 finished in 106655 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(((G(p1) U G(p2))&&p0)) U p3)))'
Support contains 12 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 43 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2022-05-15 07:03:58] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 07:03:58] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:03:59] [INFO ] Dead Transitions using invariants and state equation in 1551 ms found 0 transitions.
[2022-05-15 07:03:59] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 07:03:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:04:00] [INFO ] Implicit Places using invariants in 400 ms returned []
[2022-05-15 07:04:00] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2022-05-15 07:04:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:04:01] [INFO ] Implicit Places using invariants and state equation in 978 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1404 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 22 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 163/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p3), (NOT p3), (OR (NOT p3) (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p3 p0 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(OR (AND (GEQ s108 1) (GEQ s130 1)) (AND (GEQ s39 1) (GEQ s55 1) (GEQ s56 1) (GEQ s148 1))), p0:(AND (GEQ s20 1) (GEQ s55 1) (GEQ s56 1) (GEQ s125 1)),...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-15 finished in 3345 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0) U X(G(p1))))||F(p2))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((((X(!G((!p1 U p2)))||p0) U G(p3)) U p4)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(F(p0) U (X(p1)||G(p2)))||F(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(G((F((G(p0)&&p0))||p1))))||p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0) U (!X(p0)&&p1)))||F(X(p2))))'
Found a CL insensitive property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-12
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 58 ms. Remains 166 /166 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2022-05-15 07:04:02] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 07:04:02] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 07:04:03] [INFO ] Dead Transitions using invariants and state equation in 1359 ms found 0 transitions.
[2022-05-15 07:04:03] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 07:04:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:04:04] [INFO ] Implicit Places using invariants in 597 ms returned []
[2022-05-15 07:04:04] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2022-05-15 07:04:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:04:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:04:06] [INFO ] Implicit Places using invariants and state equation in 2582 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3209 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 165/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 43 ms. Remains 165 /165 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 165/166 places, 5408/5408 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s53 1), p2:(OR (AND (GEQ s25 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)) (GEQ s110 1)), p0:(AND (GEQ s25 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10311 reset in 1599 ms.
Product exploration explored 100000 steps with 10314 reset in 1819 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/165 stabilizing places and 204/5408 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 329 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 07:04:11] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:04:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:04:11] [INFO ] After 34ms 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 p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) p1 p0))), (G (NOT (AND (NOT p2) (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 12 factoid took 422 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p2))]
[2022-05-15 07:04:11] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:04:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:04:13] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-15 07:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 07:04:13] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-05-15 07:04:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 07:04:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 07:04:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 07:04:15] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2022-05-15 07:04:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:04:16] [INFO ] [Nat]Added 102 Read/Feed constraints in 950 ms returned sat
[2022-05-15 07:04:16] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 257 transitions) in 147 ms.
[2022-05-15 07:04:16] [INFO ] Added : 40 causal constraints over 10 iterations in 543 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 5408/5408 transitions.
Applied a total of 0 rules in 933 ms. Remains 165 /165 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2022-05-15 07:04:17] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:04:17] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:04:19] [INFO ] Dead Transitions using invariants and state equation in 1421 ms found 0 transitions.
[2022-05-15 07:04:19] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:04:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:04:19] [INFO ] Implicit Places using invariants in 608 ms returned []
[2022-05-15 07:04:19] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:04:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:04:20] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
[2022-05-15 07:04:21] [INFO ] Redundant transitions in 327 ms returned []
[2022-05-15 07:04:21] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:04:21] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:04:22] [INFO ] Dead Transitions using invariants and state equation in 1386 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/165 places, 5408/5408 transitions.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/165 stabilizing places and 204/5408 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p2) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p2) (NOT p1))]
[2022-05-15 07:04:22] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:04:22] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:04:24] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-05-15 07:04:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 07:04:24] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2022-05-15 07:04:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 07:04:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 07:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 07:04:26] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2022-05-15 07:04:26] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 07:04:26] [INFO ] [Nat]Added 102 Read/Feed constraints in 178 ms returned sat
[2022-05-15 07:04:26] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 257 transitions) in 145 ms.
[2022-05-15 07:04:27] [INFO ] Added : 79 causal constraints over 16 iterations in 719 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p1))
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 11259 reset in 1672 ms.
Product exploration explored 100000 steps with 11379 reset in 1568 ms.
Built C files in :
/tmp/ltsmin11156911220806721698
[2022-05-15 07:04:30] [INFO ] Too many transitions (5408) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:04:30] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11156911220806721698
Running compilation step : cd /tmp/ltsmin11156911220806721698;'/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/ltsmin11156911220806721698;'/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/ltsmin11156911220806721698;'/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 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 5408/5408 transitions.
Applied a total of 0 rules in 971 ms. Remains 165 /165 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2022-05-15 07:04:34] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:04:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:04:36] [INFO ] Dead Transitions using invariants and state equation in 1539 ms found 0 transitions.
[2022-05-15 07:04:36] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:04:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:04:37] [INFO ] Implicit Places using invariants in 594 ms returned []
[2022-05-15 07:04:37] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:04:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:04:37] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
[2022-05-15 07:04:38] [INFO ] Redundant transitions in 317 ms returned []
[2022-05-15 07:04:38] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 165 cols
[2022-05-15 07:04:38] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:04:39] [INFO ] Dead Transitions using invariants and state equation in 1531 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/165 places, 5408/5408 transitions.
Built C files in :
/tmp/ltsmin4968457481418181017
[2022-05-15 07:04:39] [INFO ] Too many transitions (5408) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:04:39] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4968457481418181017
Running compilation step : cd /tmp/ltsmin4968457481418181017;'/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/ltsmin4968457481418181017;'/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/ltsmin4968457481418181017;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 07:04:43] [INFO ] Flatten gal took : 157 ms
[2022-05-15 07:04:43] [INFO ] Flatten gal took : 160 ms
[2022-05-15 07:04:43] [INFO ] Time to serialize gal into /tmp/LTL16275441081976130262.gal : 33 ms
[2022-05-15 07:04:43] [INFO ] Time to serialize properties into /tmp/LTL15828924235105641940.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/LTL16275441081976130262.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15828924235105641940.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/LTL1627544...268
Read 1 LTL properties
Checking formula 0 : !(((F((G("(((NB_ATTENTE_A_24>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))"))U((!(X("(((NB_ATTENTE_A_24>=1)&&(ATTENTE_A>=1...331
Formula 0 simplified : !(F(G"(((NB_ATTENTE_A_24>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))" U ("(SUR_PONT_A>=1)" & !X"(((NB_ATTENTE_A_24>=1)...315
Detected timeout of ITS tools.
[2022-05-15 07:04:58] [INFO ] Flatten gal took : 156 ms
[2022-05-15 07:04:58] [INFO ] Applying decomposition
[2022-05-15 07:04:58] [INFO ] Flatten gal took : 160 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/graph11739155133524850340.txt' '-o' '/tmp/graph11739155133524850340.bin' '-w' '/tmp/graph11739155133524850340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11739155133524850340.bin' '-l' '-1' '-v' '-w' '/tmp/graph11739155133524850340.weights' '-q' '0' '-e' '0.001'
[2022-05-15 07:04:59] [INFO ] Decomposing Gal with order
[2022-05-15 07:04:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 07:05:01] [INFO ] Removed a total of 10592 redundant transitions.
[2022-05-15 07:05:01] [INFO ] Flatten gal took : 1915 ms
[2022-05-15 07:05:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 545 labels/synchronizations in 51 ms.
[2022-05-15 07:05:01] [INFO ] Time to serialize gal into /tmp/LTL6948215572250979587.gal : 2 ms
[2022-05-15 07:05:01] [INFO ] Time to serialize properties into /tmp/LTL9592560081181098289.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/LTL6948215572250979587.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9592560081181098289.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/LTL6948215...245
Read 1 LTL properties
Checking formula 0 : !(((F((G("(((i2.u3.NB_ATTENTE_A_24>=1)&&(i0.u0.ATTENTE_A>=1))&&((i0.u2.CAPACITE>=1)&&(u1.CONTROLEUR_1>=1)))"))U((!(X("(((i2.u3.NB_ATTE...406
Formula 0 simplified : !(F(G"(((i2.u3.NB_ATTENTE_A_24>=1)&&(i0.u0.ATTENTE_A>=1))&&((i0.u2.CAPACITE>=1)&&(u1.CONTROLEUR_1>=1)))" U ("(i0.u2.SUR_PONT_A>=1)" ...390
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17555144327406968575
[2022-05-15 07:05:16] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17555144327406968575
Running compilation step : cd /tmp/ltsmin17555144327406968575;'/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/ltsmin17555144327406968575;'/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/ltsmin17555144327406968575;'/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-PT-V50P20N50-LTLFireability-12 finished in 77590 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F(p0))))'
[2022-05-15 07:05:19] [INFO ] Flatten gal took : 284 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7016405523992547749
[2022-05-15 07:05:20] [INFO ] Too many transitions (5408) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:05:20] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7016405523992547749
Running compilation step : cd /tmp/ltsmin7016405523992547749;'/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-15 07:05:20] [INFO ] Applying decomposition
[2022-05-15 07:05:20] [INFO ] Flatten gal took : 280 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/graph3137495960046486688.txt' '-o' '/tmp/graph3137495960046486688.bin' '-w' '/tmp/graph3137495960046486688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3137495960046486688.bin' '-l' '-1' '-v' '-w' '/tmp/graph3137495960046486688.weights' '-q' '0' '-e' '0.001'
[2022-05-15 07:05:21] [INFO ] Decomposing Gal with order
[2022-05-15 07:05:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 07:05:23] [INFO ] Removed a total of 10691 redundant transitions.
[2022-05-15 07:05:23] [INFO ] Flatten gal took : 2218 ms
[2022-05-15 07:05:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 693 labels/synchronizations in 605 ms.
[2022-05-15 07:05:24] [INFO ] Time to serialize gal into /tmp/LTLFireability11165591622990281676.gal : 19 ms
[2022-05-15 07:05:24] [INFO ] Time to serialize properties into /tmp/LTLFireability8714168820234531065.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/LTLFireability11165591622990281676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8714168820234531065.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 6 LTL properties
Checking formula 0 : !((X((G((F("((((((((i0.u2.CHOIX_1>=1)&&(i1.u4.COMPTEUR_50>=1))||((i0.u2.CHOIX_2>=1)&&(i1.u4.COMPTEUR_50>=1)))||((((i1.u3.NB_ATTENTE_A_...13169
Formula 0 simplified : !X(G(F"((((((((i0.u2.CHOIX_1>=1)&&(i1.u4.COMPTEUR_50>=1))||((i0.u2.CHOIX_2>=1)&&(i1.u4.COMPTEUR_50>=1)))||((((i1.u3.NB_ATTENTE_A_6>=...13154
Compilation finished in 23148 ms.
Running link step : cd /tmp/ltsmin7016405523992547749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin7016405523992547749;'/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(([]((<>((LTLAPp0==true)) U X([]((LTLAPp1==true)))))||<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin7016405523992547749;'/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(([]((<>((LTLAPp0==true)) U X([]((LTLAPp1==true)))))||<>((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7016405523992547749;'/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( U (LTLAPp5==true))))||(LTLAPp3==true)) U []((LTLAPp6==true))) U (LTLAPp7==true)))' '--buchi-type=spotba'
LTSmin run took 489 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin7016405523992547749;'/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 (X((LTLAPp1==true))||[]((LTLAPp7==true))))||<>((LTLAPp8==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin7016405523992547749;'/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 (X((LTLAPp1==true))||[]((LTLAPp7==true))))||<>((LTLAPp8==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7016405523992547749;'/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([]((<>(([]((LTLAPp9==true))&&(LTLAPp9==true)))||(LTLAPp10==true)))))||(LTLAPp11==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 07:30:43] [INFO ] Flatten gal took : 373 ms
[2022-05-15 07:30:43] [INFO ] Time to serialize gal into /tmp/LTLFireability13315420446525238143.gal : 44 ms
[2022-05-15 07:30:43] [INFO ] Time to serialize properties into /tmp/LTLFireability17331521905698962071.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/LTLFireability13315420446525238143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17331521905698962071.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/LTLFireabi...290
Read 5 LTL properties
Checking formula 0 : !((X((G((F("((((((((CHOIX_1>=1)&&(COMPTEUR_50>=1))||((CHOIX_2>=1)&&(COMPTEUR_50>=1)))||((((NB_ATTENTE_A_6>=1)&&(ATTENTE_A>=1))&&((CAPA...10133
Formula 0 simplified : !X(G(F"((((((((CHOIX_1>=1)&&(COMPTEUR_50>=1))||((CHOIX_2>=1)&&(COMPTEUR_50>=1)))||((((NB_ATTENTE_A_6>=1)&&(ATTENTE_A>=1))&&((CAPACIT...10118
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin7016405523992547749;'/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([]((<>(([]((LTLAPp9==true))&&(LTLAPp9==true)))||(LTLAPp10==true)))))||(LTLAPp11==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7016405523992547749;'/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' '(<>(([]((LTLAPp12==true)) U (!X((LTLAPp12==true))&&(LTLAPp13==true))))||<>(X((LTLAPp14==true))))' '--buchi-type=spotba'
LTSmin run took 4562 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin7016405523992547749;'/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' '[](<>(<>((LTLAPp15==true))))' '--buchi-type=spotba'
BK_STOP 1652600245195
--------------------
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-PT-V50P20N50"
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-PT-V50P20N50, 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-165251918300244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N50.tgz
mv BridgeAndVehicles-PT-V50P20N50 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 ;