About the Execution of ITS-Tools for Parking-PT-864
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3159.084 | 654192.00 | 1285443.00 | 2111.40 | TFFFFFFFFFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536400452.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Parking-PT-864, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536400452
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 5.8K Feb 26 16:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 16:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 15:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 26 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 427K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-864-LTLFireability-00
FORMULA_NAME Parking-PT-864-LTLFireability-01
FORMULA_NAME Parking-PT-864-LTLFireability-02
FORMULA_NAME Parking-PT-864-LTLFireability-03
FORMULA_NAME Parking-PT-864-LTLFireability-04
FORMULA_NAME Parking-PT-864-LTLFireability-05
FORMULA_NAME Parking-PT-864-LTLFireability-06
FORMULA_NAME Parking-PT-864-LTLFireability-07
FORMULA_NAME Parking-PT-864-LTLFireability-08
FORMULA_NAME Parking-PT-864-LTLFireability-09
FORMULA_NAME Parking-PT-864-LTLFireability-10
FORMULA_NAME Parking-PT-864-LTLFireability-11
FORMULA_NAME Parking-PT-864-LTLFireability-12
FORMULA_NAME Parking-PT-864-LTLFireability-13
FORMULA_NAME Parking-PT-864-LTLFireability-14
FORMULA_NAME Parking-PT-864-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678938671780
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-864
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 03:51:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 03:51:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 03:51:15] [INFO ] Load time of PNML (sax parser for PT used): 307 ms
[2023-03-16 03:51:15] [INFO ] Transformed 1185 places.
[2023-03-16 03:51:16] [INFO ] Transformed 1697 transitions.
[2023-03-16 03:51:16] [INFO ] Found NUPN structural information;
[2023-03-16 03:51:16] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 496 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
FORMULA Parking-PT-864-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1178 transition count 1002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1178 transition count 1002
Applied a total of 14 rules in 239 ms. Remains 1178 /1185 variables (removed 7) and now considering 1002/1009 (removed 7) transitions.
// Phase 1: matrix 1002 rows 1178 cols
[2023-03-16 03:51:16] [INFO ] Computed 280 place invariants in 51 ms
[2023-03-16 03:51:18] [INFO ] Implicit Places using invariants in 1767 ms returned []
[2023-03-16 03:51:18] [INFO ] Invariant cache hit.
[2023-03-16 03:51:19] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:51:23] [INFO ] Implicit Places using invariants and state equation in 4801 ms returned [152, 160, 168, 176, 184, 192, 200, 208, 240, 242, 285, 293, 301, 309, 317, 325, 333, 341, 373, 375, 418, 426, 434, 442, 450, 458, 474, 506, 508, 551, 559, 567, 575, 583, 591, 599, 607, 639, 641, 684, 692, 700, 708, 716, 732, 740, 772, 817, 825, 833, 841, 849, 857, 865, 873, 905, 907, 950, 958, 966, 974, 982, 990, 998, 1006, 1038, 1040, 1084, 1092, 1100, 1108, 1116, 1124, 1132, 1140, 1172, 1174]
Discarding 77 places :
Implicit Place search using SMT with State Equation took 6615 ms to find 77 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1101/1185 places, 1002/1009 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 1040 transition count 941
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 1040 transition count 941
Applied a total of 122 rules in 263 ms. Remains 1040 /1101 variables (removed 61) and now considering 941/1002 (removed 61) transitions.
// Phase 1: matrix 941 rows 1040 cols
[2023-03-16 03:51:23] [INFO ] Computed 203 place invariants in 15 ms
[2023-03-16 03:51:24] [INFO ] Implicit Places using invariants in 904 ms returned []
[2023-03-16 03:51:24] [INFO ] Invariant cache hit.
[2023-03-16 03:51:24] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:51:27] [INFO ] Implicit Places using invariants and state equation in 2814 ms returned []
Implicit Place search using SMT with State Equation took 3724 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1040/1185 places, 941/1009 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10844 ms. Remains : 1040/1185 places, 941/1009 transitions.
Support contains 42 out of 1040 places after structural reductions.
[2023-03-16 03:51:27] [INFO ] Flatten gal took : 162 ms
[2023-03-16 03:51:27] [INFO ] Flatten gal took : 88 ms
[2023-03-16 03:51:27] [INFO ] Input system was already deterministic with 941 transitions.
Support contains 38 out of 1040 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 897 ms. (steps per millisecond=11 ) properties (out of 26) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-16 03:51:29] [INFO ] Invariant cache hit.
[2023-03-16 03:51:29] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 03:51:29] [INFO ] [Nat]Absence check using 203 positive place invariants in 91 ms returned sat
[2023-03-16 03:51:31] [INFO ] After 1018ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 03:51:31] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:51:31] [INFO ] After 746ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 03:51:32] [INFO ] After 1753ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 707 ms.
[2023-03-16 03:51:33] [INFO ] After 4133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 4 properties in 250 ms.
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1008 transition count 877
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 976 transition count 877
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 974 transition count 875
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 974 transition count 875
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 226 place count 927 transition count 828
Free-agglomeration rule applied 253 times.
Iterating global reduction 2 with 253 rules applied. Total rules applied 479 place count 927 transition count 575
Reduce places removed 253 places and 0 transitions.
Graph (complete) has 1347 edges and 674 vertex of which 181 are kept as prefixes of interest. Removing 493 places using SCC suffix rule.2 ms
Discarding 493 places :
Also discarding 407 output transitions
Drop transitions removed 407 transitions
Iterating post reduction 2 with 254 rules applied. Total rules applied 733 place count 181 transition count 168
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 757 place count 181 transition count 144
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 758 place count 181 transition count 143
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 759 place count 181 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 760 place count 180 transition count 142
Applied a total of 760 rules in 411 ms. Remains 180 /1040 variables (removed 860) and now considering 142/941 (removed 799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 180/1040 places, 142/941 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :1
Finished Best-First random walk after 3483 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=387 )
FORMULA Parking-PT-864-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((p1||G(p2))))&&p0)))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 140 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-16 03:51:34] [INFO ] Computed 203 place invariants in 6 ms
[2023-03-16 03:51:35] [INFO ] Implicit Places using invariants in 850 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 857 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 104 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-16 03:51:35] [INFO ] Computed 200 place invariants in 8 ms
[2023-03-16 03:51:36] [INFO ] Implicit Places using invariants in 1055 ms returned []
[2023-03-16 03:51:36] [INFO ] Invariant cache hit.
[2023-03-16 03:51:37] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:51:39] [INFO ] Implicit Places using invariants and state equation in 2871 ms returned []
Implicit Place search using SMT with State Equation took 3930 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5033 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s882 1) (EQ s917 1)), p2:(EQ s44 0), p1:(EQ s136 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Parking-PT-864-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-01 finished in 5449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 75 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-16 03:51:40] [INFO ] Computed 203 place invariants in 5 ms
[2023-03-16 03:51:41] [INFO ] Implicit Places using invariants in 927 ms returned [689]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 935 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1037/1040 places, 939/941 transitions.
Applied a total of 0 rules in 37 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1048 ms. Remains : 1037/1040 places, 939/941 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s419 1) (EQ s456 1) (OR (NEQ s645 1) (NEQ s688 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Parking-PT-864-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-02 finished in 1265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1039 transition count 909
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1008 transition count 878
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 977 transition count 878
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 975 transition count 876
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 927 transition count 828
Applied a total of 224 rules in 267 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-16 03:51:41] [INFO ] Computed 203 place invariants in 6 ms
[2023-03-16 03:51:42] [INFO ] Implicit Places using invariants in 1147 ms returned [380, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1148 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 923 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 923 transition count 827
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 922 transition count 826
Applied a total of 4 rules in 103 ms. Remains 922 /924 variables (removed 2) and now considering 826/828 (removed 2) transitions.
// Phase 1: matrix 826 rows 922 cols
[2023-03-16 03:51:42] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-16 03:51:43] [INFO ] Implicit Places using invariants in 868 ms returned []
[2023-03-16 03:51:43] [INFO ] Invariant cache hit.
[2023-03-16 03:51:45] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 2423 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 922/1040 places, 826/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3942 ms. Remains : 922/1040 places, 826/941 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s358 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 252 steps with 0 reset in 14 ms.
FORMULA Parking-PT-864-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-03 finished in 4016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1039 transition count 909
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1008 transition count 878
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 977 transition count 878
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 975 transition count 876
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 927 transition count 828
Applied a total of 224 rules in 142 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-16 03:51:45] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-16 03:51:46] [INFO ] Implicit Places using invariants in 859 ms returned [380, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 861 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 923 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 923 transition count 827
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 922 transition count 826
Applied a total of 4 rules in 105 ms. Remains 922 /924 variables (removed 2) and now considering 826/828 (removed 2) transitions.
// Phase 1: matrix 826 rows 922 cols
[2023-03-16 03:51:46] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-16 03:51:47] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2023-03-16 03:51:47] [INFO ] Invariant cache hit.
[2023-03-16 03:51:49] [INFO ] Implicit Places using invariants and state equation in 1826 ms returned []
Implicit Place search using SMT with State Equation took 2878 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 922/1040 places, 826/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3987 ms. Remains : 922/1040 places, 826/941 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s362 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 312 steps with 0 reset in 7 ms.
FORMULA Parking-PT-864-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-04 finished in 4045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1039 transition count 909
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1008 transition count 878
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 977 transition count 878
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 975 transition count 876
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 927 transition count 828
Applied a total of 224 rules in 126 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-16 03:51:49] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-16 03:51:50] [INFO ] Implicit Places using invariants in 949 ms returned [378, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 951 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 923 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 923 transition count 827
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 922 transition count 826
Applied a total of 4 rules in 90 ms. Remains 922 /924 variables (removed 2) and now considering 826/828 (removed 2) transitions.
// Phase 1: matrix 826 rows 922 cols
[2023-03-16 03:51:50] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-16 03:51:51] [INFO ] Implicit Places using invariants in 778 ms returned []
[2023-03-16 03:51:51] [INFO ] Invariant cache hit.
[2023-03-16 03:51:52] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 2304 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 922/1040 places, 826/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3473 ms. Remains : 922/1040 places, 826/941 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s481 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 272 steps with 0 reset in 4 ms.
FORMULA Parking-PT-864-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-05 finished in 3528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 66 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-16 03:51:52] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-16 03:51:53] [INFO ] Implicit Places using invariants in 956 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 957 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 66 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-16 03:51:53] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-16 03:51:54] [INFO ] Implicit Places using invariants in 954 ms returned []
[2023-03-16 03:51:54] [INFO ] Invariant cache hit.
[2023-03-16 03:51:55] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:51:57] [INFO ] Implicit Places using invariants and state equation in 2597 ms returned []
Implicit Place search using SMT with State Equation took 3553 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4643 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s366 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-07 finished in 4774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1008 transition count 877
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 976 transition count 877
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 974 transition count 875
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 974 transition count 875
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 226 place count 927 transition count 828
Applied a total of 226 rules in 212 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-16 03:51:57] [INFO ] Computed 203 place invariants in 6 ms
[2023-03-16 03:51:58] [INFO ] Implicit Places using invariants in 1041 ms returned [380, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1045 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 923 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 923 transition count 827
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 922 transition count 826
Applied a total of 4 rules in 90 ms. Remains 922 /924 variables (removed 2) and now considering 826/828 (removed 2) transitions.
// Phase 1: matrix 826 rows 922 cols
[2023-03-16 03:51:59] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-16 03:51:59] [INFO ] Implicit Places using invariants in 768 ms returned []
[2023-03-16 03:51:59] [INFO ] Invariant cache hit.
[2023-03-16 03:52:00] [INFO ] State equation strengthened by 332 read => feed constraints.
[2023-03-16 03:52:02] [INFO ] Implicit Places using invariants and state equation in 3009 ms returned []
Implicit Place search using SMT with State Equation took 3779 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 922/1040 places, 826/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5128 ms. Remains : 922/1040 places, 826/941 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s214 1), p1:(NEQ s745 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 394 reset in 1598 ms.
Product exploration explored 100000 steps with 393 reset in 1367 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 289 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Support contains 1 out of 922 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 : 922/922 places, 826/826 transitions.
Applied a total of 0 rules in 59 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2023-03-16 03:52:06] [INFO ] Invariant cache hit.
[2023-03-16 03:52:07] [INFO ] Implicit Places using invariants in 944 ms returned []
[2023-03-16 03:52:07] [INFO ] Invariant cache hit.
[2023-03-16 03:52:08] [INFO ] State equation strengthened by 332 read => feed constraints.
[2023-03-16 03:52:10] [INFO ] Implicit Places using invariants and state equation in 2565 ms returned []
Implicit Place search using SMT with State Equation took 3512 ms to find 0 implicit places.
[2023-03-16 03:52:10] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-16 03:52:10] [INFO ] Invariant cache hit.
[2023-03-16 03:52:11] [INFO ] Dead Transitions using invariants and state equation in 1138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4770 ms. Remains : 922/922 places, 826/826 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1, (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Product exploration explored 100000 steps with 390 reset in 1514 ms.
Product exploration explored 100000 steps with 392 reset in 1372 ms.
Built C files in :
/tmp/ltsmin298641485286146863
[2023-03-16 03:52:14] [INFO ] Computing symmetric may disable matrix : 826 transitions.
[2023-03-16 03:52:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:52:14] [INFO ] Computing symmetric may enable matrix : 826 transitions.
[2023-03-16 03:52:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:52:14] [INFO ] Computing Do-Not-Accords matrix : 826 transitions.
[2023-03-16 03:52:14] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:52:14] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin298641485286146863
Running compilation step : cd /tmp/ltsmin298641485286146863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin298641485286146863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin298641485286146863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 922 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 922/922 places, 826/826 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 921 transition count 825
Applied a total of 2 rules in 63 ms. Remains 921 /922 variables (removed 1) and now considering 825/826 (removed 1) transitions.
// Phase 1: matrix 825 rows 921 cols
[2023-03-16 03:52:17] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-16 03:52:18] [INFO ] Implicit Places using invariants in 963 ms returned []
[2023-03-16 03:52:18] [INFO ] Invariant cache hit.
[2023-03-16 03:52:19] [INFO ] State equation strengthened by 344 read => feed constraints.
[2023-03-16 03:52:21] [INFO ] Implicit Places using invariants and state equation in 2596 ms returned []
Implicit Place search using SMT with State Equation took 3565 ms to find 0 implicit places.
[2023-03-16 03:52:21] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-16 03:52:21] [INFO ] Invariant cache hit.
[2023-03-16 03:52:22] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/922 places, 825/826 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4433 ms. Remains : 921/922 places, 825/826 transitions.
Built C files in :
/tmp/ltsmin15357436752466532104
[2023-03-16 03:52:22] [INFO ] Computing symmetric may disable matrix : 825 transitions.
[2023-03-16 03:52:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:52:22] [INFO ] Computing symmetric may enable matrix : 825 transitions.
[2023-03-16 03:52:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:52:22] [INFO ] Computing Do-Not-Accords matrix : 825 transitions.
[2023-03-16 03:52:22] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:52:22] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15357436752466532104
Running compilation step : cd /tmp/ltsmin15357436752466532104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin15357436752466532104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15357436752466532104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 03:52:25] [INFO ] Flatten gal took : 59 ms
[2023-03-16 03:52:25] [INFO ] Flatten gal took : 66 ms
[2023-03-16 03:52:25] [INFO ] Time to serialize gal into /tmp/LTL15515360816791580358.gal : 14 ms
[2023-03-16 03:52:25] [INFO ] Time to serialize properties into /tmp/LTL15170453533652168559.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15515360816791580358.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1930282593557380494.hoa' '-atoms' '/tmp/LTL15170453533652168559.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15170453533652168559.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1930282593557380494.hoa
Detected timeout of ITS tools.
[2023-03-16 03:52:40] [INFO ] Flatten gal took : 42 ms
[2023-03-16 03:52:40] [INFO ] Flatten gal took : 43 ms
[2023-03-16 03:52:40] [INFO ] Time to serialize gal into /tmp/LTL18170594829059046697.gal : 6 ms
[2023-03-16 03:52:40] [INFO ] Time to serialize properties into /tmp/LTL13079657019803468951.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18170594829059046697.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13079657019803468951.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("(p246==1)"))||(F(G("(p942!=1)")))))
Formula 0 simplified : F!"(p246==1)" & GF!"(p942!=1)"
Detected timeout of ITS tools.
[2023-03-16 03:52:55] [INFO ] Flatten gal took : 38 ms
[2023-03-16 03:52:55] [INFO ] Applying decomposition
[2023-03-16 03:52:55] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11208131295370202273.txt' '-o' '/tmp/graph11208131295370202273.bin' '-w' '/tmp/graph11208131295370202273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11208131295370202273.bin' '-l' '-1' '-v' '-w' '/tmp/graph11208131295370202273.weights' '-q' '0' '-e' '0.001'
[2023-03-16 03:52:56] [INFO ] Decomposing Gal with order
[2023-03-16 03:52:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 03:52:56] [INFO ] Removed a total of 230 redundant transitions.
[2023-03-16 03:52:56] [INFO ] Flatten gal took : 198 ms
[2023-03-16 03:52:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 51 ms.
[2023-03-16 03:52:56] [INFO ] Time to serialize gal into /tmp/LTL3916996950696246612.gal : 20 ms
[2023-03-16 03:52:56] [INFO ] Time to serialize properties into /tmp/LTL11458964513880670659.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3916996950696246612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11458964513880670659.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("(i3.u91.p246==1)"))||(F(G("(i11.u297.p942!=1)")))))
Formula 0 simplified : F!"(i3.u91.p246==1)" & GF!"(i11.u297.p942!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5952087591596695755
[2023-03-16 03:53:11] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5952087591596695755
Running compilation step : cd /tmp/ltsmin5952087591596695755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2205 ms.
Running link step : cd /tmp/ltsmin5952087591596695755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin5952087591596695755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||<>([]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 1722 ms.
FORMULA Parking-PT-864-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-864-LTLFireability-08 finished in 78141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 65 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-16 03:53:15] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-16 03:53:16] [INFO ] Implicit Places using invariants in 1007 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1009 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 71 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-16 03:53:16] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-16 03:53:17] [INFO ] Implicit Places using invariants in 967 ms returned []
[2023-03-16 03:53:17] [INFO ] Invariant cache hit.
[2023-03-16 03:53:18] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:53:20] [INFO ] Implicit Places using invariants and state equation in 2583 ms returned []
Implicit Place search using SMT with State Equation took 3558 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4703 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s650 0) (EQ s414 0)), p1:(EQ s463 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 900 reset in 1785 ms.
Product exploration explored 100000 steps with 869 reset in 1642 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 03:53:24] [INFO ] Invariant cache hit.
[2023-03-16 03:53:24] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 03:53:25] [INFO ] [Nat]Absence check using 200 positive place invariants in 92 ms returned sat
[2023-03-16 03:53:26] [INFO ] After 794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 03:53:26] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:53:26] [INFO ] After 207ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 03:53:26] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-16 03:53:26] [INFO ] After 1614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 107 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 523 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 51 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2023-03-16 03:53:27] [INFO ] Invariant cache hit.
[2023-03-16 03:53:28] [INFO ] Implicit Places using invariants in 1142 ms returned []
[2023-03-16 03:53:28] [INFO ] Invariant cache hit.
[2023-03-16 03:53:29] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:53:31] [INFO ] Implicit Places using invariants and state equation in 2856 ms returned []
Implicit Place search using SMT with State Equation took 4001 ms to find 0 implicit places.
[2023-03-16 03:53:31] [INFO ] Invariant cache hit.
[2023-03-16 03:53:32] [INFO ] Dead Transitions using invariants and state equation in 1185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5240 ms. Remains : 1033/1033 places, 937/937 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND (NOT p1) p0)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 03:53:33] [INFO ] Invariant cache hit.
[2023-03-16 03:53:33] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 03:53:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 94 ms returned sat
[2023-03-16 03:53:34] [INFO ] After 729ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 03:53:34] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:53:34] [INFO ] After 131ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 03:53:34] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-16 03:53:35] [INFO ] After 1395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1033 transition count 907
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1003 transition count 907
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 60 place count 1003 transition count 877
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 120 place count 973 transition count 877
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 216 place count 925 transition count 829
Free-agglomeration rule applied 264 times.
Iterating global reduction 2 with 264 rules applied. Total rules applied 480 place count 925 transition count 565
Reduce places removed 264 places and 0 transitions.
Graph (complete) has 1324 edges and 661 vertex of which 181 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.0 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions removed 396 transitions
Iterating post reduction 2 with 265 rules applied. Total rules applied 745 place count 181 transition count 169
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 769 place count 181 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 770 place count 180 transition count 144
Reduce places removed 60 places and 0 transitions.
Graph (trivial) has 140 edges and 120 vertex of which 110 / 120 are part of one of the 2 SCC in 5 ms
Free SCC test removed 108 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 65 rules applied. Total rules applied 835 place count 12 transition count 140
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 138 rules applied. Total rules applied 973 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 975 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 975 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 979 place count 4 transition count 4
Applied a total of 979 rules in 205 ms. Remains 4 /1033 variables (removed 1029) and now considering 4/937 (removed 933) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 4/1033 places, 4/937 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X (AND (NOT p1) p0)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 485 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 884 reset in 1876 ms.
Product exploration explored 100000 steps with 908 reset in 1647 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1033 transition count 937
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 30 place count 1033 transition count 937
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 60 place count 1033 transition count 937
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 90 place count 1003 transition count 907
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 120 place count 1003 transition count 907
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 168 place count 1003 transition count 939
Deduced a syphon composed of 78 places in 1 ms
Applied a total of 168 rules in 343 ms. Remains 1003 /1033 variables (removed 30) and now considering 939/937 (removed -2) transitions.
[2023-03-16 03:53:40] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 939 rows 1003 cols
[2023-03-16 03:53:40] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-16 03:53:41] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/1033 places, 939/937 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1150 ms. Remains : 1003/1033 places, 939/937 transitions.
Built C files in :
/tmp/ltsmin3361775482711995092
[2023-03-16 03:53:41] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3361775482711995092
Running compilation step : cd /tmp/ltsmin3361775482711995092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2783 ms.
Running link step : cd /tmp/ltsmin3361775482711995092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3361775482711995092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7946981803792101968.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 30 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-16 03:53:56] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-16 03:53:57] [INFO ] Implicit Places using invariants in 992 ms returned []
[2023-03-16 03:53:57] [INFO ] Invariant cache hit.
[2023-03-16 03:53:57] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:53:59] [INFO ] Implicit Places using invariants and state equation in 2573 ms returned []
Implicit Place search using SMT with State Equation took 3566 ms to find 0 implicit places.
[2023-03-16 03:53:59] [INFO ] Invariant cache hit.
[2023-03-16 03:54:01] [INFO ] Dead Transitions using invariants and state equation in 1221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4819 ms. Remains : 1033/1033 places, 937/937 transitions.
Built C files in :
/tmp/ltsmin10369057368085662637
[2023-03-16 03:54:01] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10369057368085662637
Running compilation step : cd /tmp/ltsmin10369057368085662637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2659 ms.
Running link step : cd /tmp/ltsmin10369057368085662637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10369057368085662637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17855346520702608187.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 03:54:16] [INFO ] Flatten gal took : 37 ms
[2023-03-16 03:54:16] [INFO ] Flatten gal took : 36 ms
[2023-03-16 03:54:16] [INFO ] Time to serialize gal into /tmp/LTL11611135824721966709.gal : 7 ms
[2023-03-16 03:54:16] [INFO ] Time to serialize properties into /tmp/LTL16857613284319690971.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11611135824721966709.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13819119288382138907.hoa' '-atoms' '/tmp/LTL16857613284319690971.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16857613284319690971.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13819119288382138907.hoa
Detected timeout of ITS tools.
[2023-03-16 03:54:31] [INFO ] Flatten gal took : 33 ms
[2023-03-16 03:54:31] [INFO ] Flatten gal took : 32 ms
[2023-03-16 03:54:31] [INFO ] Time to serialize gal into /tmp/LTL1948228182924830428.gal : 6 ms
[2023-03-16 03:54:31] [INFO ] Time to serialize properties into /tmp/LTL16228169513179665011.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1948228182924830428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16228169513179665011.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p740==0)&&(p464==0))")&&(F("(p520==0)"))))))
Formula 0 simplified : XF(!"((p740==0)&&(p464==0))" | G!"(p520==0)")
Detected timeout of ITS tools.
[2023-03-16 03:54:46] [INFO ] Flatten gal took : 32 ms
[2023-03-16 03:54:46] [INFO ] Applying decomposition
[2023-03-16 03:54:46] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7024393632335788395.txt' '-o' '/tmp/graph7024393632335788395.bin' '-w' '/tmp/graph7024393632335788395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7024393632335788395.bin' '-l' '-1' '-v' '-w' '/tmp/graph7024393632335788395.weights' '-q' '0' '-e' '0.001'
[2023-03-16 03:54:46] [INFO ] Decomposing Gal with order
[2023-03-16 03:54:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 03:54:46] [INFO ] Removed a total of 115 redundant transitions.
[2023-03-16 03:54:46] [INFO ] Flatten gal took : 96 ms
[2023-03-16 03:54:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2023-03-16 03:54:46] [INFO ] Time to serialize gal into /tmp/LTL1210106782030723572.gal : 18 ms
[2023-03-16 03:54:46] [INFO ] Time to serialize properties into /tmp/LTL7124936346071053235.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1210106782030723572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7124936346071053235.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i10.u234.p740==0)&&(i7.u155.p464==0))")&&(F("(i8.i1.i1.u175.p520==0)"))))))
Formula 0 simplified : XF(!"((i10.u234.p740==0)&&(i7.u155.p464==0))" | G!"(i8.i1.i1.u175.p520==0)")
Reverse transition relation is NOT exact ! Due to transitions i5.u94.t241, i6.u131.t207, i7.u172.t173, i8.i1.i1.u210.t139, i10.u247.t105, i11.u285.t71, i13...278
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17145208632421436460
[2023-03-16 03:55:01] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17145208632421436460
Running compilation step : cd /tmp/ltsmin17145208632421436460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2545 ms.
Running link step : cd /tmp/ltsmin17145208632421436460;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17145208632421436460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((<>((LTLAPp1==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-864-LTLFireability-09 finished in 121240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 51 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-16 03:55:17] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-16 03:55:17] [INFO ] Implicit Places using invariants in 775 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 777 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 49 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-16 03:55:17] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-16 03:55:18] [INFO ] Implicit Places using invariants in 976 ms returned []
[2023-03-16 03:55:18] [INFO ] Invariant cache hit.
[2023-03-16 03:55:19] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:55:21] [INFO ] Implicit Places using invariants and state equation in 2682 ms returned []
Implicit Place search using SMT with State Equation took 3660 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4540 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s824 0) (EQ s867 0)), p0:(EQ s275 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 4319 ms.
Product exploration explored 100000 steps with 50000 reset in 4251 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 207 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLFireability-10 finished in 13459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((p1 U (p2||G(p1))))||p0))))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1039 transition count 940
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1039 transition count 940
Applied a total of 2 rules in 85 ms. Remains 1039 /1040 variables (removed 1) and now considering 940/941 (removed 1) transitions.
// Phase 1: matrix 940 rows 1039 cols
[2023-03-16 03:55:30] [INFO ] Computed 203 place invariants in 4 ms
[2023-03-16 03:55:31] [INFO ] Implicit Places using invariants in 1060 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1062 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1036/1040 places, 940/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1034 transition count 938
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1034 transition count 938
Applied a total of 4 rules in 51 ms. Remains 1034 /1036 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1034 cols
[2023-03-16 03:55:31] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-16 03:55:32] [INFO ] Implicit Places using invariants in 840 ms returned []
[2023-03-16 03:55:32] [INFO ] Invariant cache hit.
[2023-03-16 03:55:33] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:55:35] [INFO ] Implicit Places using invariants and state equation in 3345 ms returned []
Implicit Place search using SMT with State Equation took 4187 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1034/1040 places, 938/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5388 ms. Remains : 1034/1040 places, 938/941 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-864-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (NOT (OR (NEQ s916 1) (AND (EQ s640 1) (EQ s686 1)))) (NEQ s397 1)), p1:(NEQ s397 1), p0:(OR (EQ s640 0) (EQ s686 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 389 reset in 1530 ms.
Product exploration explored 100000 steps with 387 reset in 1322 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p0), (X (X p0)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 253 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 5165 steps, including 18 resets, run visited all 4 properties in 172 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p0), (X (X p0)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 p2)), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) p2))))]
Knowledge based reduction with 6 factoid took 486 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 1034 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1034/1034 places, 938/938 transitions.
Applied a total of 0 rules in 42 ms. Remains 1034 /1034 variables (removed 0) and now considering 938/938 (removed 0) transitions.
[2023-03-16 03:55:40] [INFO ] Invariant cache hit.
[2023-03-16 03:55:41] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2023-03-16 03:55:41] [INFO ] Invariant cache hit.
[2023-03-16 03:55:42] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:55:44] [INFO ] Implicit Places using invariants and state equation in 2953 ms returned []
Implicit Place search using SMT with State Equation took 4002 ms to find 0 implicit places.
[2023-03-16 03:55:44] [INFO ] Invariant cache hit.
[2023-03-16 03:55:45] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5000 ms. Remains : 1034/1034 places, 938/938 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 598 ms. (steps per millisecond=16 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 03:55:46] [INFO ] Invariant cache hit.
[2023-03-16 03:55:47] [INFO ] [Real]Absence check using 200 positive place invariants in 56 ms returned sat
[2023-03-16 03:55:47] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 03:55:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 90 ms returned sat
[2023-03-16 03:55:48] [INFO ] After 807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 03:55:48] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:55:48] [INFO ] After 616ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 03:55:49] [INFO ] After 1071ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 234 ms.
[2023-03-16 03:55:49] [INFO ] After 2572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 242 steps, including 1 resets, run visited all 3 properties in 8 ms. (steps per millisecond=30 )
Parikh walk visited 3 properties in 8 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 p2)), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) p2))))]
Knowledge based reduction with 6 factoid took 490 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 182 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 390 reset in 1521 ms.
Entered a terminal (fully accepting) state of product in 24271 steps with 95 reset in 318 ms.
FORMULA Parking-PT-864-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-11 finished in 22046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 49 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-16 03:55:52] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-16 03:55:53] [INFO ] Implicit Places using invariants in 977 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 979 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 49 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-16 03:55:53] [INFO ] Computed 200 place invariants in 6 ms
[2023-03-16 03:55:54] [INFO ] Implicit Places using invariants in 1210 ms returned []
[2023-03-16 03:55:54] [INFO ] Invariant cache hit.
[2023-03-16 03:55:55] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:55:57] [INFO ] Implicit Places using invariants and state equation in 2636 ms returned []
Implicit Place search using SMT with State Equation took 3848 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4926 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s269 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLFireability-12 finished in 5029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&G((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 939
Applied a total of 4 rules in 50 ms. Remains 1038 /1040 variables (removed 2) and now considering 939/941 (removed 2) transitions.
// Phase 1: matrix 939 rows 1038 cols
[2023-03-16 03:55:57] [INFO ] Computed 203 place invariants in 5 ms
[2023-03-16 03:55:58] [INFO ] Implicit Places using invariants in 901 ms returned [419, 645, 689]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 903 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1040 places, 939/941 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 52 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2023-03-16 03:55:58] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-16 03:55:59] [INFO ] Implicit Places using invariants in 1171 ms returned []
[2023-03-16 03:55:59] [INFO ] Invariant cache hit.
[2023-03-16 03:56:00] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:56:02] [INFO ] Implicit Places using invariants and state equation in 3045 ms returned []
Implicit Place search using SMT with State Equation took 4218 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1040 places, 937/941 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5226 ms. Remains : 1033/1040 places, 937/941 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Parking-PT-864-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 2}, { cond=p1, acceptance={0, 1} source=1 dest: 3}, { cond=p1, acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 1}, { cond=p1, acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s881 1), p0:(EQ s378 0), p2:(NEQ s251 1)], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 1317 reset in 1757 ms.
Product exploration explored 100000 steps with 1359 reset in 1699 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 345 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 03:56:07] [INFO ] Invariant cache hit.
[2023-03-16 03:56:08] [INFO ] [Real]Absence check using 200 positive place invariants in 85 ms returned sat
[2023-03-16 03:56:08] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 03:56:08] [INFO ] [Nat]Absence check using 200 positive place invariants in 92 ms returned sat
[2023-03-16 03:56:09] [INFO ] After 1029ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 03:56:09] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:56:10] [INFO ] After 541ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 03:56:10] [INFO ] After 930ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 301 ms.
[2023-03-16 03:56:11] [INFO ] After 2738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 208 steps, including 0 resets, run visited all 3 properties in 14 ms. (steps per millisecond=14 )
Parikh walk visited 3 properties in 13 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 549 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 41 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2023-03-16 03:56:12] [INFO ] Invariant cache hit.
[2023-03-16 03:56:13] [INFO ] Implicit Places using invariants in 1013 ms returned []
[2023-03-16 03:56:13] [INFO ] Invariant cache hit.
[2023-03-16 03:56:14] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:56:16] [INFO ] Implicit Places using invariants and state equation in 2916 ms returned []
Implicit Place search using SMT with State Equation took 3933 ms to find 0 implicit places.
[2023-03-16 03:56:16] [INFO ] Invariant cache hit.
[2023-03-16 03:56:17] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5035 ms. Remains : 1033/1033 places, 937/937 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 345 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 422 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 03:56:18] [INFO ] Invariant cache hit.
[2023-03-16 03:56:19] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 03:56:19] [INFO ] [Nat]Absence check using 200 positive place invariants in 94 ms returned sat
[2023-03-16 03:56:20] [INFO ] After 822ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 03:56:20] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:56:20] [INFO ] After 135ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 03:56:20] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-16 03:56:20] [INFO ] After 1772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 206 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 11 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 547 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 420 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1288 reset in 1925 ms.
Product exploration explored 100000 steps with 1395 reset in 1711 ms.
Built C files in :
/tmp/ltsmin18348863151795219356
[2023-03-16 03:56:26] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18348863151795219356
Running compilation step : cd /tmp/ltsmin18348863151795219356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2810 ms.
Running link step : cd /tmp/ltsmin18348863151795219356;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18348863151795219356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14378821939908084202.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1033 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Applied a total of 0 rules in 25 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2023-03-16 03:56:41] [INFO ] Invariant cache hit.
[2023-03-16 03:56:42] [INFO ] Implicit Places using invariants in 759 ms returned []
[2023-03-16 03:56:42] [INFO ] Invariant cache hit.
[2023-03-16 03:56:43] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-16 03:56:45] [INFO ] Implicit Places using invariants and state equation in 2843 ms returned []
Implicit Place search using SMT with State Equation took 3603 ms to find 0 implicit places.
[2023-03-16 03:56:45] [INFO ] Invariant cache hit.
[2023-03-16 03:56:46] [INFO ] Dead Transitions using invariants and state equation in 1224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4855 ms. Remains : 1033/1033 places, 937/937 transitions.
Built C files in :
/tmp/ltsmin1068261762520214676
[2023-03-16 03:56:46] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1068261762520214676
Running compilation step : cd /tmp/ltsmin1068261762520214676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2805 ms.
Running link step : cd /tmp/ltsmin1068261762520214676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin1068261762520214676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased663800061066649606.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 03:57:01] [INFO ] Flatten gal took : 30 ms
[2023-03-16 03:57:01] [INFO ] Flatten gal took : 47 ms
[2023-03-16 03:57:01] [INFO ] Time to serialize gal into /tmp/LTL7542443532230900660.gal : 11 ms
[2023-03-16 03:57:01] [INFO ] Time to serialize properties into /tmp/LTL226617914095461397.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7542443532230900660.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2499894520672747334.hoa' '-atoms' '/tmp/LTL226617914095461397.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL226617914095461397.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2499894520672747334.hoa
Detected timeout of ITS tools.
[2023-03-16 03:57:16] [INFO ] Flatten gal took : 29 ms
[2023-03-16 03:57:16] [INFO ] Flatten gal took : 31 ms
[2023-03-16 03:57:16] [INFO ] Time to serialize gal into /tmp/LTL9842988078960157926.gal : 9 ms
[2023-03-16 03:57:16] [INFO ] Time to serialize properties into /tmp/LTL3428576522990178891.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9842988078960157926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3428576522990178891.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(p416==0)"))&&(G(("(p1009!=1)")&&(X(("(p1009!=1)")U((X("(p270!=1)"))||(G("(p1009!=1)")))))))))))
Formula 0 simplified : XG(X!"(p416==0)" | F(!"(p1009!=1)" | X(!"(p1009!=1)" M X!"(p270!=1)")))
Detected timeout of ITS tools.
[2023-03-16 03:57:31] [INFO ] Flatten gal took : 30 ms
[2023-03-16 03:57:31] [INFO ] Applying decomposition
[2023-03-16 03:57:31] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5146845858532090191.txt' '-o' '/tmp/graph5146845858532090191.bin' '-w' '/tmp/graph5146845858532090191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5146845858532090191.bin' '-l' '-1' '-v' '-w' '/tmp/graph5146845858532090191.weights' '-q' '0' '-e' '0.001'
[2023-03-16 03:57:31] [INFO ] Decomposing Gal with order
[2023-03-16 03:57:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 03:57:32] [INFO ] Removed a total of 115 redundant transitions.
[2023-03-16 03:57:32] [INFO ] Flatten gal took : 68 ms
[2023-03-16 03:57:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2023-03-16 03:57:32] [INFO ] Time to serialize gal into /tmp/LTL17308947241013067136.gal : 26 ms
[2023-03-16 03:57:32] [INFO ] Time to serialize properties into /tmp/LTL10380568053491060092.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17308947241013067136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10380568053491060092.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i6.u149.p416==0)"))&&(G(("(i12.u311.p1009!=1)")&&(X(("(i12.u311.p1009!=1)")U((X("(i4.u105.p270!=1)"))||(G("(i12.u311.p1009...171
Formula 0 simplified : XG(X!"(i6.u149.p416==0)" | F(!"(i12.u311.p1009!=1)" | X(!"(i12.u311.p1009!=1)" M X!"(i4.u105.p270!=1)")))
Reverse transition relation is NOT exact ! Due to transitions i2.u93.t241, i4.u132.t207, i6.u172.t173, i8.u209.t139, i9.u248.t105, i11.u287.t71, i12.u324.t...271
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3058332662685195976
[2023-03-16 03:57:47] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3058332662685195976
Running compilation step : cd /tmp/ltsmin3058332662685195976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2807 ms.
Running link step : cd /tmp/ltsmin3058332662685195976;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3058332662685195976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))&&[](((LTLAPp1==true)&&X(((LTLAPp1==true) U (X((LTLAPp2==true))||[]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-864-LTLFireability-14 finished in 124809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U p1))'
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1040 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1008 transition count 877
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 976 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 975 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 226 place count 927 transition count 828
Applied a total of 226 rules in 104 ms. Remains 927 /1040 variables (removed 113) and now considering 828/941 (removed 113) transitions.
// Phase 1: matrix 828 rows 927 cols
[2023-03-16 03:58:02] [INFO ] Computed 203 place invariants in 2 ms
[2023-03-16 03:58:03] [INFO ] Implicit Places using invariants in 833 ms returned [379, 580]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 837 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 925/1040 places, 828/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 924 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 924 transition count 827
Applied a total of 2 rules in 54 ms. Remains 924 /925 variables (removed 1) and now considering 827/828 (removed 1) transitions.
// Phase 1: matrix 827 rows 924 cols
[2023-03-16 03:58:03] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-16 03:58:04] [INFO ] Implicit Places using invariants in 801 ms returned []
[2023-03-16 03:58:04] [INFO ] Invariant cache hit.
[2023-03-16 03:58:04] [INFO ] State equation strengthened by 344 read => feed constraints.
[2023-03-16 03:58:07] [INFO ] Implicit Places using invariants and state equation in 2872 ms returned []
Implicit Place search using SMT with State Equation took 3677 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 924/1040 places, 827/941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4673 ms. Remains : 924/1040 places, 827/941 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), true, p0]
Running random walk in product with property : Parking-PT-864-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s648 1) (EQ s702 1)), p0:(AND (EQ s582 1) (EQ s618 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 394 reset in 1185 ms.
Product exploration explored 100000 steps with 391 reset in 1281 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 359 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 175591 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175591 steps, saw 85579 distinct states, run finished after 3003 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 03:58:13] [INFO ] Invariant cache hit.
[2023-03-16 03:58:13] [INFO ] [Real]Absence check using 201 positive place invariants in 49 ms returned sat
[2023-03-16 03:58:13] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 03:58:14] [INFO ] [Nat]Absence check using 201 positive place invariants in 54 ms returned sat
[2023-03-16 03:58:15] [INFO ] After 849ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 03:58:15] [INFO ] State equation strengthened by 344 read => feed constraints.
[2023-03-16 03:58:16] [INFO ] After 1218ms SMT Verify possible using 344 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 03:58:16] [INFO ] After 1629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 468 ms.
[2023-03-16 03:58:17] [INFO ] After 3245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 4 out of 924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 924/924 places, 827/827 transitions.
Free-agglomeration rule applied 254 times.
Iterating global reduction 0 with 254 rules applied. Total rules applied 254 place count 924 transition count 573
Reduce places removed 254 places and 0 transitions.
Graph (complete) has 1336 edges and 670 vertex of which 190 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.0 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions removed 396 transitions
Iterating post reduction 0 with 255 rules applied. Total rules applied 509 place count 190 transition count 177
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 533 place count 190 transition count 153
Applied a total of 533 rules in 73 ms. Remains 190 /924 variables (removed 734) and now considering 153/827 (removed 674) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 190/924 places, 153/827 transitions.
Finished random walk after 172 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 556 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), true, p0]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), true, p0]
[2023-03-16 03:58:18] [INFO ] Invariant cache hit.
[2023-03-16 03:58:19] [INFO ] [Real]Absence check using 201 positive place invariants in 50 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (AND (NOT p1) p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 8 factoid took 224 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLFireability-15 finished in 16889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Found a Lengthening insensitive property : Parking-PT-864-LTLFireability-09
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1040 transition count 911
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1010 transition count 911
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 60 place count 1010 transition count 881
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 120 place count 980 transition count 881
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 978 transition count 879
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 978 transition count 879
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 220 place count 930 transition count 831
Applied a total of 220 rules in 169 ms. Remains 930 /1040 variables (removed 110) and now considering 831/941 (removed 110) transitions.
// Phase 1: matrix 831 rows 930 cols
[2023-03-16 03:58:19] [INFO ] Computed 203 place invariants in 4 ms
[2023-03-16 03:58:20] [INFO ] Implicit Places using invariants in 1056 ms returned [381, 582, 624]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1057 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 927/1040 places, 831/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 926 transition count 830
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 926 transition count 830
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 925 transition count 829
Applied a total of 4 rules in 67 ms. Remains 925 /927 variables (removed 2) and now considering 829/831 (removed 2) transitions.
// Phase 1: matrix 829 rows 925 cols
[2023-03-16 03:58:20] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-16 03:58:21] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2023-03-16 03:58:21] [INFO ] Invariant cache hit.
[2023-03-16 03:58:22] [INFO ] State equation strengthened by 344 read => feed constraints.
[2023-03-16 03:58:24] [INFO ] Implicit Places using invariants and state equation in 2719 ms returned []
Implicit Place search using SMT with State Equation took 3733 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 925/1040 places, 829/941 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 5030 ms. Remains : 925/1040 places, 829/941 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s585 0) (EQ s377 0)), p1:(EQ s423 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 929 reset in 1496 ms.
Product exploration explored 100000 steps with 894 reset in 1620 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 260 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 5741 steps, including 22 resets, run visited all 3 properties in 109 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 496 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 3 out of 925 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 925/925 places, 829/829 transitions.
Applied a total of 0 rules in 30 ms. Remains 925 /925 variables (removed 0) and now considering 829/829 (removed 0) transitions.
[2023-03-16 03:58:29] [INFO ] Invariant cache hit.
[2023-03-16 03:58:30] [INFO ] Implicit Places using invariants in 1195 ms returned []
[2023-03-16 03:58:30] [INFO ] Invariant cache hit.
[2023-03-16 03:58:31] [INFO ] State equation strengthened by 344 read => feed constraints.
[2023-03-16 03:58:33] [INFO ] Implicit Places using invariants and state equation in 2741 ms returned []
Implicit Place search using SMT with State Equation took 3938 ms to find 0 implicit places.
[2023-03-16 03:58:33] [INFO ] Invariant cache hit.
[2023-03-16 03:58:33] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4872 ms. Remains : 925/925 places, 829/829 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND (NOT p1) p0)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 284 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 03:58:34] [INFO ] Invariant cache hit.
[2023-03-16 03:58:34] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 03:58:35] [INFO ] [Nat]Absence check using 200 positive place invariants in 90 ms returned sat
[2023-03-16 03:58:35] [INFO ] After 677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 03:58:35] [INFO ] State equation strengthened by 344 read => feed constraints.
[2023-03-16 03:58:36] [INFO ] After 465ms SMT Verify possible using 344 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 03:58:36] [INFO ] After 563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-16 03:58:36] [INFO ] After 1651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 925 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 925/925 places, 829/829 transitions.
Free-agglomeration rule applied 264 times.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 925 transition count 565
Reduce places removed 264 places and 0 transitions.
Graph (complete) has 1324 edges and 661 vertex of which 181 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.0 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions removed 396 transitions
Iterating post reduction 0 with 265 rules applied. Total rules applied 529 place count 181 transition count 169
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 553 place count 181 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 554 place count 180 transition count 144
Reduce places removed 60 places and 0 transitions.
Graph (trivial) has 140 edges and 120 vertex of which 110 / 120 are part of one of the 2 SCC in 0 ms
Free SCC test removed 108 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 65 rules applied. Total rules applied 619 place count 12 transition count 140
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 138 rules applied. Total rules applied 757 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 759 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 759 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 763 place count 4 transition count 4
Applied a total of 763 rules in 65 ms. Remains 4 /925 variables (removed 921) and now considering 4/829 (removed 825) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 4/925 places, 4/829 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X (AND (NOT p1) p0)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 407 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 908 reset in 1725 ms.
Product exploration explored 100000 steps with 912 reset in 1611 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 3 out of 925 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 925/925 places, 829/829 transitions.
Applied a total of 0 rules in 24 ms. Remains 925 /925 variables (removed 0) and now considering 829/829 (removed 0) transitions.
[2023-03-16 03:58:40] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 03:58:40] [INFO ] Invariant cache hit.
[2023-03-16 03:58:41] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1036 ms. Remains : 925/925 places, 829/829 transitions.
Built C files in :
/tmp/ltsmin9447069240225053335
[2023-03-16 03:58:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9447069240225053335
Running compilation step : cd /tmp/ltsmin9447069240225053335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2284 ms.
Running link step : cd /tmp/ltsmin9447069240225053335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9447069240225053335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2759341635013980900.hoa' '--buchi-type=spotba'
LTSmin run took 2841 ms.
Treatment of property Parking-PT-864-LTLFireability-09 finished in 27934 ms.
FORMULA Parking-PT-864-LTLFireability-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&G((p1&&X((p1 U (X(p2)||G(p1))))))))))'
Found a Shortening insensitive property : Parking-PT-864-LTLFireability-14
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1040 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1040/1040 places, 941/941 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1040 transition count 910
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 1009 transition count 909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1008 transition count 909
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 64 place count 1008 transition count 878
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 126 place count 977 transition count 878
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 975 transition count 876
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 975 transition count 876
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 224 place count 928 transition count 829
Applied a total of 224 rules in 102 ms. Remains 928 /1040 variables (removed 112) and now considering 829/941 (removed 112) transitions.
// Phase 1: matrix 829 rows 928 cols
[2023-03-16 03:58:47] [INFO ] Computed 203 place invariants in 3 ms
[2023-03-16 03:58:48] [INFO ] Implicit Places using invariants in 1130 ms returned [380, 581, 621]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1132 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 925/1040 places, 829/941 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 924 transition count 828
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 924 transition count 828
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 923 transition count 827
Applied a total of 4 rules in 60 ms. Remains 923 /925 variables (removed 2) and now considering 827/829 (removed 2) transitions.
// Phase 1: matrix 827 rows 923 cols
[2023-03-16 03:58:48] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-16 03:58:49] [INFO ] Implicit Places using invariants in 918 ms returned []
[2023-03-16 03:58:49] [INFO ] Invariant cache hit.
[2023-03-16 03:58:50] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-16 03:58:52] [INFO ] Implicit Places using invariants and state equation in 3107 ms returned []
Implicit Place search using SMT with State Equation took 4027 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 923/1040 places, 827/941 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 5323 ms. Remains : 923/1040 places, 827/941 transitions.
Running random walk in product with property : Parking-PT-864-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 2}, { cond=p1, acceptance={0, 1} source=1 dest: 3}, { cond=p1, acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 1}, { cond=p1, acceptance={0, 1} source=4 dest: 3}, { cond=p1, acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s786 1), p0:(EQ s349 0), p2:(NEQ s237 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1329 reset in 1720 ms.
Product exploration explored 100000 steps with 1401 reset in 1654 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 03:58:57] [INFO ] Invariant cache hit.
[2023-03-16 03:58:57] [INFO ] [Real]Absence check using 200 positive place invariants in 74 ms returned sat
[2023-03-16 03:58:57] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 03:58:58] [INFO ] [Nat]Absence check using 200 positive place invariants in 94 ms returned sat
[2023-03-16 03:58:59] [INFO ] After 921ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 03:58:59] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-16 03:58:59] [INFO ] After 725ms SMT Verify possible using 343 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 03:59:00] [INFO ] After 1114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 267 ms.
[2023-03-16 03:59:00] [INFO ] After 2742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 200 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=22 )
Parikh walk visited 3 properties in 9 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 525 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 827/827 transitions.
Applied a total of 0 rules in 29 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
[2023-03-16 03:59:01] [INFO ] Invariant cache hit.
[2023-03-16 03:59:02] [INFO ] Implicit Places using invariants in 974 ms returned []
[2023-03-16 03:59:02] [INFO ] Invariant cache hit.
[2023-03-16 03:59:03] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-16 03:59:05] [INFO ] Implicit Places using invariants and state equation in 2691 ms returned []
Implicit Place search using SMT with State Equation took 3666 ms to find 0 implicit places.
[2023-03-16 03:59:05] [INFO ] Invariant cache hit.
[2023-03-16 03:59:06] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4335 ms. Remains : 923/923 places, 827/827 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 03:59:07] [INFO ] Invariant cache hit.
[2023-03-16 03:59:07] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 03:59:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 91 ms returned sat
[2023-03-16 03:59:08] [INFO ] After 695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 03:59:08] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-16 03:59:08] [INFO ] After 389ms SMT Verify possible using 343 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 03:59:09] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-16 03:59:09] [INFO ] After 1630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 827/827 transitions.
Free-agglomeration rule applied 264 times.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 923 transition count 563
Reduce places removed 264 places and 0 transitions.
Graph (complete) has 1321 edges and 659 vertex of which 179 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.0 ms
Discarding 480 places :
Also discarding 396 output transitions
Drop transitions removed 396 transitions
Iterating post reduction 0 with 265 rules applied. Total rules applied 529 place count 179 transition count 167
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 553 place count 179 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 554 place count 178 transition count 142
Reduce places removed 60 places and 0 transitions.
Graph (trivial) has 137 edges and 118 vertex of which 109 / 118 are part of one of the 2 SCC in 0 ms
Free SCC test removed 107 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 63 rules applied. Total rules applied 617 place count 11 transition count 140
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 134 rules applied. Total rules applied 751 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 755 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 756 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 756 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 760 place count 4 transition count 4
Applied a total of 760 rules in 75 ms. Remains 4 /923 variables (removed 919) and now considering 4/827 (removed 823) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 4/923 places, 4/827 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 523 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 442 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1296 reset in 2006 ms.
Product exploration explored 100000 steps with 1359 reset in 1667 ms.
Built C files in :
/tmp/ltsmin13247919893959079837
[2023-03-16 03:59:14] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13247919893959079837
Running compilation step : cd /tmp/ltsmin13247919893959079837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2249 ms.
Running link step : cd /tmp/ltsmin13247919893959079837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13247919893959079837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13030981845487991175.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 923/923 places, 827/827 transitions.
Applied a total of 0 rules in 19 ms. Remains 923 /923 variables (removed 0) and now considering 827/827 (removed 0) transitions.
[2023-03-16 03:59:29] [INFO ] Invariant cache hit.
[2023-03-16 03:59:30] [INFO ] Implicit Places using invariants in 816 ms returned []
[2023-03-16 03:59:30] [INFO ] Invariant cache hit.
[2023-03-16 03:59:31] [INFO ] State equation strengthened by 343 read => feed constraints.
[2023-03-16 03:59:33] [INFO ] Implicit Places using invariants and state equation in 2609 ms returned []
Implicit Place search using SMT with State Equation took 3427 ms to find 0 implicit places.
[2023-03-16 03:59:33] [INFO ] Invariant cache hit.
[2023-03-16 03:59:34] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4254 ms. Remains : 923/923 places, 827/827 transitions.
Built C files in :
/tmp/ltsmin5284912193954906074
[2023-03-16 03:59:34] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5284912193954906074
Running compilation step : cd /tmp/ltsmin5284912193954906074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2352 ms.
Running link step : cd /tmp/ltsmin5284912193954906074;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5284912193954906074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7590520895052563454.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 03:59:49] [INFO ] Flatten gal took : 25 ms
[2023-03-16 03:59:49] [INFO ] Flatten gal took : 26 ms
[2023-03-16 03:59:49] [INFO ] Time to serialize gal into /tmp/LTL14488829739250913121.gal : 4 ms
[2023-03-16 03:59:49] [INFO ] Time to serialize properties into /tmp/LTL14730159158202709679.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14488829739250913121.gal' '-t' 'CGAL' '-hoa' '/tmp/aut121065900705240449.hoa' '-atoms' '/tmp/LTL14730159158202709679.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14730159158202709679.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut121065900705240449.hoa
Detected timeout of ITS tools.
[2023-03-16 04:00:04] [INFO ] Flatten gal took : 23 ms
[2023-03-16 04:00:04] [INFO ] Flatten gal took : 23 ms
[2023-03-16 04:00:04] [INFO ] Time to serialize gal into /tmp/LTL14872286192740461073.gal : 7 ms
[2023-03-16 04:00:04] [INFO ] Time to serialize properties into /tmp/LTL8866014241673020377.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14872286192740461073.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8866014241673020377.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(p416==0)"))&&(G(("(p1009!=1)")&&(X(("(p1009!=1)")U((X("(p270!=1)"))||(G("(p1009!=1)")))))))))))
Formula 0 simplified : XG(X!"(p416==0)" | F(!"(p1009!=1)" | X(!"(p1009!=1)" M X!"(p270!=1)")))
Detected timeout of ITS tools.
[2023-03-16 04:00:19] [INFO ] Flatten gal took : 23 ms
[2023-03-16 04:00:19] [INFO ] Applying decomposition
[2023-03-16 04:00:19] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16129256571223445314.txt' '-o' '/tmp/graph16129256571223445314.bin' '-w' '/tmp/graph16129256571223445314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16129256571223445314.bin' '-l' '-1' '-v' '-w' '/tmp/graph16129256571223445314.weights' '-q' '0' '-e' '0.001'
[2023-03-16 04:00:19] [INFO ] Decomposing Gal with order
[2023-03-16 04:00:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 04:00:19] [INFO ] Removed a total of 247 redundant transitions.
[2023-03-16 04:00:19] [INFO ] Flatten gal took : 68 ms
[2023-03-16 04:00:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 24 ms.
[2023-03-16 04:00:19] [INFO ] Time to serialize gal into /tmp/LTL1288213377081594769.gal : 14 ms
[2023-03-16 04:00:19] [INFO ] Time to serialize properties into /tmp/LTL555874110465259584.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1288213377081594769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL555874110465259584.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i5.u149.p416==0)"))&&(G(("(i10.u310.p1009!=1)")&&(X(("(i10.u310.p1009!=1)")U((X("(i4.u106.p270!=1)"))||(G("(i10.u310.p1009...171
Formula 0 simplified : XG(X!"(i5.u149.p416==0)" | F(!"(i10.u310.p1009!=1)" | X(!"(i10.u310.p1009!=1)" M X!"(i4.u106.p270!=1)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin95493417574566505
[2023-03-16 04:00:34] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin95493417574566505
Running compilation step : cd /tmp/ltsmin95493417574566505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2062 ms.
Running link step : cd /tmp/ltsmin95493417574566505;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin95493417574566505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))&&[](((LTLAPp1==true)&&X(((LTLAPp1==true) U (X((LTLAPp2==true))||[]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-864-LTLFireability-14 finished in 122738 ms.
[2023-03-16 04:00:49] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4852561302363747347
[2023-03-16 04:00:49] [INFO ] Computing symmetric may disable matrix : 941 transitions.
[2023-03-16 04:00:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 04:00:49] [INFO ] Computing symmetric may enable matrix : 941 transitions.
[2023-03-16 04:00:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 04:00:49] [INFO ] Applying decomposition
[2023-03-16 04:00:50] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8247989584768156463.txt' '-o' '/tmp/graph8247989584768156463.bin' '-w' '/tmp/graph8247989584768156463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8247989584768156463.bin' '-l' '-1' '-v' '-w' '/tmp/graph8247989584768156463.weights' '-q' '0' '-e' '0.001'
[2023-03-16 04:00:50] [INFO ] Decomposing Gal with order
[2023-03-16 04:00:50] [INFO ] Computing Do-Not-Accords matrix : 941 transitions.
[2023-03-16 04:00:50] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 04:00:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 04:00:50] [INFO ] Built C files in 159ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4852561302363747347
Running compilation step : cd /tmp/ltsmin4852561302363747347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 04:00:50] [INFO ] Removed a total of 116 redundant transitions.
[2023-03-16 04:00:50] [INFO ] Flatten gal took : 72 ms
[2023-03-16 04:00:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 28 ms.
[2023-03-16 04:00:50] [INFO ] Time to serialize gal into /tmp/LTLFireability11346883213109854509.gal : 20 ms
[2023-03-16 04:00:50] [INFO ] Time to serialize properties into /tmp/LTLFireability12168785950197423351.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11346883213109854509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12168785950197423351.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i6.u148.p416==0)"))&&(G(("(i11.u315.p1009!=1)")&&(X(("(i11.u315.p1009!=1)")U((X("(i4.u105.p270!=1)"))||(G("(i11.u315.p1009...171
Formula 0 simplified : XG(X!"(i6.u148.p416==0)" | F(!"(i11.u315.p1009!=1)" | X(!"(i11.u315.p1009!=1)" M X!"(i4.u105.p270!=1)")))
Compilation finished in 4055 ms.
Running link step : cd /tmp/ltsmin4852561302363747347;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin4852561302363747347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp2==true))&&[](((LTLAPp3==true)&&X(((LTLAPp3==true) U (X((LTLAPp4==true))||[]((LTLAPp3==true))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i2.u93.t241, i4.u131.t207, i6.u171.t173, i7.u211.t139, i8.i2.i1.u251.t105, i9.u290.t71, i11.t...371
Computing Next relation with stutter on 5.35201e+12 deadlock states
7 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
3086 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,31.0956,723144,1,0,1.38504e+06,14988,15022,3.94222e+06,1196,63607,1439194
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-864-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 649413 ms.
BK_STOP 1678939325972
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-864"
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-5348"
echo " Executing tool itstools"
echo " Input is Parking-PT-864, 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 r261-smll-167863536400452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-864.tgz
mv Parking-PT-864 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 ;