About the Execution of ITS-Tools for CANConstruction-PT-080
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.876 | 3600000.00 | 11686315.00 | 26622.40 | ?FTFFFFTFTFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918700548.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CANConstruction-PT-080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918700548
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.8M
-rw-r--r-- 1 mcc users 11K Apr 29 12:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 29 12:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 12:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.5M May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-080-LTLFireability-00
FORMULA_NAME CANConstruction-PT-080-LTLFireability-01
FORMULA_NAME CANConstruction-PT-080-LTLFireability-02
FORMULA_NAME CANConstruction-PT-080-LTLFireability-03
FORMULA_NAME CANConstruction-PT-080-LTLFireability-04
FORMULA_NAME CANConstruction-PT-080-LTLFireability-05
FORMULA_NAME CANConstruction-PT-080-LTLFireability-06
FORMULA_NAME CANConstruction-PT-080-LTLFireability-07
FORMULA_NAME CANConstruction-PT-080-LTLFireability-08
FORMULA_NAME CANConstruction-PT-080-LTLFireability-09
FORMULA_NAME CANConstruction-PT-080-LTLFireability-10
FORMULA_NAME CANConstruction-PT-080-LTLFireability-11
FORMULA_NAME CANConstruction-PT-080-LTLFireability-12
FORMULA_NAME CANConstruction-PT-080-LTLFireability-13
FORMULA_NAME CANConstruction-PT-080-LTLFireability-14
FORMULA_NAME CANConstruction-PT-080-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652657349688
Running Version 202205111006
[2022-05-15 23:29:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 23:29:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:29:11] [INFO ] Load time of PNML (sax parser for PT used): 658 ms
[2022-05-15 23:29:11] [INFO ] Transformed 13762 places.
[2022-05-15 23:29:11] [INFO ] Transformed 26240 transitions.
[2022-05-15 23:29:11] [INFO ] Parsed PT model containing 13762 places and 26240 transitions in 889 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-080-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 13762 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Discarding 6228 places :
Symmetric choice reduction at 0 with 6228 rule applications. Total rules 6228 place count 7534 transition count 13784
Iterating global reduction 0 with 6228 rules applied. Total rules applied 12456 place count 7534 transition count 13784
Applied a total of 12456 rules in 3998 ms. Remains 7534 /13762 variables (removed 6228) and now considering 13784/26240 (removed 12456) transitions.
// Phase 1: matrix 13784 rows 7534 cols
[2022-05-15 23:29:16] [INFO ] Computed 161 place invariants in 196 ms
[2022-05-15 23:29:17] [INFO ] Implicit Places using invariants in 1038 ms returned []
Implicit Place search using SMT only with invariants took 1065 ms to find 0 implicit places.
// Phase 1: matrix 13784 rows 7534 cols
[2022-05-15 23:29:17] [INFO ] Computed 161 place invariants in 143 ms
[2022-05-15 23:29:18] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7534/13762 places, 13784/26240 transitions.
Finished structural reductions, in 1 iterations. Remains : 7534/13762 places, 13784/26240 transitions.
Support contains 34 out of 7534 places after structural reductions.
[2022-05-15 23:29:18] [INFO ] Flatten gal took : 598 ms
[2022-05-15 23:29:19] [INFO ] Flatten gal took : 441 ms
[2022-05-15 23:29:20] [INFO ] Input system was already deterministic with 13784 transitions.
Support contains 33 out of 7534 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 736 ms. (steps per millisecond=13 ) properties (out of 22) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 13784 rows 7534 cols
[2022-05-15 23:29:21] [INFO ] Computed 161 place invariants in 81 ms
[2022-05-15 23:29:23] [INFO ] [Real]Absence check using 81 positive place invariants in 194 ms returned sat
[2022-05-15 23:29:24] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 89 ms returned sat
[2022-05-15 23:29:39] [INFO ] After 13698ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17
[2022-05-15 23:29:39] [INFO ] State equation strengthened by 12720 read => feed constraints.
[2022-05-15 23:29:46] [INFO ] After 6731ms SMT Verify possible using 12720 Read/Feed constraints in real domain returned unsat :0 sat :5 real:12
[2022-05-15 23:29:46] [INFO ] After 6731ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :5 real:12
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-15 23:29:46] [INFO ] After 25123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :5 real:12
[2022-05-15 23:29:48] [INFO ] [Nat]Absence check using 81 positive place invariants in 173 ms returned sat
[2022-05-15 23:29:48] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 88 ms returned sat
[2022-05-15 23:30:03] [INFO ] After 12973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-05-15 23:30:11] [INFO ] After 8109ms SMT Verify possible using 12720 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2022-05-15 23:30:11] [INFO ] After 8110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-15 23:30:11] [INFO ] After 25115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 5 properties in 361 ms.
Support contains 15 out of 7534 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 7534 transition count 13226
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 6976 transition count 13226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1117 place count 6975 transition count 13224
Iterating global reduction 2 with 1 rules applied. Total rules applied 1118 place count 6975 transition count 13224
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1278 place count 6895 transition count 13144
Free-agglomeration rule applied 140 times.
Iterating global reduction 2 with 140 rules applied. Total rules applied 1418 place count 6895 transition count 13004
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 1558 place count 6755 transition count 13004
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1560 place count 6755 transition count 13002
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1562 place count 6753 transition count 13002
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 1582 place count 6753 transition count 13002
Applied a total of 1582 rules in 10473 ms. Remains 6753 /7534 variables (removed 781) and now considering 13002/13784 (removed 782) transitions.
Finished structural reductions, in 1 iterations. Remains : 6753/7534 places, 13002/13784 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 531 ms. (steps per millisecond=18 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 13002 rows 6753 cols
[2022-05-15 23:30:23] [INFO ] Computed 161 place invariants in 89 ms
[2022-05-15 23:30:24] [INFO ] [Real]Absence check using 81 positive place invariants in 144 ms returned sat
[2022-05-15 23:30:24] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 75 ms returned sat
[2022-05-15 23:30:34] [INFO ] After 8934ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9
[2022-05-15 23:30:34] [INFO ] State equation strengthened by 12810 read => feed constraints.
[2022-05-15 23:30:40] [INFO ] After 5226ms SMT Verify possible using 12810 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-15 23:30:40] [INFO ] After 16698ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-15 23:30:41] [INFO ] [Nat]Absence check using 81 positive place invariants in 133 ms returned sat
[2022-05-15 23:30:41] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 77 ms returned sat
[2022-05-15 23:30:51] [INFO ] After 9410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-15 23:30:57] [INFO ] After 5405ms SMT Verify possible using 12810 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-15 23:31:02] [INFO ] After 11153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2134 ms.
[2022-05-15 23:31:05] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 28 ms.
Support contains 9 out of 6753 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6753/6753 places, 13002/13002 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 6749 transition count 12998
Applied a total of 8 rules in 2924 ms. Remains 6749 /6753 variables (removed 4) and now considering 12998/13002 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 6749/6753 places, 12998/13002 transitions.
Computed a total of 321 stabilizing places and 400 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 7534 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 7534 transition count 13225
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 6975 transition count 13225
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1130 place count 6963 transition count 13201
Iterating global reduction 2 with 12 rules applied. Total rules applied 1142 place count 6963 transition count 13201
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1302 place count 6883 transition count 13121
Applied a total of 1302 rules in 4628 ms. Remains 6883 /7534 variables (removed 651) and now considering 13121/13784 (removed 663) transitions.
// Phase 1: matrix 13121 rows 6883 cols
[2022-05-15 23:31:13] [INFO ] Computed 161 place invariants in 85 ms
[2022-05-15 23:31:13] [INFO ] Implicit Places using invariants in 665 ms returned []
Implicit Place search using SMT only with invariants took 671 ms to find 0 implicit places.
// Phase 1: matrix 13121 rows 6883 cols
[2022-05-15 23:31:13] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:31:22] [INFO ] Dead Transitions using invariants and state equation in 8659 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/7534 places, 13121/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 6883/7534 places, 13121/13784 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s466 1) (LT s3641 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 141 reset in 2061 ms.
Product exploration explored 100000 steps with 139 reset in 2017 ms.
Computed a total of 243 stabilizing places and 241 stable transitions
Computed a total of 243 stabilizing places and 241 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 329081 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 329081 steps, saw 318043 distinct states, run finished after 3002 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13121 rows 6883 cols
[2022-05-15 23:31:30] [INFO ] Computed 161 place invariants in 80 ms
[2022-05-15 23:31:30] [INFO ] [Real]Absence check using 81 positive place invariants in 135 ms returned sat
[2022-05-15 23:31:30] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 92 ms returned sat
[2022-05-15 23:31:38] [INFO ] After 7022ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 23:31:38] [INFO ] State equation strengthened by 12800 read => feed constraints.
[2022-05-15 23:31:39] [INFO ] After 1245ms SMT Verify possible using 12800 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:31:39] [INFO ] After 9430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:31:40] [INFO ] [Nat]Absence check using 81 positive place invariants in 135 ms returned sat
[2022-05-15 23:31:40] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 80 ms returned sat
[2022-05-15 23:31:47] [INFO ] After 6832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:31:48] [INFO ] After 1198ms SMT Verify possible using 12800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 23:31:49] [INFO ] After 1785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 393 ms.
[2022-05-15 23:31:49] [INFO ] After 9982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 390 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6883/6883 places, 13121/13121 transitions.
Applied a total of 0 rules in 1590 ms. Remains 6883 /6883 variables (removed 0) and now considering 13121/13121 (removed 0) transitions.
// Phase 1: matrix 13121 rows 6883 cols
[2022-05-15 23:31:51] [INFO ] Computed 161 place invariants in 82 ms
[2022-05-15 23:31:57] [INFO ] Implicit Places using invariants in 5572 ms returned []
Implicit Place search using SMT only with invariants took 5574 ms to find 0 implicit places.
// Phase 1: matrix 13121 rows 6883 cols
[2022-05-15 23:31:57] [INFO ] Computed 161 place invariants in 71 ms
[2022-05-15 23:32:05] [INFO ] Dead Transitions using invariants and state equation in 8697 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6883/6883 places, 13121/13121 transitions.
Computed a total of 243 stabilizing places and 241 stable transitions
Computed a total of 243 stabilizing places and 241 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 308 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 309726 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 309726 steps, saw 299400 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13121 rows 6883 cols
[2022-05-15 23:32:09] [INFO ] Computed 161 place invariants in 78 ms
[2022-05-15 23:32:10] [INFO ] [Real]Absence check using 81 positive place invariants in 128 ms returned sat
[2022-05-15 23:32:10] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 84 ms returned sat
[2022-05-15 23:32:17] [INFO ] After 6651ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 23:32:17] [INFO ] State equation strengthened by 12800 read => feed constraints.
[2022-05-15 23:32:18] [INFO ] After 1305ms SMT Verify possible using 12800 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:32:18] [INFO ] After 9007ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:32:19] [INFO ] [Nat]Absence check using 81 positive place invariants in 132 ms returned sat
[2022-05-15 23:32:19] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 82 ms returned sat
[2022-05-15 23:32:26] [INFO ] After 6862ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:32:27] [INFO ] After 1148ms SMT Verify possible using 12800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 23:32:28] [INFO ] After 1706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 378 ms.
[2022-05-15 23:32:28] [INFO ] After 9902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 478 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 138 reset in 1900 ms.
Product exploration explored 100000 steps with 138 reset in 1961 ms.
Built C files in :
/tmp/ltsmin11633647009535320091
[2022-05-15 23:32:33] [INFO ] Too many transitions (13121) to apply POR reductions. Disabling POR matrices.
[2022-05-15 23:32:33] [INFO ] Built C files in 151ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11633647009535320091
Running compilation step : cd /tmp/ltsmin11633647009535320091;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11633647009535320091;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11633647009535320091;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6883/6883 places, 13121/13121 transitions.
Applied a total of 0 rules in 1567 ms. Remains 6883 /6883 variables (removed 0) and now considering 13121/13121 (removed 0) transitions.
// Phase 1: matrix 13121 rows 6883 cols
[2022-05-15 23:32:37] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:32:43] [INFO ] Implicit Places using invariants in 5222 ms returned []
Implicit Place search using SMT only with invariants took 5233 ms to find 0 implicit places.
// Phase 1: matrix 13121 rows 6883 cols
[2022-05-15 23:32:43] [INFO ] Computed 161 place invariants in 73 ms
[2022-05-15 23:32:51] [INFO ] Dead Transitions using invariants and state equation in 8092 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6883/6883 places, 13121/13121 transitions.
Built C files in :
/tmp/ltsmin10476015666330496453
[2022-05-15 23:32:51] [INFO ] Too many transitions (13121) to apply POR reductions. Disabling POR matrices.
[2022-05-15 23:32:51] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10476015666330496453
Running compilation step : cd /tmp/ltsmin10476015666330496453;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10476015666330496453;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10476015666330496453;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 23:32:55] [INFO ] Flatten gal took : 339 ms
[2022-05-15 23:32:55] [INFO ] Flatten gal took : 346 ms
[2022-05-15 23:32:55] [INFO ] Time to serialize gal into /tmp/LTL7277621094883489118.gal : 76 ms
[2022-05-15 23:32:55] [INFO ] Time to serialize properties into /tmp/LTL11973859417202170979.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7277621094883489118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11973859417202170979.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7277621...267
Read 1 LTL properties
Checking formula 0 : !((F(G("((Node77IsInserted<1)||(Node38requestsent77<1))"))))
Formula 0 simplified : !FG"((Node77IsInserted<1)||(Node38requestsent77<1))"
Detected timeout of ITS tools.
[2022-05-15 23:33:11] [INFO ] Flatten gal took : 345 ms
[2022-05-15 23:33:11] [INFO ] Applying decomposition
[2022-05-15 23:33:11] [INFO ] Flatten gal took : 335 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1138617706516448793.txt' '-o' '/tmp/graph1138617706516448793.bin' '-w' '/tmp/graph1138617706516448793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1138617706516448793.bin' '-l' '-1' '-v' '-w' '/tmp/graph1138617706516448793.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:33:12] [INFO ] Decomposing Gal with order
[2022-05-15 23:33:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:33:15] [INFO ] Removed a total of 12633 redundant transitions.
[2022-05-15 23:33:15] [INFO ] Flatten gal took : 2865 ms
[2022-05-15 23:33:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 12480 labels/synchronizations in 1916 ms.
[2022-05-15 23:33:18] [INFO ] Time to serialize gal into /tmp/LTL6138466578170359891.gal : 52 ms
[2022-05-15 23:33:18] [INFO ] Time to serialize properties into /tmp/LTL5404792126885325444.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6138466578170359891.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5404792126885325444.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6138466...245
Read 1 LTL properties
Checking formula 0 : !((F(G("((u10.Node77IsInserted<1)||(u39.Node38requestsent77<1))"))))
Formula 0 simplified : !FG"((u10.Node77IsInserted<1)||(u39.Node38requestsent77<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8145166849379468193
[2022-05-15 23:33:33] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8145166849379468193
Running compilation step : cd /tmp/ltsmin8145166849379468193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8145166849379468193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8145166849379468193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-080-LTLFireability-00 finished in 148019 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(X(X(G(p0)))))||(X(p1)&&p1))))'
Support contains 3 out of 7534 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 7534 transition count 13225
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 6975 transition count 13225
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1129 place count 6964 transition count 13203
Iterating global reduction 2 with 11 rules applied. Total rules applied 1140 place count 6964 transition count 13203
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1300 place count 6884 transition count 13123
Applied a total of 1300 rules in 5054 ms. Remains 6884 /7534 variables (removed 650) and now considering 13123/13784 (removed 661) transitions.
// Phase 1: matrix 13123 rows 6884 cols
[2022-05-15 23:33:41] [INFO ] Computed 161 place invariants in 78 ms
[2022-05-15 23:33:42] [INFO ] Implicit Places using invariants in 665 ms returned []
Implicit Place search using SMT only with invariants took 666 ms to find 0 implicit places.
// Phase 1: matrix 13123 rows 6884 cols
[2022-05-15 23:33:42] [INFO ] Computed 161 place invariants in 125 ms
[2022-05-15 23:33:49] [INFO ] Dead Transitions using invariants and state equation in 7713 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/7534 places, 13123/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 6884/7534 places, 13123/13784 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s286 1) (LT s5825 1)), p0:(GEQ s788 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]]
Stuttering criterion allowed to conclude after 53605 steps with 73 reset in 1161 ms.
FORMULA CANConstruction-PT-080-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-01 finished in 14709 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||(X(X(F(G((F(p0) U p2)))))&&p1)))))'
Support contains 5 out of 7534 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Drop transitions removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 7534 transition count 13227
Reduce places removed 557 places and 0 transitions.
Iterating post reduction 1 with 557 rules applied. Total rules applied 1114 place count 6977 transition count 13227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1114 place count 6977 transition count 13226
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1116 place count 6976 transition count 13226
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1127 place count 6965 transition count 13204
Iterating global reduction 2 with 11 rules applied. Total rules applied 1138 place count 6965 transition count 13204
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1296 place count 6886 transition count 13125
Applied a total of 1296 rules in 5012 ms. Remains 6886 /7534 variables (removed 648) and now considering 13125/13784 (removed 659) transitions.
// Phase 1: matrix 13125 rows 6886 cols
[2022-05-15 23:33:56] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:34:00] [INFO ] Implicit Places using invariants in 4807 ms returned []
Implicit Place search using SMT only with invariants took 4808 ms to find 0 implicit places.
// Phase 1: matrix 13125 rows 6886 cols
[2022-05-15 23:34:00] [INFO ] Computed 161 place invariants in 74 ms
[2022-05-15 23:34:08] [INFO ] Dead Transitions using invariants and state equation in 7524 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6886/7534 places, 13125/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 6886/7534 places, 13125/13784 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s150 1) (GEQ s210 1)), p1:(AND (GEQ s112 1) (GEQ s2874 1)), p2:(GEQ s3675 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1098 steps with 1 reset in 61 ms.
FORMULA CANConstruction-PT-080-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-03 finished in 17649 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 2 out of 7534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 7522 transition count 13760
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 7522 transition count 13760
Applied a total of 24 rules in 3269 ms. Remains 7522 /7534 variables (removed 12) and now considering 13760/13784 (removed 24) transitions.
// Phase 1: matrix 13760 rows 7522 cols
[2022-05-15 23:34:12] [INFO ] Computed 161 place invariants in 76 ms
[2022-05-15 23:34:12] [INFO ] Implicit Places using invariants in 698 ms returned []
Implicit Place search using SMT only with invariants took 699 ms to find 0 implicit places.
// Phase 1: matrix 13760 rows 7522 cols
[2022-05-15 23:34:12] [INFO ] Computed 161 place invariants in 77 ms
[2022-05-15 23:34:20] [INFO ] Dead Transitions using invariants and state equation in 8204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7522/7534 places, 13760/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 7522/7534 places, 13760/13784 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-05 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:(AND (GEQ s370 1) (GEQ s7311 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-080-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-05 finished in 12318 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 7534 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 7534 transition count 13224
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 6974 transition count 13224
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1131 place count 6963 transition count 13202
Iterating global reduction 2 with 11 rules applied. Total rules applied 1142 place count 6963 transition count 13202
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1302 place count 6883 transition count 13122
Applied a total of 1302 rules in 4379 ms. Remains 6883 /7534 variables (removed 651) and now considering 13122/13784 (removed 662) transitions.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:34:25] [INFO ] Computed 161 place invariants in 87 ms
[2022-05-15 23:34:30] [INFO ] Implicit Places using invariants in 5382 ms returned []
Implicit Place search using SMT only with invariants took 5388 ms to find 0 implicit places.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:34:30] [INFO ] Computed 161 place invariants in 76 ms
[2022-05-15 23:34:39] [INFO ] Dead Transitions using invariants and state equation in 8477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/7534 places, 13122/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 6883/7534 places, 13122/13784 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3689 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 652 steps with 0 reset in 16 ms.
FORMULA CANConstruction-PT-080-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-06 finished in 18334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))||(F(G((X(p1)||!p0)))&&p2))))'
Support contains 4 out of 7534 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 7523 transition count 13762
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 7523 transition count 13762
Applied a total of 22 rules in 3093 ms. Remains 7523 /7534 variables (removed 11) and now considering 13762/13784 (removed 22) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2022-05-15 23:34:42] [INFO ] Computed 161 place invariants in 77 ms
[2022-05-15 23:34:48] [INFO ] Implicit Places using invariants in 6020 ms returned []
Implicit Place search using SMT only with invariants took 6021 ms to find 0 implicit places.
// Phase 1: matrix 13762 rows 7523 cols
[2022-05-15 23:34:48] [INFO ] Computed 161 place invariants in 80 ms
[2022-05-15 23:34:49] [INFO ] Dead Transitions using invariants and state equation in 791 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7534 places, 13762/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 7523/7534 places, 13762/13784 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (LT s202 1) (LT s2242 1)), p0:(OR (LT s538 1) (LT s935 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][false, false]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-080-LTLFireability-07 TRUE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-07 finished in 10059 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U X(X(!X(p1))))&&X(p0)))))'
Support contains 2 out of 7534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 7524 transition count 13764
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 7524 transition count 13764
Applied a total of 20 rules in 3168 ms. Remains 7524 /7534 variables (removed 10) and now considering 13764/13784 (removed 20) transitions.
// Phase 1: matrix 13764 rows 7524 cols
[2022-05-15 23:34:52] [INFO ] Computed 161 place invariants in 87 ms
[2022-05-15 23:34:58] [INFO ] Implicit Places using invariants in 6055 ms returned []
Implicit Place search using SMT only with invariants took 6057 ms to find 0 implicit places.
// Phase 1: matrix 13764 rows 7524 cols
[2022-05-15 23:34:58] [INFO ] Computed 161 place invariants in 81 ms
[2022-05-15 23:35:08] [INFO ] Dead Transitions using invariants and state equation in 10017 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7524/7534 places, 13764/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 7524/7534 places, 13764/13784 transitions.
Stuttering acceptance computed with spot in 486 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, p1, p1, p1, (OR (NOT p0) p1), p1]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 9}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 10}], [{ cond=(AND p0 p1), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 10}], [{ cond=p0, acceptance={0} source=8 dest: 5}, { cond=(NOT p0), acceptance={0} source=8 dest: 10}], [{ cond=p0, acceptance={0} source=9 dest: 8}, { cond=(NOT p0), acceptance={0} source=9 dest: 9}], [{ cond=(AND p0 p1), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={0} source=10 dest: 9}]], initial=2, aps=[p0:(GEQ s2750 1), p1:(LT s5116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1372 steps with 0 reset in 19 ms.
FORMULA CANConstruction-PT-080-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-08 finished in 19820 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!F((F(G(X(p0)))&&!p0)) U G(p1))))'
Support contains 3 out of 7534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 7523 transition count 13762
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 7523 transition count 13762
Applied a total of 22 rules in 3132 ms. Remains 7523 /7534 variables (removed 11) and now considering 13762/13784 (removed 22) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2022-05-15 23:35:12] [INFO ] Computed 161 place invariants in 84 ms
[2022-05-15 23:35:18] [INFO ] Implicit Places using invariants in 5687 ms returned []
Implicit Place search using SMT only with invariants took 5688 ms to find 0 implicit places.
// Phase 1: matrix 13762 rows 7523 cols
[2022-05-15 23:35:18] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:35:27] [INFO ] Dead Transitions using invariants and state equation in 9632 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7534 places, 13762/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 7523/7534 places, 13762/13784 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s160 1) (GEQ s347 1)), p0:(GEQ s4650 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25062 reset in 2974 ms.
Product exploration explored 100000 steps with 25000 reset in 2920 ms.
Computed a total of 321 stabilizing places and 400 stable transitions
Computed a total of 321 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 481 ms. Reduced automaton from 6 states, 14 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 13762 rows 7523 cols
[2022-05-15 23:35:35] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:35:36] [INFO ] [Real]Absence check using 81 positive place invariants in 161 ms returned sat
[2022-05-15 23:35:36] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 92 ms returned sat
[2022-05-15 23:35:44] [INFO ] After 8144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-15 23:35:44] [INFO ] State equation strengthened by 12720 read => feed constraints.
[2022-05-15 23:35:46] [INFO ] After 1496ms SMT Verify possible using 12720 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 23:35:46] [INFO ] After 11280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 23:35:47] [INFO ] [Nat]Absence check using 81 positive place invariants in 164 ms returned sat
[2022-05-15 23:35:47] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 102 ms returned sat
[2022-05-15 23:35:56] [INFO ] After 8790ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 23:36:00] [INFO ] After 3442ms SMT Verify possible using 12720 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 23:36:02] [INFO ] After 5598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1927 ms.
[2022-05-15 23:36:04] [INFO ] After 17845ms 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 17 ms.
Support contains 3 out of 7523 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7523/7523 places, 13762/13762 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 7523 transition count 13204
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 6965 transition count 13204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 6965 transition count 13203
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 6964 transition count 13203
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1276 place count 6885 transition count 13124
Free-agglomeration rule applied 158 times.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1434 place count 6885 transition count 12966
Reduce places removed 158 places and 0 transitions.
Iterating post reduction 2 with 158 rules applied. Total rules applied 1592 place count 6727 transition count 12966
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1593 place count 6727 transition count 12965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1594 place count 6726 transition count 12965
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1597 place count 6726 transition count 12965
Applied a total of 1597 rules in 7509 ms. Remains 6726 /7523 variables (removed 797) and now considering 12965/13762 (removed 797) transitions.
Finished structural reductions, in 1 iterations. Remains : 6726/7523 places, 12965/13762 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 81370 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81370 steps, saw 73679 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 12965 rows 6726 cols
[2022-05-15 23:36:15] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:36:16] [INFO ] [Real]Absence check using 81 positive place invariants in 134 ms returned sat
[2022-05-15 23:36:16] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 81 ms returned sat
[2022-05-15 23:36:23] [INFO ] After 6882ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-15 23:36:23] [INFO ] State equation strengthened by 12801 read => feed constraints.
[2022-05-15 23:36:25] [INFO ] After 1377ms SMT Verify possible using 12801 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 23:36:25] [INFO ] After 9696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 23:36:25] [INFO ] [Nat]Absence check using 81 positive place invariants in 132 ms returned sat
[2022-05-15 23:36:26] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 70 ms returned sat
[2022-05-15 23:36:33] [INFO ] After 7324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 23:36:36] [INFO ] After 2392ms SMT Verify possible using 12801 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 23:36:38] [INFO ] After 4437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1490 ms.
[2022-05-15 23:36:39] [INFO ] After 14492ms 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 16 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 3 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR p1 p0))))]
False Knowledge obtained : [(F (OR p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F p0), (F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 648 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
// Phase 1: matrix 13762 rows 7523 cols
[2022-05-15 23:36:40] [INFO ] Computed 161 place invariants in 78 ms
Could not prove EG (NOT p1)
Support contains 3 out of 7523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7523/7523 places, 13762/13762 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 7523 transition count 13204
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 6965 transition count 13204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 6965 transition count 13203
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 6964 transition count 13203
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1276 place count 6885 transition count 13124
Applied a total of 1276 rules in 3027 ms. Remains 6885 /7523 variables (removed 638) and now considering 13124/13762 (removed 638) transitions.
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:36:58] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:37:04] [INFO ] Implicit Places using invariants in 5388 ms returned []
Implicit Place search using SMT only with invariants took 5389 ms to find 0 implicit places.
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:37:04] [INFO ] Computed 161 place invariants in 71 ms
[2022-05-15 23:37:12] [INFO ] Dead Transitions using invariants and state equation in 8212 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/7523 places, 13124/13762 transitions.
Finished structural reductions, in 1 iterations. Remains : 6885/7523 places, 13124/13762 transitions.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (OR p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 574 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:37:13] [INFO ] Computed 161 place invariants in 83 ms
[2022-05-15 23:37:14] [INFO ] [Real]Absence check using 81 positive place invariants in 142 ms returned sat
[2022-05-15 23:37:14] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 81 ms returned sat
[2022-05-15 23:37:21] [INFO ] After 6684ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 23:37:21] [INFO ] State equation strengthened by 12799 read => feed constraints.
[2022-05-15 23:37:22] [INFO ] After 1367ms SMT Verify possible using 12799 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:37:22] [INFO ] After 9127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:37:23] [INFO ] [Nat]Absence check using 81 positive place invariants in 136 ms returned sat
[2022-05-15 23:37:23] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 77 ms returned sat
[2022-05-15 23:37:30] [INFO ] After 6691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:37:32] [INFO ] After 1771ms SMT Verify possible using 12799 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 23:37:32] [INFO ] After 2444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 399 ms.
[2022-05-15 23:37:33] [INFO ] After 10499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6885/6885 places, 13124/13124 transitions.
Free-agglomeration rule applied 158 times.
Iterating global reduction 0 with 158 rules applied. Total rules applied 158 place count 6885 transition count 12966
Reduce places removed 158 places and 0 transitions.
Iterating post reduction 0 with 158 rules applied. Total rules applied 316 place count 6727 transition count 12966
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 317 place count 6727 transition count 12965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 318 place count 6726 transition count 12965
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 321 place count 6726 transition count 12965
Applied a total of 321 rules in 5816 ms. Remains 6726 /6885 variables (removed 159) and now considering 12965/13124 (removed 159) transitions.
Finished structural reductions, in 1 iterations. Remains : 6726/6885 places, 12965/13124 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86346 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86346 steps, saw 74911 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 12965 rows 6726 cols
[2022-05-15 23:37:42] [INFO ] Computed 161 place invariants in 73 ms
[2022-05-15 23:37:43] [INFO ] [Real]Absence check using 81 positive place invariants in 133 ms returned sat
[2022-05-15 23:37:43] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 79 ms returned sat
[2022-05-15 23:37:49] [INFO ] After 6495ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 23:37:50] [INFO ] State equation strengthened by 12801 read => feed constraints.
[2022-05-15 23:37:51] [INFO ] After 1344ms SMT Verify possible using 12801 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:37:51] [INFO ] After 8890ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:37:52] [INFO ] [Nat]Absence check using 81 positive place invariants in 135 ms returned sat
[2022-05-15 23:37:52] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 73 ms returned sat
[2022-05-15 23:37:58] [INFO ] After 6369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:38:00] [INFO ] After 1457ms SMT Verify possible using 12801 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 23:38:00] [INFO ] After 2193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 397 ms.
[2022-05-15 23:38:01] [INFO ] After 9857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 6726 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6726/6726 places, 12965/12965 transitions.
Applied a total of 0 rules in 1420 ms. Remains 6726 /6726 variables (removed 0) and now considering 12965/12965 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6726/6726 places, 12965/12965 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6726/6726 places, 12965/12965 transitions.
Applied a total of 0 rules in 1412 ms. Remains 6726 /6726 variables (removed 0) and now considering 12965/12965 (removed 0) transitions.
// Phase 1: matrix 12965 rows 6726 cols
[2022-05-15 23:38:04] [INFO ] Computed 161 place invariants in 79 ms
[2022-05-15 23:38:09] [INFO ] Implicit Places using invariants in 5195 ms returned []
Implicit Place search using SMT only with invariants took 5196 ms to find 0 implicit places.
// Phase 1: matrix 12965 rows 6726 cols
[2022-05-15 23:38:09] [INFO ] Computed 161 place invariants in 69 ms
[2022-05-15 23:38:17] [INFO ] Dead Transitions using invariants and state equation in 8132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6726/6726 places, 12965/12965 transitions.
Graph (trivial) has 12641 edges and 6726 vertex of which 6398 / 6726 are part of one of the 79 SCC in 9 ms
Free SCC test removed 6319 places
Drop transitions removed 12559 transitions
Reduce isomorphic transitions removed 12559 transitions.
Graph (complete) has 888 edges and 407 vertex of which 93 are kept as prefixes of interest. Removing 314 places using SCC suffix rule.1 ms
Discarding 314 places :
Also discarding 155 output transitions
Drop transitions removed 155 transitions
Ensure Unique test removed 1 places
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 0 with 162 rules applied. Total rules applied 164 place count 92 transition count 90
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 1 with 158 rules applied. Total rules applied 322 place count 12 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 322 place count 12 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 326 place count 10 transition count 10
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 327 place count 9 transition count 9
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 9 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 329 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 330 place count 8 transition count 8
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 332 place count 7 transition count 7
Iterating global reduction 3 with 1 rules applied. Total rules applied 333 place count 7 transition count 7
Applied a total of 333 rules in 41 ms. Remains 7 /6726 variables (removed 6719) and now considering 7/12965 (removed 12958) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 7 cols
[2022-05-15 23:38:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 23:38:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:38:17] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 23:38:17] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-15 23:38:17] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-15 23:38:17] [INFO ] Flatten gal took : 1 ms
[2022-05-15 23:38:17] [INFO ] Flatten gal took : 0 ms
[2022-05-15 23:38:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6858822470752623046.gal : 1 ms
[2022-05-15 23:38:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3140161962580026508.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5377801107896771197;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6858822470752623046.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3140161962580026508.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3140161962580026508.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,18,0.010932,3308,2,12,6,49,7,0,34,30,0
Total reachable state count : 18
Verifying 1 reachability properties.
Reachability property apf6 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf6,2,0.011406,3732,2,8,6,49,7,0,39,30,0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (OR p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (OR p0 p1)), (F (AND (NOT p0) p1)), (F p0), (F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 764 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:38:18] [INFO ] Computed 161 place invariants in 79 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 33352 reset in 4296 ms.
Product exploration explored 100000 steps with 33359 reset in 4299 ms.
Built C files in :
/tmp/ltsmin14391007142172181624
[2022-05-15 23:38:42] [INFO ] Too many transitions (13124) to apply POR reductions. Disabling POR matrices.
[2022-05-15 23:38:42] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14391007142172181624
Running compilation step : cd /tmp/ltsmin14391007142172181624;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14391007142172181624;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14391007142172181624;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 13124/13124 transitions.
Applied a total of 0 rules in 1624 ms. Remains 6885 /6885 variables (removed 0) and now considering 13124/13124 (removed 0) transitions.
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:38:47] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:38:52] [INFO ] Implicit Places using invariants in 5312 ms returned []
Implicit Place search using SMT only with invariants took 5313 ms to find 0 implicit places.
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:38:52] [INFO ] Computed 161 place invariants in 70 ms
[2022-05-15 23:39:00] [INFO ] Dead Transitions using invariants and state equation in 7984 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6885/6885 places, 13124/13124 transitions.
Built C files in :
/tmp/ltsmin13039066311987734324
[2022-05-15 23:39:00] [INFO ] Too many transitions (13124) to apply POR reductions. Disabling POR matrices.
[2022-05-15 23:39:00] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13039066311987734324
Running compilation step : cd /tmp/ltsmin13039066311987734324;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13039066311987734324;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13039066311987734324;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 23:39:04] [INFO ] Flatten gal took : 807 ms
[2022-05-15 23:39:05] [INFO ] Flatten gal took : 382 ms
[2022-05-15 23:39:05] [INFO ] Time to serialize gal into /tmp/LTL17092549364269883480.gal : 49 ms
[2022-05-15 23:39:05] [INFO ] Time to serialize properties into /tmp/LTL11813039449999231903.ltl : 54 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17092549364269883480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11813039449999231903.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1709254...268
Read 1 LTL properties
Checking formula 0 : !((X((!(F((F(G(X("(Node43GiveAnswer51>=1)"))))&&("(Node43GiveAnswer51<1)"))))U(G("((Node11IsInserted>=1)&&(Node24Request>=1))")))))
Formula 0 simplified : !X(!F("(Node43GiveAnswer51<1)" & FGX"(Node43GiveAnswer51>=1)") U G"((Node11IsInserted>=1)&&(Node24Request>=1))")
Detected timeout of ITS tools.
[2022-05-15 23:39:21] [INFO ] Flatten gal took : 515 ms
[2022-05-15 23:39:21] [INFO ] Applying decomposition
[2022-05-15 23:39:21] [INFO ] Flatten gal took : 365 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8212430998503802121.txt' '-o' '/tmp/graph8212430998503802121.bin' '-w' '/tmp/graph8212430998503802121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8212430998503802121.bin' '-l' '-1' '-v' '-w' '/tmp/graph8212430998503802121.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:39:22] [INFO ] Decomposing Gal with order
[2022-05-15 23:39:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:39:25] [INFO ] Removed a total of 12628 redundant transitions.
[2022-05-15 23:39:26] [INFO ] Flatten gal took : 2537 ms
[2022-05-15 23:39:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 12636 labels/synchronizations in 2039 ms.
[2022-05-15 23:39:29] [INFO ] Time to serialize gal into /tmp/LTL11320254261430313319.gal : 40 ms
[2022-05-15 23:39:29] [INFO ] Time to serialize properties into /tmp/LTL4409668591948932396.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11320254261430313319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4409668591948932396.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1132025...246
Read 1 LTL properties
Checking formula 0 : !((X((!(F((F(G(X("(i53.u54.Node43GiveAnswer51>=1)"))))&&("(i53.u54.Node43GiveAnswer51<1)"))))U(G("((u39.Node11IsInserted>=1)&&(u26.Nod...176
Formula 0 simplified : !X(!F("(i53.u54.Node43GiveAnswer51<1)" & FGX"(i53.u54.Node43GiveAnswer51>=1)") U G"((u39.Node11IsInserted>=1)&&(u26.Node24Request>=1...159
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7500992206124154120
[2022-05-15 23:39:44] [INFO ] Built C files in 147ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7500992206124154120
Running compilation step : cd /tmp/ltsmin7500992206124154120;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7500992206124154120;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7500992206124154120;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-080-LTLFireability-10 finished in 278128 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))&&F(G(p0))&&p1)))'
Support contains 3 out of 7534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 7525 transition count 13766
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 7525 transition count 13766
Applied a total of 18 rules in 7188 ms. Remains 7525 /7534 variables (removed 9) and now considering 13766/13784 (removed 18) transitions.
// Phase 1: matrix 13766 rows 7525 cols
[2022-05-15 23:39:54] [INFO ] Computed 161 place invariants in 142 ms
[2022-05-15 23:39:55] [INFO ] Implicit Places using invariants in 1244 ms returned []
Implicit Place search using SMT only with invariants took 1245 ms to find 0 implicit places.
// Phase 1: matrix 13766 rows 7525 cols
[2022-05-15 23:39:55] [INFO ] Computed 161 place invariants in 166 ms
[2022-05-15 23:39:57] [INFO ] Dead Transitions using invariants and state equation in 1299 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7525/7534 places, 13766/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 7525/7534 places, 13766/13784 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s2339 1) (LT s1669 1)), p0:(GEQ s2426 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-080-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-11 finished in 10127 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 7534 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 7534 transition count 13226
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 6976 transition count 13226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 6976 transition count 13225
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 6975 transition count 13225
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1130 place count 6963 transition count 13201
Iterating global reduction 2 with 12 rules applied. Total rules applied 1142 place count 6963 transition count 13201
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1300 place count 6884 transition count 13122
Applied a total of 1300 rules in 7876 ms. Remains 6884 /7534 variables (removed 650) and now considering 13122/13784 (removed 662) transitions.
// Phase 1: matrix 13122 rows 6884 cols
[2022-05-15 23:40:05] [INFO ] Computed 161 place invariants in 314 ms
[2022-05-15 23:40:06] [INFO ] Implicit Places using invariants in 1343 ms returned []
Implicit Place search using SMT only with invariants took 1344 ms to find 0 implicit places.
// Phase 1: matrix 13122 rows 6884 cols
[2022-05-15 23:40:06] [INFO ] Computed 161 place invariants in 171 ms
[2022-05-15 23:40:07] [INFO ] Dead Transitions using invariants and state equation in 1255 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/7534 places, 13122/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 6884/7534 places, 13122/13784 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s442 1) (GEQ s468 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 664 steps with 0 reset in 31 ms.
FORMULA CANConstruction-PT-080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-13 finished in 10687 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 7534 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 7534 transition count 13224
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 6974 transition count 13224
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1131 place count 6963 transition count 13202
Iterating global reduction 2 with 11 rules applied. Total rules applied 1142 place count 6963 transition count 13202
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1302 place count 6883 transition count 13122
Applied a total of 1302 rules in 9727 ms. Remains 6883 /7534 variables (removed 651) and now considering 13122/13784 (removed 662) transitions.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:40:18] [INFO ] Computed 161 place invariants in 159 ms
[2022-05-15 23:40:19] [INFO ] Implicit Places using invariants in 1319 ms returned []
Implicit Place search using SMT only with invariants took 1320 ms to find 0 implicit places.
// Phase 1: matrix 13122 rows 6883 cols
[2022-05-15 23:40:19] [INFO ] Computed 161 place invariants in 141 ms
[2022-05-15 23:40:21] [INFO ] Dead Transitions using invariants and state equation in 1965 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/7534 places, 13122/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 6883/7534 places, 13122/13784 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4949 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 720 steps with 0 reset in 30 ms.
FORMULA CANConstruction-PT-080-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-14 finished in 13242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F(X(X((G(p0)||X(p1))))))&&X(F(p2))))'
Support contains 5 out of 7534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 7522 transition count 13760
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 7522 transition count 13760
Applied a total of 24 rules in 4922 ms. Remains 7522 /7534 variables (removed 12) and now considering 13760/13784 (removed 24) transitions.
// Phase 1: matrix 13760 rows 7522 cols
[2022-05-15 23:40:26] [INFO ] Computed 161 place invariants in 81 ms
[2022-05-15 23:40:27] [INFO ] Implicit Places using invariants in 1186 ms returned []
Implicit Place search using SMT only with invariants took 1187 ms to find 0 implicit places.
// Phase 1: matrix 13760 rows 7522 cols
[2022-05-15 23:40:27] [INFO ] Computed 161 place invariants in 160 ms
[2022-05-15 23:40:28] [INFO ] Dead Transitions using invariants and state equation in 1283 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7522/7534 places, 13760/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 7522/7534 places, 13760/13784 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s1042 1) (LT s1986 1)), p0:(OR (LT s1042 1) (LT s3724 1)), p1:(OR (LT s62 1) (LT s193 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]]
Product exploration explored 100000 steps with 25000 reset in 4299 ms.
Product exploration explored 100000 steps with 25000 reset in 2718 ms.
Computed a total of 321 stabilizing places and 400 stable transitions
Computed a total of 321 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 167374 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167374 steps, saw 164156 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 13760 rows 7522 cols
[2022-05-15 23:40:39] [INFO ] Computed 161 place invariants in 76 ms
[2022-05-15 23:40:40] [INFO ] [Real]Absence check using 81 positive place invariants in 140 ms returned sat
[2022-05-15 23:40:41] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 531 ms returned sat
[2022-05-15 23:40:58] [INFO ] After 17178ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-15 23:40:58] [INFO ] State equation strengthened by 12720 read => feed constraints.
[2022-05-15 23:41:00] [INFO ] After 1410ms SMT Verify possible using 12720 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 23:41:00] [INFO ] After 20535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 23:41:01] [INFO ] [Nat]Absence check using 81 positive place invariants in 140 ms returned sat
[2022-05-15 23:41:01] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 85 ms returned sat
[2022-05-15 23:41:10] [INFO ] After 9270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 23:41:13] [INFO ] After 2491ms SMT Verify possible using 12720 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 23:41:14] [INFO ] After 3907ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 987 ms.
[2022-05-15 23:41:15] [INFO ] After 15424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 6 ms.
Support contains 4 out of 7522 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7522/7522 places, 13760/13760 transitions.
Drop transitions removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 7522 transition count 13203
Reduce places removed 557 places and 0 transitions.
Iterating post reduction 1 with 557 rules applied. Total rules applied 1114 place count 6965 transition count 13203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1114 place count 6965 transition count 13202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1116 place count 6964 transition count 13202
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1274 place count 6885 transition count 13123
Free-agglomeration rule applied 160 times.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1434 place count 6885 transition count 12963
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 1594 place count 6725 transition count 12963
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1596 place count 6725 transition count 12961
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1598 place count 6723 transition count 12961
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1599 place count 6723 transition count 12961
Applied a total of 1599 rules in 7424 ms. Remains 6723 /7522 variables (removed 799) and now considering 12961/13760 (removed 799) transitions.
Finished structural reductions, in 1 iterations. Remains : 6723/7522 places, 12961/13760 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86971 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86971 steps, saw 75209 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 12961 rows 6723 cols
[2022-05-15 23:41:26] [INFO ] Computed 161 place invariants in 80 ms
[2022-05-15 23:41:27] [INFO ] [Real]Absence check using 81 positive place invariants in 138 ms returned sat
[2022-05-15 23:41:27] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 74 ms returned sat
[2022-05-15 23:41:33] [INFO ] After 6392ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 23:41:34] [INFO ] State equation strengthened by 12800 read => feed constraints.
[2022-05-15 23:41:35] [INFO ] After 1339ms SMT Verify possible using 12800 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:41:35] [INFO ] After 8797ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:41:36] [INFO ] [Nat]Absence check using 81 positive place invariants in 126 ms returned sat
[2022-05-15 23:41:36] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 74 ms returned sat
[2022-05-15 23:41:42] [INFO ] After 6427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:41:44] [INFO ] After 1661ms SMT Verify possible using 12800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 23:41:44] [INFO ] After 2269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 390 ms.
[2022-05-15 23:41:45] [INFO ] After 9979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (X (X p2))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 7522 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 7522/7522 places, 13760/13760 transitions.
Applied a total of 0 rules in 1482 ms. Remains 7522 /7522 variables (removed 0) and now considering 13760/13760 (removed 0) transitions.
// Phase 1: matrix 13760 rows 7522 cols
[2022-05-15 23:41:47] [INFO ] Computed 161 place invariants in 80 ms
[2022-05-15 23:41:52] [INFO ] Implicit Places using invariants in 5421 ms returned []
Implicit Place search using SMT only with invariants took 5422 ms to find 0 implicit places.
// Phase 1: matrix 13760 rows 7522 cols
[2022-05-15 23:41:52] [INFO ] Computed 161 place invariants in 73 ms
[2022-05-15 23:42:02] [INFO ] Dead Transitions using invariants and state equation in 9517 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7522/7522 places, 13760/13760 transitions.
Computed a total of 321 stabilizing places and 400 stable transitions
Computed a total of 321 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13760 rows 7522 cols
[2022-05-15 23:42:02] [INFO ] Computed 161 place invariants in 77 ms
[2022-05-15 23:42:03] [INFO ] [Real]Absence check using 81 positive place invariants in 137 ms returned sat
[2022-05-15 23:42:03] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 78 ms returned sat
[2022-05-15 23:42:11] [INFO ] After 7402ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 23:42:11] [INFO ] State equation strengthened by 12720 read => feed constraints.
[2022-05-15 23:42:12] [INFO ] After 1409ms SMT Verify possible using 12720 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:42:12] [INFO ] After 9931ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:42:13] [INFO ] [Nat]Absence check using 81 positive place invariants in 142 ms returned sat
[2022-05-15 23:42:13] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 81 ms returned sat
[2022-05-15 23:42:22] [INFO ] After 8380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:42:23] [INFO ] After 1624ms SMT Verify possible using 12720 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 23:42:24] [INFO ] After 2329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 444 ms.
[2022-05-15 23:42:24] [INFO ] After 12151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 7522 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7522/7522 places, 13760/13760 transitions.
Drop transitions removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 7522 transition count 13203
Reduce places removed 557 places and 0 transitions.
Iterating post reduction 1 with 557 rules applied. Total rules applied 1114 place count 6965 transition count 13203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1114 place count 6965 transition count 13202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1116 place count 6964 transition count 13202
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1274 place count 6885 transition count 13123
Free-agglomeration rule applied 160 times.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1434 place count 6885 transition count 12963
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 1594 place count 6725 transition count 12963
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1596 place count 6725 transition count 12961
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1598 place count 6723 transition count 12961
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1599 place count 6723 transition count 12961
Applied a total of 1599 rules in 7231 ms. Remains 6723 /7522 variables (removed 799) and now considering 12961/13760 (removed 799) transitions.
Finished structural reductions, in 1 iterations. Remains : 6723/7522 places, 12961/13760 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86747 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86747 steps, saw 75132 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 12961 rows 6723 cols
[2022-05-15 23:42:35] [INFO ] Computed 161 place invariants in 77 ms
[2022-05-15 23:42:36] [INFO ] [Real]Absence check using 81 positive place invariants in 133 ms returned sat
[2022-05-15 23:42:36] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 70 ms returned sat
[2022-05-15 23:42:42] [INFO ] After 6497ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 23:42:42] [INFO ] State equation strengthened by 12800 read => feed constraints.
[2022-05-15 23:42:44] [INFO ] After 1344ms SMT Verify possible using 12800 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:42:44] [INFO ] After 8848ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:42:45] [INFO ] [Nat]Absence check using 81 positive place invariants in 128 ms returned sat
[2022-05-15 23:42:45] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 69 ms returned sat
[2022-05-15 23:42:51] [INFO ] After 6720ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:42:53] [INFO ] After 1666ms SMT Verify possible using 12800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 23:42:54] [INFO ] After 2301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 396 ms.
[2022-05-15 23:42:54] [INFO ] After 10329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 2631 ms.
Product exploration explored 100000 steps with 25000 reset in 2667 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 7522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7522/7522 places, 13760/13760 transitions.
Performed 397 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 397 rules applied. Total rules applied 397 place count 7522 transition count 13760
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 83 Pre rules applied. Total rules applied 397 place count 7522 transition count 13760
Deduced a syphon composed of 480 places in 20 ms
Iterating global reduction 1 with 83 rules applied. Total rules applied 480 place count 7522 transition count 13760
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 640 place count 7362 transition count 13600
Deduced a syphon composed of 320 places in 3 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 800 place count 7362 transition count 13600
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 477 places in 2 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 957 place count 7362 transition count 13600
Discarding 314 places :
Symmetric choice reduction at 1 with 314 rule applications. Total rules 1271 place count 7048 transition count 13286
Deduced a syphon composed of 163 places in 2 ms
Iterating global reduction 1 with 314 rules applied. Total rules applied 1585 place count 7048 transition count 13286
Deduced a syphon composed of 163 places in 3 ms
Applied a total of 1585 rules in 6991 ms. Remains 7048 /7522 variables (removed 474) and now considering 13286/13760 (removed 474) transitions.
// Phase 1: matrix 13286 rows 7048 cols
[2022-05-15 23:43:07] [INFO ] Computed 161 place invariants in 79 ms
[2022-05-15 23:43:16] [INFO ] Dead Transitions using invariants and state equation in 8765 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7048/7522 places, 13286/13760 transitions.
Finished structural reductions, in 1 iterations. Remains : 7048/7522 places, 13286/13760 transitions.
Product exploration timeout after 44290 steps with 11072 reset in 10002 ms.
Product exploration timeout after 44310 steps with 11077 reset in 10002 ms.
Built C files in :
/tmp/ltsmin14329447983277446760
[2022-05-15 23:43:36] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14329447983277446760
Running compilation step : cd /tmp/ltsmin14329447983277446760;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14329447983277446760;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14329447983277446760;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 7522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7522/7522 places, 13760/13760 transitions.
Applied a total of 0 rules in 1499 ms. Remains 7522 /7522 variables (removed 0) and now considering 13760/13760 (removed 0) transitions.
// Phase 1: matrix 13760 rows 7522 cols
[2022-05-15 23:43:41] [INFO ] Computed 161 place invariants in 79 ms
[2022-05-15 23:43:46] [INFO ] Implicit Places using invariants in 5620 ms returned []
Implicit Place search using SMT only with invariants took 5631 ms to find 0 implicit places.
// Phase 1: matrix 13760 rows 7522 cols
[2022-05-15 23:43:46] [INFO ] Computed 161 place invariants in 75 ms
[2022-05-15 23:43:56] [INFO ] Dead Transitions using invariants and state equation in 9203 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7522/7522 places, 13760/13760 transitions.
Built C files in :
/tmp/ltsmin5790150375818532367
[2022-05-15 23:43:56] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5790150375818532367
Running compilation step : cd /tmp/ltsmin5790150375818532367;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5790150375818532367;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5790150375818532367;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 23:43:59] [INFO ] Flatten gal took : 425 ms
[2022-05-15 23:44:00] [INFO ] Flatten gal took : 330 ms
[2022-05-15 23:44:00] [INFO ] Time to serialize gal into /tmp/LTL17574438216961600825.gal : 88 ms
[2022-05-15 23:44:00] [INFO ] Time to serialize properties into /tmp/LTL17777111750245249922.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17574438216961600825.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17777111750245249922.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1757443...268
Read 1 LTL properties
Checking formula 0 : !(((F(F(X(X((G("((Node74IsInserted<1)||(Node31requestsent74<1))"))||(X("((Node4IsInserted<1)||(Node13Request<1))")))))))&&(X(F("((Node...201
Formula 0 simplified : !(FXX(G"((Node74IsInserted<1)||(Node31requestsent74<1))" | X"((Node4IsInserted<1)||(Node13Request<1))") & XF"((Node74IsInserted<1)||...180
Detected timeout of ITS tools.
[2022-05-15 23:44:15] [INFO ] Flatten gal took : 373 ms
[2022-05-15 23:44:15] [INFO ] Applying decomposition
[2022-05-15 23:44:16] [INFO ] Flatten gal took : 367 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16820084092178792319.txt' '-o' '/tmp/graph16820084092178792319.bin' '-w' '/tmp/graph16820084092178792319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16820084092178792319.bin' '-l' '-1' '-v' '-w' '/tmp/graph16820084092178792319.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:44:16] [INFO ] Decomposing Gal with order
[2022-05-15 23:44:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:44:19] [INFO ] Removed a total of 12923 redundant transitions.
[2022-05-15 23:44:19] [INFO ] Flatten gal took : 1947 ms
[2022-05-15 23:44:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 26152 labels/synchronizations in 2385 ms.
[2022-05-15 23:44:22] [INFO ] Time to serialize gal into /tmp/LTL4858738599444113148.gal : 251 ms
[2022-05-15 23:44:22] [INFO ] Time to serialize properties into /tmp/LTL6063737755961884152.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4858738599444113148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6063737755961884152.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4858738...245
Read 1 LTL properties
Checking formula 0 : !(((F(F(X(X((G("((i78.u296.Node74IsInserted<1)||(i32.u127.Node31requestsent74<1))"))||(X("((i4.u16.Node4IsInserted<1)||(i14.u55.Node13...251
Formula 0 simplified : !(FXX(G"((i78.u296.Node74IsInserted<1)||(i32.u127.Node31requestsent74<1))" | X"((i4.u16.Node4IsInserted<1)||(i14.u55.Node13Request<1...230
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18181245598512890321
[2022-05-15 23:44:37] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18181245598512890321
Running compilation step : cd /tmp/ltsmin18181245598512890321;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18181245598512890321;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18181245598512890321;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-080-LTLFireability-15 finished in 259258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!F((F(G(X(p0)))&&!p0)) U G(p1))))'
Found a SL insensitive property : CANConstruction-PT-080-LTLFireability-10
Stuttering acceptance computed with spot in 336 ms :[(NOT p1), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
Support contains 3 out of 7534 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 7534 transition count 13226
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 6976 transition count 13226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 6976 transition count 13225
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 6975 transition count 13225
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1129 place count 6964 transition count 13203
Iterating global reduction 2 with 11 rules applied. Total rules applied 1140 place count 6964 transition count 13203
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1298 place count 6885 transition count 13124
Applied a total of 1298 rules in 7209 ms. Remains 6885 /7534 variables (removed 649) and now considering 13124/13784 (removed 660) transitions.
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:44:48] [INFO ] Computed 161 place invariants in 141 ms
[2022-05-15 23:44:49] [INFO ] Implicit Places using invariants in 1247 ms returned []
Implicit Place search using SMT only with invariants took 1247 ms to find 0 implicit places.
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:44:50] [INFO ] Computed 161 place invariants in 183 ms
[2022-05-15 23:44:51] [INFO ] Dead Transitions using invariants and state equation in 1276 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 6885/7534 places, 13124/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 6885/7534 places, 13124/13784 transitions.
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s70 1) (GEQ s150 1)), p0:(GEQ s4012 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25048 reset in 7946 ms.
Product exploration explored 100000 steps with 25020 reset in 7825 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 955 ms. Reduced automaton from 6 states, 14 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1059 ms. (steps per millisecond=9 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:45:09] [INFO ] Computed 161 place invariants in 161 ms
[2022-05-15 23:45:13] [INFO ] [Real]Absence check using 81 positive place invariants in 783 ms returned sat
[2022-05-15 23:45:13] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 636 ms returned sat
[2022-05-15 23:45:34] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 23:45:35] [INFO ] [Nat]Absence check using 81 positive place invariants in 424 ms returned sat
[2022-05-15 23:45:36] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 184 ms returned sat
[2022-05-15 23:45:49] [INFO ] After 12716ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 23:45:49] [INFO ] State equation strengthened by 12799 read => feed constraints.
[2022-05-15 23:45:52] [INFO ] After 3262ms SMT Verify possible using 12799 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 23:45:55] [INFO ] After 6041ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1838 ms.
[2022-05-15 23:45:57] [INFO ] After 22675ms 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 18 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR p1 p0))))]
False Knowledge obtained : [(F (OR p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F p0), (F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 1340 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:45:59] [INFO ] Computed 161 place invariants in 72 ms
Could not prove EG (NOT p1)
Support contains 3 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 13124/13124 transitions.
Applied a total of 0 rules in 1679 ms. Remains 6885 /6885 variables (removed 0) and now considering 13124/13124 (removed 0) transitions.
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:46:16] [INFO ] Computed 161 place invariants in 79 ms
[2022-05-15 23:46:21] [INFO ] Implicit Places using invariants in 5404 ms returned []
Implicit Place search using SMT only with invariants took 5405 ms to find 0 implicit places.
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:46:21] [INFO ] Computed 161 place invariants in 82 ms
[2022-05-15 23:46:30] [INFO ] Dead Transitions using invariants and state equation in 8466 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6885/6885 places, 13124/13124 transitions.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (OR p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 603 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:46:31] [INFO ] Computed 161 place invariants in 78 ms
[2022-05-15 23:46:32] [INFO ] [Real]Absence check using 81 positive place invariants in 144 ms returned sat
[2022-05-15 23:46:32] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 78 ms returned sat
[2022-05-15 23:46:40] [INFO ] After 7022ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-15 23:46:40] [INFO ] State equation strengthened by 12799 read => feed constraints.
[2022-05-15 23:46:41] [INFO ] After 1332ms SMT Verify possible using 12799 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 23:46:41] [INFO ] After 9857ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 23:46:42] [INFO ] [Nat]Absence check using 81 positive place invariants in 136 ms returned sat
[2022-05-15 23:46:42] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 75 ms returned sat
[2022-05-15 23:46:50] [INFO ] After 7777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 23:46:52] [INFO ] After 2146ms SMT Verify possible using 12799 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 23:46:54] [INFO ] After 4172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1386 ms.
[2022-05-15 23:46:56] [INFO ] After 14610ms 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 31 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=10 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (OR p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (OR p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F p0), (F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 645 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:46:57] [INFO ] Computed 161 place invariants in 81 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 33289 reset in 4185 ms.
Product exploration explored 100000 steps with 33439 reset in 4207 ms.
Built C files in :
/tmp/ltsmin10017018864983568451
[2022-05-15 23:47:21] [INFO ] Too many transitions (13124) to apply POR reductions. Disabling POR matrices.
[2022-05-15 23:47:21] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10017018864983568451
Running compilation step : cd /tmp/ltsmin10017018864983568451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10017018864983568451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10017018864983568451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 13124/13124 transitions.
Applied a total of 0 rules in 1588 ms. Remains 6885 /6885 variables (removed 0) and now considering 13124/13124 (removed 0) transitions.
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:47:25] [INFO ] Computed 161 place invariants in 71 ms
[2022-05-15 23:47:31] [INFO ] Implicit Places using invariants in 5287 ms returned []
Implicit Place search using SMT only with invariants took 5299 ms to find 0 implicit places.
// Phase 1: matrix 13124 rows 6885 cols
[2022-05-15 23:47:31] [INFO ] Computed 161 place invariants in 93 ms
[2022-05-15 23:47:39] [INFO ] Dead Transitions using invariants and state equation in 8489 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6885/6885 places, 13124/13124 transitions.
Built C files in :
/tmp/ltsmin9867211960609460844
[2022-05-15 23:47:39] [INFO ] Too many transitions (13124) to apply POR reductions. Disabling POR matrices.
[2022-05-15 23:47:39] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9867211960609460844
Running compilation step : cd /tmp/ltsmin9867211960609460844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9867211960609460844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9867211960609460844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 23:47:43] [INFO ] Flatten gal took : 325 ms
[2022-05-15 23:47:43] [INFO ] Flatten gal took : 331 ms
[2022-05-15 23:47:43] [INFO ] Time to serialize gal into /tmp/LTL833340290585878927.gal : 47 ms
[2022-05-15 23:47:43] [INFO ] Time to serialize properties into /tmp/LTL11477397084726665398.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL833340290585878927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11477397084726665398.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8333402...266
Read 1 LTL properties
Checking formula 0 : !((X((!(F((F(G(X("(Node43GiveAnswer51>=1)"))))&&("(Node43GiveAnswer51<1)"))))U(G("((Node11IsInserted>=1)&&(Node24Request>=1))")))))
Formula 0 simplified : !X(!F("(Node43GiveAnswer51<1)" & FGX"(Node43GiveAnswer51>=1)") U G"((Node11IsInserted>=1)&&(Node24Request>=1))")
Detected timeout of ITS tools.
[2022-05-15 23:47:59] [INFO ] Flatten gal took : 373 ms
[2022-05-15 23:47:59] [INFO ] Applying decomposition
[2022-05-15 23:47:59] [INFO ] Flatten gal took : 693 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17238408764233599828.txt' '-o' '/tmp/graph17238408764233599828.bin' '-w' '/tmp/graph17238408764233599828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17238408764233599828.bin' '-l' '-1' '-v' '-w' '/tmp/graph17238408764233599828.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:48:00] [INFO ] Decomposing Gal with order
[2022-05-15 23:48:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:48:03] [INFO ] Removed a total of 12634 redundant transitions.
[2022-05-15 23:48:03] [INFO ] Flatten gal took : 2102 ms
[2022-05-15 23:48:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 12636 labels/synchronizations in 1870 ms.
[2022-05-15 23:48:06] [INFO ] Time to serialize gal into /tmp/LTL15550087369896489005.gal : 953 ms
[2022-05-15 23:48:06] [INFO ] Time to serialize properties into /tmp/LTL7530204922778281024.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15550087369896489005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7530204922778281024.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1555008...246
Read 1 LTL properties
Checking formula 0 : !((X((!(F((F(G(X("(i52.u82.Node43GiveAnswer51>=1)"))))&&("(i52.u82.Node43GiveAnswer51<1)"))))U(G("((u31.Node11IsInserted>=1)&&(u26.Nod...176
Formula 0 simplified : !X(!F("(i52.u82.Node43GiveAnswer51<1)" & FGX"(i52.u82.Node43GiveAnswer51>=1)") U G"((u31.Node11IsInserted>=1)&&(u26.Node24Request>=1...159
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11924911101844745954
[2022-05-15 23:48:21] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11924911101844745954
Running compilation step : cd /tmp/ltsmin11924911101844745954;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11924911101844745954;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11924911101844745954;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-080-LTLFireability-10 finished in 223658 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F(X(X((G(p0)||X(p1))))))&&X(F(p2))))'
Found a CL insensitive property : CANConstruction-PT-080-LTLFireability-15
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 7534 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 7534/7534 places, 13784/13784 transitions.
Drop transitions removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 7534 transition count 13227
Reduce places removed 557 places and 0 transitions.
Iterating post reduction 1 with 557 rules applied. Total rules applied 1114 place count 6977 transition count 13227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1114 place count 6977 transition count 13226
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1116 place count 6976 transition count 13226
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1128 place count 6964 transition count 13202
Iterating global reduction 2 with 12 rules applied. Total rules applied 1140 place count 6964 transition count 13202
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1298 place count 6885 transition count 13123
Applied a total of 1298 rules in 9444 ms. Remains 6885 /7534 variables (removed 649) and now considering 13123/13784 (removed 661) transitions.
// Phase 1: matrix 13123 rows 6885 cols
[2022-05-15 23:48:34] [INFO ] Computed 161 place invariants in 158 ms
[2022-05-15 23:48:35] [INFO ] Implicit Places using invariants in 1245 ms returned []
Implicit Place search using SMT only with invariants took 1245 ms to find 0 implicit places.
// Phase 1: matrix 13123 rows 6885 cols
[2022-05-15 23:48:35] [INFO ] Computed 161 place invariants in 74 ms
[2022-05-15 23:48:50] [INFO ] Dead Transitions using invariants and state equation in 14543 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 6885/7534 places, 13123/13784 transitions.
Finished structural reductions, in 1 iterations. Remains : 6885/7534 places, 13123/13784 transitions.
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s450 1) (LT s1349 1)), p0:(OR (LT s450 1) (LT s3087 1)), p1:(OR (LT s28 1) (LT s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 8074 ms.
Product exploration explored 100000 steps with 25000 reset in 5143 ms.
Computed a total of 241 stabilizing places and 241 stable transitions
Computed a total of 241 stabilizing places and 241 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13123 rows 6885 cols
[2022-05-15 23:49:04] [INFO ] Computed 161 place invariants in 73 ms
[2022-05-15 23:49:04] [INFO ] [Real]Absence check using 81 positive place invariants in 132 ms returned sat
[2022-05-15 23:49:04] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 69 ms returned sat
[2022-05-15 23:49:11] [INFO ] After 6479ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 23:49:11] [INFO ] State equation strengthened by 12799 read => feed constraints.
[2022-05-15 23:49:13] [INFO ] After 1366ms SMT Verify possible using 12799 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:49:13] [INFO ] After 8826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:49:13] [INFO ] [Nat]Absence check using 81 positive place invariants in 131 ms returned sat
[2022-05-15 23:49:13] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 68 ms returned sat
[2022-05-15 23:49:20] [INFO ] After 6295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:49:21] [INFO ] After 1285ms SMT Verify possible using 12799 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 23:49:22] [INFO ] After 1941ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 413 ms.
[2022-05-15 23:49:22] [INFO ] After 9512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (X (X p2))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 738 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 6885 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 6885/6885 places, 13123/13123 transitions.
Applied a total of 0 rules in 1323 ms. Remains 6885 /6885 variables (removed 0) and now considering 13123/13123 (removed 0) transitions.
// Phase 1: matrix 13123 rows 6885 cols
[2022-05-15 23:49:24] [INFO ] Computed 161 place invariants in 74 ms
[2022-05-15 23:49:30] [INFO ] Implicit Places using invariants in 5294 ms returned []
Implicit Place search using SMT only with invariants took 5295 ms to find 0 implicit places.
// Phase 1: matrix 13123 rows 6885 cols
[2022-05-15 23:49:30] [INFO ] Computed 161 place invariants in 74 ms
[2022-05-15 23:49:38] [INFO ] Dead Transitions using invariants and state equation in 8187 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6885/6885 places, 13123/13123 transitions.
Computed a total of 241 stabilizing places and 241 stable transitions
Computed a total of 241 stabilizing places and 241 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13123 rows 6885 cols
[2022-05-15 23:49:38] [INFO ] Computed 161 place invariants in 89 ms
[2022-05-15 23:49:39] [INFO ] [Real]Absence check using 81 positive place invariants in 134 ms returned sat
[2022-05-15 23:49:39] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 69 ms returned sat
[2022-05-15 23:49:46] [INFO ] After 6822ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 23:49:46] [INFO ] State equation strengthened by 12799 read => feed constraints.
[2022-05-15 23:49:48] [INFO ] After 1401ms SMT Verify possible using 12799 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:49:48] [INFO ] After 9268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:49:48] [INFO ] [Nat]Absence check using 81 positive place invariants in 140 ms returned sat
[2022-05-15 23:49:49] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 75 ms returned sat
[2022-05-15 23:49:57] [INFO ] After 8114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:49:58] [INFO ] After 1350ms SMT Verify possible using 12799 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 23:49:59] [INFO ] After 2053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 454 ms.
[2022-05-15 23:49:59] [INFO ] After 11577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 3768 ms.
Product exploration explored 100000 steps with 25000 reset in 3770 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 13123/13123 transitions.
Applied a total of 0 rules in 1615 ms. Remains 6885 /6885 variables (removed 0) and now considering 13123/13123 (removed 0) transitions.
// Phase 1: matrix 13123 rows 6885 cols
[2022-05-15 23:50:09] [INFO ] Computed 161 place invariants in 78 ms
[2022-05-15 23:50:18] [INFO ] Dead Transitions using invariants and state equation in 8591 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6885/6885 places, 13123/13123 transitions.
Product exploration timeout after 43600 steps with 10900 reset in 10002 ms.
Product exploration timeout after 44120 steps with 11030 reset in 10002 ms.
Built C files in :
/tmp/ltsmin10906125635768390624
[2022-05-15 23:50:38] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10906125635768390624
Running compilation step : cd /tmp/ltsmin10906125635768390624;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10906125635768390624;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10906125635768390624;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 6885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6885/6885 places, 13123/13123 transitions.
Applied a total of 0 rules in 1334 ms. Remains 6885 /6885 variables (removed 0) and now considering 13123/13123 (removed 0) transitions.
// Phase 1: matrix 13123 rows 6885 cols
[2022-05-15 23:50:42] [INFO ] Computed 161 place invariants in 74 ms
[2022-05-15 23:50:48] [INFO ] Implicit Places using invariants in 5366 ms returned []
Implicit Place search using SMT only with invariants took 5380 ms to find 0 implicit places.
// Phase 1: matrix 13123 rows 6885 cols
[2022-05-15 23:50:48] [INFO ] Computed 161 place invariants in 74 ms
[2022-05-15 23:50:56] [INFO ] Dead Transitions using invariants and state equation in 8299 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6885/6885 places, 13123/13123 transitions.
Built C files in :
/tmp/ltsmin5755873899198794604
[2022-05-15 23:50:56] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5755873899198794604
Running compilation step : cd /tmp/ltsmin5755873899198794604;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5755873899198794604;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5755873899198794604;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 23:51:00] [INFO ] Flatten gal took : 457 ms
[2022-05-15 23:51:00] [INFO ] Flatten gal took : 429 ms
[2022-05-15 23:51:00] [INFO ] Time to serialize gal into /tmp/LTL5921080338497540779.gal : 44 ms
[2022-05-15 23:51:00] [INFO ] Time to serialize properties into /tmp/LTL16699577563063585136.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5921080338497540779.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16699577563063585136.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5921080...267
Read 1 LTL properties
Checking formula 0 : !(((F(F(X(X((G("((Node74IsInserted<1)||(Node31requestsent74<1))"))||(X("((Node4IsInserted<1)||(Node13Request<1))")))))))&&(X(F("((Node...201
Formula 0 simplified : !(FXX(G"((Node74IsInserted<1)||(Node31requestsent74<1))" | X"((Node4IsInserted<1)||(Node13Request<1))") & XF"((Node74IsInserted<1)||...180
Detected timeout of ITS tools.
[2022-05-15 23:51:16] [INFO ] Flatten gal took : 341 ms
[2022-05-15 23:51:16] [INFO ] Applying decomposition
[2022-05-15 23:51:16] [INFO ] Flatten gal took : 328 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9693003745974815814.txt' '-o' '/tmp/graph9693003745974815814.bin' '-w' '/tmp/graph9693003745974815814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9693003745974815814.bin' '-l' '-1' '-v' '-w' '/tmp/graph9693003745974815814.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:51:17] [INFO ] Decomposing Gal with order
[2022-05-15 23:51:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:51:19] [INFO ] Removed a total of 12637 redundant transitions.
[2022-05-15 23:51:19] [INFO ] Flatten gal took : 1915 ms
[2022-05-15 23:51:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 12482 labels/synchronizations in 1808 ms.
[2022-05-15 23:51:21] [INFO ] Time to serialize gal into /tmp/LTL769790402049849826.gal : 60 ms
[2022-05-15 23:51:21] [INFO ] Time to serialize properties into /tmp/LTL17394506525981033063.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL769790402049849826.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17394506525981033063.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7697904...245
Read 1 LTL properties
Checking formula 0 : !(((F(F(X(X((G("((u41.Node74IsInserted<1)||(u33.Node31requestsent74<1))"))||(X("((u55.Node4IsInserted<1)||(u14.Node13Request<1))")))))...225
Formula 0 simplified : !(FXX(G"((u41.Node74IsInserted<1)||(u33.Node31requestsent74<1))" | X"((u55.Node4IsInserted<1)||(u14.Node13Request<1))") & XF"((u41.N...204
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10307171271733868161
[2022-05-15 23:51:36] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10307171271733868161
Running compilation step : cd /tmp/ltsmin10307171271733868161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10307171271733868161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10307171271733868161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-080-LTLFireability-15 finished in 195210 ms.
[2022-05-15 23:51:40] [INFO ] Flatten gal took : 437 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13607053308521191700
[2022-05-15 23:51:40] [INFO ] Too many transitions (13784) to apply POR reductions. Disabling POR matrices.
[2022-05-15 23:51:40] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13607053308521191700
Running compilation step : cd /tmp/ltsmin13607053308521191700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 23:51:40] [INFO ] Applying decomposition
[2022-05-15 23:51:41] [INFO ] Flatten gal took : 526 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4839774797961679676.txt' '-o' '/tmp/graph4839774797961679676.bin' '-w' '/tmp/graph4839774797961679676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4839774797961679676.bin' '-l' '-1' '-v' '-w' '/tmp/graph4839774797961679676.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:51:42] [INFO ] Decomposing Gal with order
[2022-05-15 23:51:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:51:45] [INFO ] Removed a total of 12927 redundant transitions.
[2022-05-15 23:51:45] [INFO ] Flatten gal took : 2570 ms
[2022-05-15 23:51:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 26596 labels/synchronizations in 2569 ms.
[2022-05-15 23:51:48] [INFO ] Time to serialize gal into /tmp/LTLFireability17079938633058966493.gal : 114 ms
[2022-05-15 23:51:48] [INFO ] Time to serialize properties into /tmp/LTLFireability5583590363762863337.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17079938633058966493.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5583590363762863337.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((F(G("((i77.u312.Node77IsInserted<1)||(i42.u155.Node38requestsent77<1))"))))
Formula 0 simplified : !FG"((i77.u312.Node77IsInserted<1)||(i42.u155.Node38requestsent77<1))"
Compilation finished in 130927 ms.
Running link step : cd /tmp/ltsmin13607053308521191700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 113 ms.
Running LTSmin : cd /tmp/ltsmin13607053308521191700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin13607053308521191700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13607053308521191700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((!<>((<>([](X((LTLAPp1==true))))&&!(LTLAPp1==true))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
LTSmin run took 33571 ms.
FORMULA CANConstruction-PT-080-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13607053308521191700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(<>(X(X(([]((LTLAPp3==true))||X((LTLAPp4==true)))))))&&X(<>((LTLAPp5==true))))' '--buchi-type=spotba'
LTSmin run took 10509 ms.
FORMULA CANConstruction-PT-080-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin13607053308521191700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 00:19:28] [INFO ] Flatten gal took : 2638 ms
[2022-05-16 00:19:28] [INFO ] Time to serialize gal into /tmp/LTLFireability1757207652879260888.gal : 234 ms
[2022-05-16 00:19:28] [INFO ] Time to serialize properties into /tmp/LTLFireability8320874981061726259.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1757207652879260888.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8320874981061726259.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((F(G("((Node77IsInserted<1)||(Node38requestsent77<1))"))))
Formula 0 simplified : !FG"((Node77IsInserted<1)||(Node38requestsent77<1))"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-080"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-080, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918700548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-080.tgz
mv CANConstruction-PT-080 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 ;