About the Execution of ITS-Tools for FunctionPointer-PT-c008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14631.096 | 3600000.00 | 13165549.00 | 2208.60 | TTFTTFFFF?FFTTFF | 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.r312-tall-165472282300492.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 FunctionPointer-PT-c008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282300492
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Jun 7 17:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Jun 7 17:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Jun 7 17:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 4.2M Jun 6 12:11 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 FunctionPointer-PT-c008-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1654857970768
Running Version 202205111006
[2022-06-10 10:46:12] [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-06-10 10:46:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 10:46:12] [INFO ] Load time of PNML (sax parser for PT used): 504 ms
[2022-06-10 10:46:12] [INFO ] Transformed 2826 places.
[2022-06-10 10:46:12] [INFO ] Transformed 8960 transitions.
[2022-06-10 10:46:12] [INFO ] Parsed PT model containing 2826 places and 8960 transitions in 666 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1198 places in 39 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 296 places :
Symmetric choice reduction at 1 with 296 rule applications. Total rules 313 place count 1315 transition count 3746
Iterating global reduction 1 with 296 rules applied. Total rules applied 609 place count 1315 transition count 3746
Ensure Unique test removed 402 transitions
Reduce isomorphic transitions removed 402 transitions.
Iterating post reduction 1 with 402 rules applied. Total rules applied 1011 place count 1315 transition count 3344
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1163 place count 1163 transition count 3040
Iterating global reduction 2 with 152 rules applied. Total rules applied 1315 place count 1163 transition count 3040
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 1399 place count 1163 transition count 2956
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1413 place count 1149 transition count 2928
Iterating global reduction 3 with 14 rules applied. Total rules applied 1427 place count 1149 transition count 2928
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1441 place count 1135 transition count 2900
Iterating global reduction 3 with 14 rules applied. Total rules applied 1455 place count 1135 transition count 2900
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1469 place count 1121 transition count 2872
Iterating global reduction 3 with 14 rules applied. Total rules applied 1483 place count 1121 transition count 2872
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1497 place count 1107 transition count 2844
Iterating global reduction 3 with 14 rules applied. Total rules applied 1511 place count 1107 transition count 2844
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1525 place count 1093 transition count 2816
Iterating global reduction 3 with 14 rules applied. Total rules applied 1539 place count 1093 transition count 2816
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1553 place count 1079 transition count 2788
Iterating global reduction 3 with 14 rules applied. Total rules applied 1567 place count 1079 transition count 2788
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1580 place count 1066 transition count 2762
Iterating global reduction 3 with 13 rules applied. Total rules applied 1593 place count 1066 transition count 2762
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1647 place count 1012 transition count 2558
Iterating global reduction 3 with 54 rules applied. Total rules applied 1701 place count 1012 transition count 2558
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1755 place count 958 transition count 2342
Iterating global reduction 3 with 54 rules applied. Total rules applied 1809 place count 958 transition count 2342
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1863 place count 904 transition count 2222
Iterating global reduction 3 with 54 rules applied. Total rules applied 1917 place count 904 transition count 2222
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1970 place count 851 transition count 2116
Iterating global reduction 3 with 53 rules applied. Total rules applied 2023 place count 851 transition count 2116
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2075 place count 799 transition count 2012
Iterating global reduction 3 with 52 rules applied. Total rules applied 2127 place count 799 transition count 2012
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2179 place count 747 transition count 1908
Iterating global reduction 3 with 52 rules applied. Total rules applied 2231 place count 747 transition count 1908
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2283 place count 695 transition count 1804
Iterating global reduction 3 with 52 rules applied. Total rules applied 2335 place count 695 transition count 1804
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2341 place count 689 transition count 1792
Iterating global reduction 3 with 6 rules applied. Total rules applied 2347 place count 689 transition count 1792
Applied a total of 2347 rules in 1371 ms. Remains 689 /1628 variables (removed 939) and now considering 1792/5962 (removed 4170) transitions.
[2022-06-10 10:46:14] [INFO ] Flow matrix only has 1203 transitions (discarded 589 similar events)
// Phase 1: matrix 1203 rows 689 cols
[2022-06-10 10:46:14] [INFO ] Computed 2 place invariants in 34 ms
[2022-06-10 10:46:15] [INFO ] Implicit Places using invariants in 728 ms returned []
[2022-06-10 10:46:15] [INFO ] Flow matrix only has 1203 transitions (discarded 589 similar events)
// Phase 1: matrix 1203 rows 689 cols
[2022-06-10 10:46:15] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:46:15] [INFO ] State equation strengthened by 294 read => feed constraints.
[2022-06-10 10:46:17] [INFO ] Implicit Places using invariants and state equation in 2267 ms returned []
Implicit Place search using SMT with State Equation took 3028 ms to find 0 implicit places.
[2022-06-10 10:46:17] [INFO ] Flow matrix only has 1203 transitions (discarded 589 similar events)
// Phase 1: matrix 1203 rows 689 cols
[2022-06-10 10:46:17] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 10:46:17] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 689/1628 places, 1792/5962 transitions.
Finished structural reductions, in 1 iterations. Remains : 689/1628 places, 1792/5962 transitions.
Support contains 15 out of 689 places after structural reductions.
[2022-06-10 10:46:18] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-06-10 10:46:18] [INFO ] Flatten gal took : 143 ms
FORMULA FunctionPointer-PT-c008-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-10 10:46:18] [INFO ] Flatten gal took : 101 ms
[2022-06-10 10:46:18] [INFO ] Input system was already deterministic with 1792 transitions.
Support contains 14 out of 689 places (down from 15) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-06-10 10:46:19] [INFO ] Flow matrix only has 1203 transitions (discarded 589 similar events)
// Phase 1: matrix 1203 rows 689 cols
[2022-06-10 10:46:19] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 10:46:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 10:46:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 9 ms returned sat
[2022-06-10 10:46:20] [INFO ] After 881ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-10 10:46:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 10:46:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:46:22] [INFO ] After 1355ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2022-06-10 10:46:22] [INFO ] State equation strengthened by 294 read => feed constraints.
[2022-06-10 10:46:23] [INFO ] After 1159ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :1 sat :10
[2022-06-10 10:46:23] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 4 ms to minimize.
[2022-06-10 10:46:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2022-06-10 10:46:24] [INFO ] After 2483ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 698 ms.
[2022-06-10 10:46:25] [INFO ] After 4925ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 58 ms.
Support contains 12 out of 689 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 689/689 places, 1792/1792 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 686 transition count 1786
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 686 transition count 1786
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 686 transition count 1784
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 683 transition count 1776
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 683 transition count 1776
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 680 transition count 1766
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 680 transition count 1766
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 677 transition count 1756
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 677 transition count 1756
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 674 transition count 1748
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 674 transition count 1748
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 671 transition count 1742
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 671 transition count 1742
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 668 transition count 1736
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 668 transition count 1736
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 665 transition count 1730
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 665 transition count 1730
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 663 transition count 1726
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 663 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 662 transition count 1724
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 662 transition count 1724
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 662 transition count 1710
Applied a total of 70 rules in 519 ms. Remains 662 /689 variables (removed 27) and now considering 1710/1792 (removed 82) transitions.
Finished structural reductions, in 1 iterations. Remains : 662/689 places, 1710/1792 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) 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 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 7) 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 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2022-06-10 10:46:26] [INFO ] Flow matrix only has 1150 transitions (discarded 560 similar events)
// Phase 1: matrix 1150 rows 662 cols
[2022-06-10 10:46:26] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 10:46:26] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 10:46:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-10 10:46:27] [INFO ] After 1036ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2022-06-10 10:46:27] [INFO ] State equation strengthened by 285 read => feed constraints.
[2022-06-10 10:46:27] [INFO ] After 183ms SMT Verify possible using 285 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-10 10:46:27] [INFO ] After 1451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-10 10:46:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:46:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:46:29] [INFO ] After 1165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-06-10 10:46:30] [INFO ] After 865ms SMT Verify possible using 285 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-06-10 10:46:30] [INFO ] After 1698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 609 ms.
[2022-06-10 10:46:31] [INFO ] After 3684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 20 ms.
Support contains 10 out of 662 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 662/662 places, 1710/1710 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 661 transition count 1708
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 661 transition count 1708
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 660 transition count 1706
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 660 transition count 1706
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 659 transition count 1704
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 659 transition count 1704
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 658 transition count 1702
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 658 transition count 1702
Applied a total of 8 rules in 179 ms. Remains 658 /662 variables (removed 4) and now considering 1702/1710 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 658/662 places, 1702/1710 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) 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 7) 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 6) 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 6) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2022-06-10 10:46:31] [INFO ] Flow matrix only has 1143 transitions (discarded 559 similar events)
// Phase 1: matrix 1143 rows 658 cols
[2022-06-10 10:46:31] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 10:46:32] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:46:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 8 ms returned sat
[2022-06-10 10:46:32] [INFO ] After 866ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-10 10:46:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:46:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:46:33] [INFO ] After 782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-10 10:46:33] [INFO ] State equation strengthened by 282 read => feed constraints.
[2022-06-10 10:46:34] [INFO ] After 599ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-10 10:46:34] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 1 ms to minimize.
[2022-06-10 10:46:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2022-06-10 10:46:35] [INFO ] After 1364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 381 ms.
[2022-06-10 10:46:35] [INFO ] After 2743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 7 ms.
Support contains 8 out of 658 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 658/658 places, 1702/1702 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 656 transition count 1698
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 656 transition count 1698
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 654 transition count 1694
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 654 transition count 1694
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 652 transition count 1686
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 652 transition count 1686
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 650 transition count 1682
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 650 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 648 transition count 1678
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 648 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 646 transition count 1674
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 646 transition count 1674
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 644 transition count 1670
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 644 transition count 1670
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 642 transition count 1666
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 642 transition count 1666
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 640 transition count 1662
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 640 transition count 1662
Applied a total of 36 rules in 263 ms. Remains 640 /658 variables (removed 18) and now considering 1662/1702 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 640/658 places, 1662/1702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 171651 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171651 steps, saw 111431 distinct states, run finished after 3003 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 5 properties.
[2022-06-10 10:46:39] [INFO ] Flow matrix only has 1115 transitions (discarded 547 similar events)
// Phase 1: matrix 1115 rows 640 cols
[2022-06-10 10:46:39] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 10:46:39] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 10:46:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:46:40] [INFO ] After 1038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-10 10:46:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:46:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:46:41] [INFO ] After 780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-10 10:46:41] [INFO ] State equation strengthened by 276 read => feed constraints.
[2022-06-10 10:46:41] [INFO ] After 668ms SMT Verify possible using 276 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-10 10:46:42] [INFO ] Deduced a trap composed of 135 places in 152 ms of which 0 ms to minimize.
[2022-06-10 10:46:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2022-06-10 10:46:42] [INFO ] After 1471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 349 ms.
[2022-06-10 10:46:43] [INFO ] After 2781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 13 ms.
Support contains 8 out of 640 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 640/640 places, 1662/1662 transitions.
Applied a total of 0 rules in 85 ms. Remains 640 /640 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 640/640 places, 1662/1662 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 640/640 places, 1662/1662 transitions.
Applied a total of 0 rules in 81 ms. Remains 640 /640 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2022-06-10 10:46:43] [INFO ] Flow matrix only has 1115 transitions (discarded 547 similar events)
// Phase 1: matrix 1115 rows 640 cols
[2022-06-10 10:46:43] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 10:46:43] [INFO ] Implicit Places using invariants in 319 ms returned []
[2022-06-10 10:46:43] [INFO ] Flow matrix only has 1115 transitions (discarded 547 similar events)
// Phase 1: matrix 1115 rows 640 cols
[2022-06-10 10:46:43] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 10:46:43] [INFO ] State equation strengthened by 276 read => feed constraints.
[2022-06-10 10:46:45] [INFO ] Implicit Places using invariants and state equation in 1787 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
[2022-06-10 10:46:45] [INFO ] Redundant transitions in 105 ms returned []
[2022-06-10 10:46:45] [INFO ] Flow matrix only has 1115 transitions (discarded 547 similar events)
// Phase 1: matrix 1115 rows 640 cols
[2022-06-10 10:46:45] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 10:46:46] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 640/640 places, 1662/1662 transitions.
Graph (trivial) has 967 edges and 640 vertex of which 189 / 640 are part of one of the 63 SCC in 4 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 421 transitions
Reduce isomorphic transitions removed 736 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 514 transition count 915
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 503 transition count 915
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 82 Pre rules applied. Total rules applied 23 place count 503 transition count 833
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 187 place count 421 transition count 833
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 249 place count 359 transition count 771
Iterating global reduction 2 with 62 rules applied. Total rules applied 311 place count 359 transition count 771
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 435 place count 359 transition count 647
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 693 place count 230 transition count 518
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 757 place count 166 transition count 390
Iterating global reduction 3 with 64 rules applied. Total rules applied 821 place count 166 transition count 390
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 824 place count 166 transition count 387
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 887 place count 103 transition count 261
Iterating global reduction 4 with 63 rules applied. Total rules applied 950 place count 103 transition count 261
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1013 place count 40 transition count 135
Iterating global reduction 4 with 63 rules applied. Total rules applied 1076 place count 40 transition count 135
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1139 place count 40 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1139 place count 40 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1141 place count 39 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1143 place count 38 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1147 place count 36 transition count 70
Applied a total of 1147 rules in 69 ms. Remains 36 /640 variables (removed 604) and now considering 70/1662 (removed 1592) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 70 rows 36 cols
[2022-06-10 10:46:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 10:46:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 10:46:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:46:46] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2022-06-10 10:46:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 10:46:46] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-10 10:46:46] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-10 10:46:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 10:46:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:46:46] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-10 10:46:46] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-10 10:46:46] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-10 10:46:46] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-06-10 10:46:46] [INFO ] Flatten gal took : 10 ms
[2022-06-10 10:46:46] [INFO ] Flatten gal took : 4 ms
[2022-06-10 10:46:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5766995454266046690.gal : 2 ms
[2022-06-10 10:46:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17891071036533489325.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8638886523005409206;'/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/ReachabilityCardinality5766995454266046690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17891071036533489325.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality17891071036533489325.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :17 after 270
Reachability property AtomicPropp3 is true.
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :270 after 67254
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :67254 after 334386
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :334386 after 3.00623e+06
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :3.00623e+06 after 2.75385e+07
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.75385e+07 after 5.89862e+08
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :5.89862e+08 after 2.00476e+10
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.00476e+10 after 8.61985e+11
Detected timeout of ITS tools.
[2022-06-10 10:47:01] [INFO ] Flatten gal took : 6 ms
[2022-06-10 10:47:01] [INFO ] Applying decomposition
[2022-06-10 10:47:01] [INFO ] Flatten gal took : 3 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/graph16612221019171067698.txt' '-o' '/tmp/graph16612221019171067698.bin' '-w' '/tmp/graph16612221019171067698.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16612221019171067698.bin' '-l' '-1' '-v' '-w' '/tmp/graph16612221019171067698.weights' '-q' '0' '-e' '0.001'
[2022-06-10 10:47:01] [INFO ] Decomposing Gal with order
[2022-06-10 10:47:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 10:47:01] [INFO ] Removed a total of 87 redundant transitions.
[2022-06-10 10:47:01] [INFO ] Flatten gal took : 37 ms
[2022-06-10 10:47:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2022-06-10 10:47:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3250286904189414874.gal : 3 ms
[2022-06-10 10:47:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13251994412696224528.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8638886523005409206;'/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/ReachabilityCardinality3250286904189414874.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13251994412696224528.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality13251994412696224528.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :17 after 549
Reachability property AtomicPropp1 is true.
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :549 after 132651
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :132651 after 624461
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :624461 after 3.57734e+06
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3.57734e+06 after 3.00864e+07
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3.00864e+07 after 2.63481e+08
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2.63481e+08 after 2.06417e+09
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2.06417e+09 after 1.84791e+10
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.84791e+10 after 1.87876e+11
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7360837958296317806
[2022-06-10 10:47:16] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7360837958296317806
Running compilation step : cd /tmp/ltsmin7360837958296317806;'/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'
Compilation finished in 230 ms.
Running link step : cd /tmp/ltsmin7360837958296317806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7360837958296317806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp2==true'
LTSmin run took 1505 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin7360837958296317806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp6==true'
LTSmin run took 76 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin7360837958296317806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp8==true'
LTSmin run took 69 ms.
Found Violation
FORMULA FunctionPointer-PT-c008-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 689 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 689/689 places, 1792/1792 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 679 transition count 1770
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 679 transition count 1770
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 679 transition count 1768
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 669 transition count 1744
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 669 transition count 1744
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 659 transition count 1712
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 659 transition count 1712
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 71 place count 650 transition count 1682
Iterating global reduction 1 with 9 rules applied. Total rules applied 80 place count 650 transition count 1682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 88 place count 642 transition count 1664
Iterating global reduction 1 with 8 rules applied. Total rules applied 96 place count 642 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 634 transition count 1648
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 634 transition count 1648
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 120 place count 626 transition count 1632
Iterating global reduction 1 with 8 rules applied. Total rules applied 128 place count 626 transition count 1632
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 619 transition count 1618
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 619 transition count 1618
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 148 place count 613 transition count 1606
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 612 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 612 transition count 1604
Applied a total of 156 rules in 301 ms. Remains 612 /689 variables (removed 77) and now considering 1604/1792 (removed 188) transitions.
[2022-06-10 10:47:18] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 10:47:18] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 10:47:19] [INFO ] Implicit Places using invariants in 357 ms returned []
[2022-06-10 10:47:19] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 10:47:19] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:47:19] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 10:47:21] [INFO ] Implicit Places using invariants and state equation in 1792 ms returned []
Implicit Place search using SMT with State Equation took 2154 ms to find 0 implicit places.
[2022-06-10 10:47:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2022-06-10 10:47:21] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:47:21] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/689 places, 1604/1792 transitions.
Finished structural reductions, in 1 iterations. Remains : 612/689 places, 1604/1792 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s531 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]]
Product exploration explored 100000 steps with 50000 reset in 997 ms.
Product exploration explored 100000 steps with 50000 reset in 901 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FunctionPointer-PT-c008-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLFireability-04 finished in 5239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||G(p1))))'
Support contains 3 out of 689 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 689/689 places, 1792/1792 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 679 transition count 1768
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 679 transition count 1768
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 679 transition count 1766
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 669 transition count 1740
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 669 transition count 1740
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 659 transition count 1708
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 659 transition count 1708
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 72 place count 649 transition count 1676
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 649 transition count 1676
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 91 place count 640 transition count 1656
Iterating global reduction 1 with 9 rules applied. Total rules applied 100 place count 640 transition count 1656
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 109 place count 631 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 118 place count 631 transition count 1638
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 127 place count 622 transition count 1620
Iterating global reduction 1 with 9 rules applied. Total rules applied 136 place count 622 transition count 1620
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 143 place count 615 transition count 1606
Iterating global reduction 1 with 7 rules applied. Total rules applied 150 place count 615 transition count 1606
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 156 place count 609 transition count 1594
Iterating global reduction 1 with 6 rules applied. Total rules applied 162 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 608 transition count 1592
Applied a total of 164 rules in 208 ms. Remains 608 /689 variables (removed 81) and now considering 1592/1792 (removed 200) transitions.
[2022-06-10 10:47:24] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:47:24] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 10:47:24] [INFO ] Implicit Places using invariants in 360 ms returned []
[2022-06-10 10:47:24] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:47:24] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:47:24] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:47:26] [INFO ] Implicit Places using invariants and state equation in 1719 ms returned []
Implicit Place search using SMT with State Equation took 2084 ms to find 0 implicit places.
[2022-06-10 10:47:26] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:47:26] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 10:47:26] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/689 places, 1592/1792 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/689 places, 1592/1792 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (LT s0 1) (LT s522 1)), p1:(AND (GEQ s0 1) (GEQ s341 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 418 ms.
Product exploration explored 100000 steps with 0 reset in 615 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 6 states, 12 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 476031 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 476031 steps, saw 308975 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 10:47:31] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:47:31] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 10:47:31] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:47:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:47:31] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:47:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:47:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:47:32] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:47:32] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:47:32] [INFO ] After 136ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:47:32] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 0 ms to minimize.
[2022-06-10 10:47:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2022-06-10 10:47:32] [INFO ] After 443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-06-10 10:47:32] [INFO ] After 917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 608/608 places, 1592/1592 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 608 transition count 1590
Applied a total of 2 rules in 209 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1592 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1592 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 488967 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 488967 steps, saw 317369 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 10:47:36] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:47:36] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 10:47:36] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 10:47:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:47:36] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:47:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:47:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:47:36] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:47:36] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:47:36] [INFO ] After 139ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:47:37] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 1 ms to minimize.
[2022-06-10 10:47:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2022-06-10 10:47:37] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-06-10 10:47:37] [INFO ] After 904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 608/608 places, 1590/1590 transitions.
Applied a total of 0 rules in 78 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1590 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1590 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 608/608 places, 1590/1590 transitions.
Applied a total of 0 rules in 84 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1590 (removed 0) transitions.
[2022-06-10 10:47:37] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:47:37] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 10:47:37] [INFO ] Implicit Places using invariants in 332 ms returned []
[2022-06-10 10:47:37] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:47:37] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 10:47:38] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:47:39] [INFO ] Implicit Places using invariants and state equation in 1649 ms returned []
Implicit Place search using SMT with State Equation took 1983 ms to find 0 implicit places.
[2022-06-10 10:47:39] [INFO ] Redundant transitions in 87 ms returned []
[2022-06-10 10:47:39] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:47:39] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:47:40] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1590 transitions.
Graph (trivial) has 934 edges and 608 vertex of which 192 / 608 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 719 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 480 transition count 860
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 469 transition count 860
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 23 place count 469 transition count 791
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 161 place count 400 transition count 791
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 224 place count 337 transition count 728
Iterating global reduction 2 with 63 rules applied. Total rules applied 287 place count 337 transition count 728
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 413 place count 337 transition count 602
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 667 place count 210 transition count 475
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 731 place count 146 transition count 347
Iterating global reduction 3 with 64 rules applied. Total rules applied 795 place count 146 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 796 place count 146 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 796 place count 146 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 798 place count 145 transition count 345
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 861 place count 82 transition count 219
Iterating global reduction 4 with 63 rules applied. Total rules applied 924 place count 82 transition count 219
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 987 place count 19 transition count 93
Iterating global reduction 4 with 63 rules applied. Total rules applied 1050 place count 19 transition count 93
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1113 place count 19 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1113 place count 19 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1115 place count 18 transition count 29
Applied a total of 1115 rules in 47 ms. Remains 18 /608 variables (removed 590) and now considering 29/1590 (removed 1561) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 29 rows 18 cols
[2022-06-10 10:47:40] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 10:47:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 10:47:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:47:40] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 10:47:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 10:47:40] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:47:40] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:47:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 10:47:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:47:40] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:47:40] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:47:40] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-10 10:47:40] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:47:40] [INFO ] Flatten gal took : 2 ms
[2022-06-10 10:47:40] [INFO ] Flatten gal took : 2 ms
[2022-06-10 10:47:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8428937589728024209.gal : 1 ms
[2022-06-10 10:47:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10413428754835377165.prop : 15 ms
Invoking ITS tools like this :cd /tmp/redAtoms11258018718952867907;'/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/ReachabilityCardinality8428937589728024209.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10413428754835377165.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality10413428754835377165.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 126
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :126 after 2700
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2700 after 8580
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8580 after 20340
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :20340 after 43500
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :43500 after 89820
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :89820 after 182100
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :182100 after 366660
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :366660 after 735420
Detected timeout of ITS tools.
[2022-06-10 10:47:55] [INFO ] Flatten gal took : 5 ms
[2022-06-10 10:47:55] [INFO ] Applying decomposition
[2022-06-10 10:47:55] [INFO ] Flatten gal took : 3 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/graph13237653463136155265.txt' '-o' '/tmp/graph13237653463136155265.bin' '-w' '/tmp/graph13237653463136155265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13237653463136155265.bin' '-l' '-1' '-v' '-w' '/tmp/graph13237653463136155265.weights' '-q' '0' '-e' '0.001'
[2022-06-10 10:47:55] [INFO ] Decomposing Gal with order
[2022-06-10 10:47:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 10:47:55] [INFO ] Removed a total of 26 redundant transitions.
[2022-06-10 10:47:55] [INFO ] Flatten gal took : 4 ms
[2022-06-10 10:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2022-06-10 10:47:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8278307120773893034.gal : 1 ms
[2022-06-10 10:47:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17709113743004454216.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11258018718952867907;'/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/ReachabilityCardinality8278307120773893034.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17709113743004454216.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality17709113743004454216.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 250
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :250 after 2495
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2495 after 9448
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9448 after 22168
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :22168 after 47848
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :47848 after 98968
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :98968 after 201448
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :201448 after 406168
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9771513048333930039
[2022-06-10 10:48:10] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9771513048333930039
Running compilation step : cd /tmp/ltsmin9771513048333930039;'/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'
Compilation finished in 92 ms.
Running link step : cd /tmp/ltsmin9771513048333930039;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9771513048333930039;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
LTSmin run took 287 ms.
Found Violation
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 232 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 608 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1592/1592 transitions.
Applied a total of 0 rules in 31 ms. Remains 608 /608 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2022-06-10 10:48:11] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:48:11] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 10:48:11] [INFO ] Implicit Places using invariants in 331 ms returned []
[2022-06-10 10:48:11] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:48:11] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 10:48:11] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:48:13] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 1863 ms to find 0 implicit places.
[2022-06-10 10:48:13] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:48:13] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 10:48:13] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1592/1592 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 497600 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 497600 steps, saw 322974 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 10:48:17] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:48:17] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 10:48:17] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:48:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:48:17] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:48:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:48:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:48:17] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:48:17] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:48:17] [INFO ] After 131ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:48:18] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 0 ms to minimize.
[2022-06-10 10:48:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2022-06-10 10:48:18] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-06-10 10:48:18] [INFO ] After 893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 608/608 places, 1592/1592 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 608 transition count 1590
Applied a total of 2 rules in 170 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1592 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1592 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 493797 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 493797 steps, saw 320505 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 10:48:21] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:48:21] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 10:48:21] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 10:48:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:48:21] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:48:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 10:48:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:48:22] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:48:22] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:48:22] [INFO ] After 134ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:48:22] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 0 ms to minimize.
[2022-06-10 10:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2022-06-10 10:48:22] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2022-06-10 10:48:22] [INFO ] After 886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 608/608 places, 1590/1590 transitions.
Applied a total of 0 rules in 79 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1590 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1590 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 608/608 places, 1590/1590 transitions.
Applied a total of 0 rules in 77 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1590 (removed 0) transitions.
[2022-06-10 10:48:23] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:48:23] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 10:48:23] [INFO ] Implicit Places using invariants in 368 ms returned []
[2022-06-10 10:48:23] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:48:23] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:48:23] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:48:25] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2039 ms to find 0 implicit places.
[2022-06-10 10:48:25] [INFO ] Redundant transitions in 29 ms returned []
[2022-06-10 10:48:25] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:48:25] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:48:25] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1590 transitions.
Graph (trivial) has 934 edges and 608 vertex of which 192 / 608 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 719 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 480 transition count 860
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 469 transition count 860
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 23 place count 469 transition count 791
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 161 place count 400 transition count 791
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 224 place count 337 transition count 728
Iterating global reduction 2 with 63 rules applied. Total rules applied 287 place count 337 transition count 728
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 413 place count 337 transition count 602
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 667 place count 210 transition count 475
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 731 place count 146 transition count 347
Iterating global reduction 3 with 64 rules applied. Total rules applied 795 place count 146 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 796 place count 146 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 796 place count 146 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 798 place count 145 transition count 345
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 861 place count 82 transition count 219
Iterating global reduction 4 with 63 rules applied. Total rules applied 924 place count 82 transition count 219
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 987 place count 19 transition count 93
Iterating global reduction 4 with 63 rules applied. Total rules applied 1050 place count 19 transition count 93
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1113 place count 19 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1113 place count 19 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1115 place count 18 transition count 29
Applied a total of 1115 rules in 35 ms. Remains 18 /608 variables (removed 590) and now considering 29/1590 (removed 1561) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 29 rows 18 cols
[2022-06-10 10:48:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 10:48:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 10:48:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-10 10:48:25] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 10:48:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 10:48:25] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:48:25] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:48:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 10:48:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:48:25] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:48:25] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:48:25] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-10 10:48:25] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:48:25] [INFO ] Flatten gal took : 1 ms
[2022-06-10 10:48:25] [INFO ] Flatten gal took : 1 ms
[2022-06-10 10:48:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15772111290796152710.gal : 3 ms
[2022-06-10 10:48:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3893684353380757323.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1417120159389595531;'/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/ReachabilityCardinality15772111290796152710.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3893684353380757323.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality3893684353380757323.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 126
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :126 after 2700
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2700 after 8580
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8580 after 20340
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :20340 after 43500
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :43500 after 89820
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :89820 after 182100
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :182100 after 366660
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :366660 after 735420
Detected timeout of ITS tools.
[2022-06-10 10:48:40] [INFO ] Flatten gal took : 2 ms
[2022-06-10 10:48:40] [INFO ] Applying decomposition
[2022-06-10 10:48:40] [INFO ] Flatten gal took : 1 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/graph3724026609844128618.txt' '-o' '/tmp/graph3724026609844128618.bin' '-w' '/tmp/graph3724026609844128618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3724026609844128618.bin' '-l' '-1' '-v' '-w' '/tmp/graph3724026609844128618.weights' '-q' '0' '-e' '0.001'
[2022-06-10 10:48:40] [INFO ] Decomposing Gal with order
[2022-06-10 10:48:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 10:48:40] [INFO ] Removed a total of 26 redundant transitions.
[2022-06-10 10:48:40] [INFO ] Flatten gal took : 4 ms
[2022-06-10 10:48:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2022-06-10 10:48:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14402186586946268404.gal : 1 ms
[2022-06-10 10:48:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11245531608551307640.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1417120159389595531;'/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/ReachabilityCardinality14402186586946268404.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11245531608551307640.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality11245531608551307640.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 306
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :306 after 1949
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1949 after 4902
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4902 after 14008
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :14008 after 33208
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :33208 after 71608
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :71608 after 148408
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :148408 after 302008
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :302008 after 609208
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4888219947697855794
[2022-06-10 10:48:55] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4888219947697855794
Running compilation step : cd /tmp/ltsmin4888219947697855794;'/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'
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin4888219947697855794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin4888219947697855794;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
LTSmin run took 207 ms.
Found Violation
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 419 ms.
Product exploration explored 100000 steps with 0 reset in 540 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 1592/1592 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 608 transition count 1590
Applied a total of 2 rules in 369 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1592 (removed 2) transitions.
[2022-06-10 10:48:58] [INFO ] Redundant transitions in 26 ms returned []
[2022-06-10 10:48:58] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:48:58] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:48:58] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 608/608 places, 1590/1592 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1592 transitions.
Product exploration explored 100000 steps with 0 reset in 431 ms.
Product exploration explored 100000 steps with 0 reset in 471 ms.
Built C files in :
/tmp/ltsmin7451109547590428917
[2022-06-10 10:48:59] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7451109547590428917
Running compilation step : cd /tmp/ltsmin7451109547590428917;'/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'
Compilation finished in 2766 ms.
Running link step : cd /tmp/ltsmin7451109547590428917;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7451109547590428917;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4986095186472312536.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1592/1592 transitions.
Applied a total of 0 rules in 18 ms. Remains 608 /608 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2022-06-10 10:49:14] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:49:14] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:49:15] [INFO ] Implicit Places using invariants in 323 ms returned []
[2022-06-10 10:49:15] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:49:15] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:49:15] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:49:16] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
[2022-06-10 10:49:16] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:49:16] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:49:17] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1592/1592 transitions.
Built C files in :
/tmp/ltsmin12739761067115701149
[2022-06-10 10:49:17] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12739761067115701149
Running compilation step : cd /tmp/ltsmin12739761067115701149;'/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'
Compilation finished in 2778 ms.
Running link step : cd /tmp/ltsmin12739761067115701149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12739761067115701149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8819146083583216441.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 10:49:32] [INFO ] Flatten gal took : 60 ms
[2022-06-10 10:49:32] [INFO ] Flatten gal took : 60 ms
[2022-06-10 10:49:32] [INFO ] Time to serialize gal into /tmp/LTL5179327296251098490.gal : 11 ms
[2022-06-10 10:49:32] [INFO ] Time to serialize properties into /tmp/LTL902372394531207090.ltl : 141 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/LTL5179327296251098490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL902372394531207090.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/LTL5179327...265
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((s0<1)||(l1216<1))")))||(G("((s0>=1)&&(l719>=1))")))))
Formula 0 simplified : !X(XG"((s0<1)||(l1216<1))" | G"((s0>=1)&&(l719>=1))")
Detected timeout of ITS tools.
[2022-06-10 10:49:47] [INFO ] Flatten gal took : 52 ms
[2022-06-10 10:49:47] [INFO ] Applying decomposition
[2022-06-10 10:49:47] [INFO ] Flatten gal took : 51 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/graph5324905392064981606.txt' '-o' '/tmp/graph5324905392064981606.bin' '-w' '/tmp/graph5324905392064981606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5324905392064981606.bin' '-l' '-1' '-v' '-w' '/tmp/graph5324905392064981606.weights' '-q' '0' '-e' '0.001'
[2022-06-10 10:49:47] [INFO ] Decomposing Gal with order
[2022-06-10 10:49:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 10:49:48] [INFO ] Removed a total of 2637 redundant transitions.
[2022-06-10 10:49:48] [INFO ] Flatten gal took : 145 ms
[2022-06-10 10:49:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 1177 labels/synchronizations in 89 ms.
[2022-06-10 10:49:48] [INFO ] Time to serialize gal into /tmp/LTL12522125308363700584.gal : 35 ms
[2022-06-10 10:49:48] [INFO ] Time to serialize properties into /tmp/LTL8605637949142334563.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/LTL12522125308363700584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8605637949142334563.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/LTL1252212...246
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((i0.u0.s0<1)||(i25.i0.u144.l1216<1))")))||(G("((i0.u0.s0>=1)&&(i18.i0.u56.l719>=1))")))))
Formula 0 simplified : !X(XG"((i0.u0.s0<1)||(i25.i0.u144.l1216<1))" | G"((i0.u0.s0>=1)&&(i18.i0.u56.l719>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2018775417118143901
[2022-06-10 10:50:03] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2018775417118143901
Running compilation step : cd /tmp/ltsmin2018775417118143901;'/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'
Compilation finished in 2761 ms.
Running link step : cd /tmp/ltsmin2018775417118143901;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2018775417118143901;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c008-LTLFireability-05 finished in 174561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((!p1 U ((!p1&&G(p2))||G(!p1)))&&p0))))'
Support contains 3 out of 689 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 689/689 places, 1792/1792 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 681 transition count 1774
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 681 transition count 1774
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 681 transition count 1772
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 673 transition count 1752
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 673 transition count 1752
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 42 place count 665 transition count 1728
Iterating global reduction 1 with 8 rules applied. Total rules applied 50 place count 665 transition count 1728
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 658 transition count 1706
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 658 transition count 1706
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 652 transition count 1692
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 652 transition count 1692
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 646 transition count 1680
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 646 transition count 1680
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 640 transition count 1668
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 640 transition count 1668
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 635 transition count 1658
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 635 transition count 1658
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 114 place count 631 transition count 1650
Iterating global reduction 1 with 4 rules applied. Total rules applied 118 place count 631 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 630 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 630 transition count 1648
Applied a total of 120 rules in 141 ms. Remains 630 /689 variables (removed 59) and now considering 1648/1792 (removed 144) transitions.
[2022-06-10 10:50:18] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 630 cols
[2022-06-10 10:50:18] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 10:50:18] [INFO ] Implicit Places using invariants in 310 ms returned []
[2022-06-10 10:50:18] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 630 cols
[2022-06-10 10:50:18] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 10:50:19] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-10 10:50:20] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 1722 ms to find 0 implicit places.
[2022-06-10 10:50:20] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 630 cols
[2022-06-10 10:50:20] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 10:50:20] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 630/689 places, 1648/1792 transitions.
Finished structural reductions, in 1 iterations. Remains : 630/689 places, 1648/1792 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s550 1)), p1:(AND (GEQ s1 1) (GEQ s551 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-06 finished in 2561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 689 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 689/689 places, 1792/1792 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 679 transition count 1768
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 679 transition count 1768
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 669 transition count 1742
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 669 transition count 1742
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 659 transition count 1710
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 659 transition count 1710
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 650 transition count 1682
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 650 transition count 1682
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 642 transition count 1666
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 642 transition count 1666
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 102 place count 634 transition count 1650
Iterating global reduction 0 with 8 rules applied. Total rules applied 110 place count 634 transition count 1650
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 118 place count 626 transition count 1634
Iterating global reduction 0 with 8 rules applied. Total rules applied 126 place count 626 transition count 1634
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 132 place count 620 transition count 1622
Iterating global reduction 0 with 6 rules applied. Total rules applied 138 place count 620 transition count 1622
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 143 place count 615 transition count 1612
Iterating global reduction 0 with 5 rules applied. Total rules applied 148 place count 615 transition count 1612
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 152 place count 615 transition count 1608
Applied a total of 152 rules in 292 ms. Remains 615 /689 variables (removed 74) and now considering 1608/1792 (removed 184) transitions.
[2022-06-10 10:50:21] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:50:21] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 10:50:21] [INFO ] Implicit Places using invariants in 340 ms returned []
[2022-06-10 10:50:21] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:50:21] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 10:50:21] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 10:50:23] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned []
Implicit Place search using SMT with State Equation took 1978 ms to find 0 implicit places.
[2022-06-10 10:50:23] [INFO ] Redundant transitions in 28 ms returned []
[2022-06-10 10:50:23] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:50:23] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 10:50:23] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 615/689 places, 1608/1792 transitions.
Finished structural reductions, in 1 iterations. Remains : 615/689 places, 1608/1792 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-09 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 s1 1) (LT s537 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 0 reset in 480 ms.
Product exploration explored 100000 steps with 0 reset in 485 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 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 32 ms :[(NOT p0)]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 487041 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 487041 steps, saw 316121 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 10:50:28] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:50:28] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 10:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 10:50:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:50:28] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:50:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 10:50:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:50:28] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:50:28] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 10:50:29] [INFO ] After 191ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:50:29] [INFO ] After 333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-06-10 10:50:29] [INFO ] After 860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 615 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Graph (complete) has 2684 edges and 615 vertex of which 423 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.6 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 423 transition count 1224
Applied a total of 385 rules in 54 ms. Remains 423 /615 variables (removed 192) and now considering 1224/1608 (removed 384) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/615 places, 1224/1608 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 4575 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1143 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 108 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2022-06-10 10:50:29] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:50:29] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 10:50:30] [INFO ] Implicit Places using invariants in 346 ms returned []
[2022-06-10 10:50:30] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:50:30] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 10:50:30] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 10:50:31] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
[2022-06-10 10:50:31] [INFO ] Redundant transitions in 28 ms returned []
[2022-06-10 10:50:31] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:50:31] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 10:50:32] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 615/615 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 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 27 ms :[(NOT p0)]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 487239 steps, run timeout after 3025 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 487239 steps, saw 316250 distinct states, run finished after 3025 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 10:50:35] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:50:35] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 10:50:35] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:50:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:50:36] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:50:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:50:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:50:36] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:50:36] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 10:50:36] [INFO ] After 194ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:50:36] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-06-10 10:50:37] [INFO ] After 997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 615 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Graph (complete) has 2684 edges and 615 vertex of which 423 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 423 transition count 1224
Applied a total of 385 rules in 50 ms. Remains 423 /615 variables (removed 192) and now considering 1224/1608 (removed 384) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/615 places, 1224/1608 transitions.
Finished random walk after 3556 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=323 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 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 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 454 ms.
Product exploration explored 100000 steps with 0 reset in 490 ms.
Built C files in :
/tmp/ltsmin8129411500367234685
[2022-06-10 10:50:38] [INFO ] Too many transitions (1608) to apply POR reductions. Disabling POR matrices.
[2022-06-10 10:50:38] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8129411500367234685
Running compilation step : cd /tmp/ltsmin8129411500367234685;'/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'
Compilation finished in 2819 ms.
Running link step : cd /tmp/ltsmin8129411500367234685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8129411500367234685;'/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' '--hoa' '/tmp/stateBased17239105406592890370.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 78 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2022-06-10 10:50:53] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:50:53] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 10:50:53] [INFO ] Implicit Places using invariants in 356 ms returned []
[2022-06-10 10:50:53] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:50:53] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 10:50:54] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 10:50:55] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
[2022-06-10 10:50:55] [INFO ] Redundant transitions in 27 ms returned []
[2022-06-10 10:50:55] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2022-06-10 10:50:55] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 10:50:56] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 615/615 places, 1608/1608 transitions.
Built C files in :
/tmp/ltsmin356959590830688468
[2022-06-10 10:50:56] [INFO ] Too many transitions (1608) to apply POR reductions. Disabling POR matrices.
[2022-06-10 10:50:56] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin356959590830688468
Running compilation step : cd /tmp/ltsmin356959590830688468;'/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'
Compilation finished in 2861 ms.
Running link step : cd /tmp/ltsmin356959590830688468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin356959590830688468;'/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' '--hoa' '/tmp/stateBased11416821324944786347.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 10:51:11] [INFO ] Flatten gal took : 46 ms
[2022-06-10 10:51:11] [INFO ] Flatten gal took : 45 ms
[2022-06-10 10:51:11] [INFO ] Time to serialize gal into /tmp/LTL9855958984156782692.gal : 12 ms
[2022-06-10 10:51:11] [INFO ] Time to serialize properties into /tmp/LTL8522402333470161992.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/LTL9855958984156782692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8522402333470161992.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/LTL9855958...266
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l1703<1))"))))
Formula 0 simplified : !FG"((s1<1)||(l1703<1))"
Detected timeout of ITS tools.
[2022-06-10 10:51:26] [INFO ] Flatten gal took : 46 ms
[2022-06-10 10:51:26] [INFO ] Applying decomposition
[2022-06-10 10:51:26] [INFO ] Flatten gal took : 46 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/graph12297765184779863391.txt' '-o' '/tmp/graph12297765184779863391.bin' '-w' '/tmp/graph12297765184779863391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12297765184779863391.bin' '-l' '-1' '-v' '-w' '/tmp/graph12297765184779863391.weights' '-q' '0' '-e' '0.001'
[2022-06-10 10:51:26] [INFO ] Decomposing Gal with order
[2022-06-10 10:51:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 10:51:26] [INFO ] Removed a total of 2680 redundant transitions.
[2022-06-10 10:51:26] [INFO ] Flatten gal took : 102 ms
[2022-06-10 10:51:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 1098 labels/synchronizations in 57 ms.
[2022-06-10 10:51:26] [INFO ] Time to serialize gal into /tmp/LTL6542187105170376491.gal : 9 ms
[2022-06-10 10:51:26] [INFO ] Time to serialize properties into /tmp/LTL248929389668020793.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/LTL6542187105170376491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL248929389668020793.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/LTL6542187...244
Read 1 LTL properties
Checking formula 0 : !((F(G("((i11.u1.s1<1)||(i25.i2.u144.l1703<1))"))))
Formula 0 simplified : !FG"((i11.u1.s1<1)||(i25.i2.u144.l1703<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4188712692627530142
[2022-06-10 10:51:41] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4188712692627530142
Running compilation step : cd /tmp/ltsmin4188712692627530142;'/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'
Compilation finished in 2820 ms.
Running link step : cd /tmp/ltsmin4188712692627530142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4188712692627530142;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c008-LTLFireability-09 finished in 95917 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 689 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 689/689 places, 1792/1792 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 679 transition count 1768
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 679 transition count 1768
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 679 transition count 1766
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 669 transition count 1740
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 669 transition count 1740
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 659 transition count 1710
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 659 transition count 1710
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 71 place count 650 transition count 1682
Iterating global reduction 1 with 9 rules applied. Total rules applied 80 place count 650 transition count 1682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 88 place count 642 transition count 1664
Iterating global reduction 1 with 8 rules applied. Total rules applied 96 place count 642 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 634 transition count 1648
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 634 transition count 1648
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 120 place count 626 transition count 1632
Iterating global reduction 1 with 8 rules applied. Total rules applied 128 place count 626 transition count 1632
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 134 place count 620 transition count 1620
Iterating global reduction 1 with 6 rules applied. Total rules applied 140 place count 620 transition count 1620
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 145 place count 615 transition count 1610
Iterating global reduction 1 with 5 rules applied. Total rules applied 150 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 151 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 152 place count 614 transition count 1608
Applied a total of 152 rules in 137 ms. Remains 614 /689 variables (removed 75) and now considering 1608/1792 (removed 184) transitions.
[2022-06-10 10:51:57] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2022-06-10 10:51:57] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:51:57] [INFO ] Implicit Places using invariants in 337 ms returned []
[2022-06-10 10:51:57] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2022-06-10 10:51:57] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 10:51:57] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 10:51:58] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
[2022-06-10 10:51:58] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2022-06-10 10:51:58] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 10:51:59] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/689 places, 1608/1792 transitions.
Finished structural reductions, in 1 iterations. Remains : 614/689 places, 1608/1792 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s542 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 818 ms.
Product exploration explored 100000 steps with 50000 reset in 854 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FunctionPointer-PT-c008-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLFireability-13 finished in 4452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(p0) U ((false U F(p2))&&p1))))'
Support contains 4 out of 689 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 689/689 places, 1792/1792 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 680 transition count 1770
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 680 transition count 1770
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 680 transition count 1768
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 671 transition count 1744
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 671 transition count 1744
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 662 transition count 1716
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 662 transition count 1716
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 654 transition count 1690
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 654 transition count 1690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 646 transition count 1672
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 646 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 638 transition count 1656
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 638 transition count 1656
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 630 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 630 transition count 1640
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 126 place count 624 transition count 1628
Iterating global reduction 1 with 6 rules applied. Total rules applied 132 place count 624 transition count 1628
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 137 place count 619 transition count 1618
Iterating global reduction 1 with 5 rules applied. Total rules applied 142 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 618 transition count 1616
Applied a total of 144 rules in 152 ms. Remains 618 /689 variables (removed 71) and now considering 1616/1792 (removed 176) transitions.
[2022-06-10 10:52:01] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2022-06-10 10:52:01] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 10:52:01] [INFO ] Implicit Places using invariants in 367 ms returned []
[2022-06-10 10:52:01] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2022-06-10 10:52:01] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 10:52:02] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 10:52:03] [INFO ] Implicit Places using invariants and state equation in 1492 ms returned []
Implicit Place search using SMT with State Equation took 1869 ms to find 0 implicit places.
[2022-06-10 10:52:03] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2022-06-10 10:52:03] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 10:52:03] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 618/689 places, 1616/1792 transitions.
Finished structural reductions, in 1 iterations. Remains : 618/689 places, 1616/1792 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (AND p1 p2), (AND p1 p2), (AND p2 p1 p0), (AND p0 p2), p2, p0]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 6}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(AND (GEQ s5 1) (GEQ s529 1)), p2:(AND (GEQ s5 1) (GEQ s529 1)), p0:(AND (GEQ s1 1) (GEQ s539 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 465 ms.
Product exploration explored 100000 steps with 0 reset in 514 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 681 ms. Reduced automaton from 7 states, 20 edges and 3 AP to 7 states, 20 edges and 3 AP.
Stuttering acceptance computed with spot in 290 ms :[true, (AND p1 p2), p2, (AND p1 p2), p0, (AND p2 p0), (AND p2 p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-06-10 10:52:06] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2022-06-10 10:52:06] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 10:52:06] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 10:52:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-10 10:52:07] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:3
[2022-06-10 10:52:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:52:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:52:07] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2022-06-10 10:52:07] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 10:52:08] [INFO ] After 511ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :5 sat :3
[2022-06-10 10:52:08] [INFO ] After 891ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 251 ms.
[2022-06-10 10:52:09] [INFO ] After 1825ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 618/618 places, 1616/1616 transitions.
Graph (complete) has 2696 edges and 618 vertex of which 426 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 426 transition count 1232
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 426 transition count 1228
Applied a total of 389 rules in 86 ms. Remains 426 /618 variables (removed 192) and now considering 1228/1616 (removed 388) transitions.
Finished structural reductions, in 1 iterations. Remains : 426/618 places, 1228/1616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Finished Best-First random walk after 4581 steps, including 1 resets, run visited all 3 properties in 12 ms. (steps per millisecond=381 )
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 p2))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1 p2)), (F p0), (F p2), (F (AND p1 p2))]
Knowledge based reduction with 20 factoid took 1082 ms. Reduced automaton from 7 states, 20 edges and 3 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p0 (NOT p1)), false]
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1616/1616 transitions.
Applied a total of 0 rules in 13 ms. Remains 618 /618 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2022-06-10 10:52:10] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2022-06-10 10:52:10] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 10:52:11] [INFO ] Implicit Places using invariants in 381 ms returned []
[2022-06-10 10:52:11] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2022-06-10 10:52:11] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:52:11] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 10:52:12] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 1951 ms to find 0 implicit places.
[2022-06-10 10:52:12] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2022-06-10 10:52:12] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 10:52:13] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 618/618 places, 1616/1616 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 757 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p0 (NOT p1)), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) 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 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-06-10 10:52:14] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2022-06-10 10:52:14] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 10:52:14] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 10:52:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:52:14] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-06-10 10:52:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:52:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:52:15] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-06-10 10:52:15] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 10:52:15] [INFO ] After 360ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-06-10 10:52:16] [INFO ] After 608ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 200 ms.
[2022-06-10 10:52:16] [INFO ] After 1389ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 618/618 places, 1616/1616 transitions.
Graph (complete) has 2696 edges and 618 vertex of which 426 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 426 transition count 1232
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 426 transition count 1228
Applied a total of 389 rules in 87 ms. Remains 426 /618 variables (removed 192) and now considering 1228/1616 (removed 388) transitions.
Finished structural reductions, in 1 iterations. Remains : 426/618 places, 1228/1616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Finished Best-First random walk after 1351 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=450 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 472 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 175 ms :[true, p1, (AND p0 p1), p1, p0]
Stuttering acceptance computed with spot in 173 ms :[true, p1, (AND p0 p1), p1, p0]
Stuttering acceptance computed with spot in 172 ms :[true, p1, (AND p0 p1), p1, p0]
Product exploration explored 100000 steps with 0 reset in 469 ms.
Product exploration explored 100000 steps with 0 reset in 483 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 179 ms :[true, p1, (AND p0 p1), p1, p0]
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1616/1616 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 618 transition count 1612
Applied a total of 4 rules in 166 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1616 (removed 4) transitions.
[2022-06-10 10:52:18] [INFO ] Redundant transitions in 24 ms returned []
[2022-06-10 10:52:18] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
// Phase 1: matrix 1078 rows 618 cols
[2022-06-10 10:52:18] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 10:52:19] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 618/618 places, 1612/1616 transitions.
Finished structural reductions, in 1 iterations. Remains : 618/618 places, 1612/1616 transitions.
Entered a terminal (fully accepting) state of product in 253 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-14 finished in 18132 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||G(p1))))'
Found a SL insensitive property : FunctionPointer-PT-c008-LTLFireability-05
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 689 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 689/689 places, 1792/1792 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 679 transition count 1768
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 679 transition count 1768
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 679 transition count 1766
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 669 transition count 1740
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 669 transition count 1740
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 659 transition count 1708
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 659 transition count 1708
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 72 place count 649 transition count 1676
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 649 transition count 1676
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 91 place count 640 transition count 1656
Iterating global reduction 1 with 9 rules applied. Total rules applied 100 place count 640 transition count 1656
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 109 place count 631 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 118 place count 631 transition count 1638
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 127 place count 622 transition count 1620
Iterating global reduction 1 with 9 rules applied. Total rules applied 136 place count 622 transition count 1620
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 143 place count 615 transition count 1606
Iterating global reduction 1 with 7 rules applied. Total rules applied 150 place count 615 transition count 1606
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 156 place count 609 transition count 1594
Iterating global reduction 1 with 6 rules applied. Total rules applied 162 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 608 transition count 1592
Applied a total of 164 rules in 183 ms. Remains 608 /689 variables (removed 81) and now considering 1592/1792 (removed 200) transitions.
[2022-06-10 10:52:19] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:52:19] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 10:52:20] [INFO ] Implicit Places using invariants in 349 ms returned []
[2022-06-10 10:52:20] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:52:20] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 10:52:20] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:52:21] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 1826 ms to find 0 implicit places.
[2022-06-10 10:52:21] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:52:21] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 10:52:22] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 608/689 places, 1592/1792 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/689 places, 1592/1792 transitions.
Running random walk in product with property : FunctionPointer-PT-c008-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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (LT s0 1) (LT s522 1)), p1:(AND (GEQ s0 1) (GEQ s341 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, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 408 ms.
Product exploration explored 100000 steps with 0 reset in 503 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 454 ms. Reduced automaton from 6 states, 12 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 515518 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 515518 steps, saw 334603 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 10:52:26] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:52:26] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 10:52:26] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:52:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:52:27] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:52:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 10:52:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:52:27] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:52:27] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:52:27] [INFO ] After 134ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:52:27] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 0 ms to minimize.
[2022-06-10 10:52:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2022-06-10 10:52:28] [INFO ] After 451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-06-10 10:52:28] [INFO ] After 909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 608/608 places, 1592/1592 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 608 transition count 1590
Applied a total of 2 rules in 135 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1592 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1592 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 499339 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 499339 steps, saw 324103 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 10:52:31] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:52:31] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 10:52:31] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:52:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:52:31] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:52:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:52:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:52:32] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:52:32] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:52:32] [INFO ] After 138ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:52:32] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 0 ms to minimize.
[2022-06-10 10:52:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2022-06-10 10:52:32] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-06-10 10:52:32] [INFO ] After 893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 608/608 places, 1590/1590 transitions.
Applied a total of 0 rules in 86 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1590 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1590 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 608/608 places, 1590/1590 transitions.
Applied a total of 0 rules in 75 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1590 (removed 0) transitions.
[2022-06-10 10:52:32] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:52:32] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 10:52:33] [INFO ] Implicit Places using invariants in 361 ms returned []
[2022-06-10 10:52:33] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:52:33] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:52:33] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:52:34] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
[2022-06-10 10:52:34] [INFO ] Redundant transitions in 23 ms returned []
[2022-06-10 10:52:34] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:52:34] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:52:35] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1590 transitions.
Graph (trivial) has 934 edges and 608 vertex of which 192 / 608 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 719 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 480 transition count 860
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 469 transition count 860
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 23 place count 469 transition count 791
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 161 place count 400 transition count 791
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 224 place count 337 transition count 728
Iterating global reduction 2 with 63 rules applied. Total rules applied 287 place count 337 transition count 728
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 413 place count 337 transition count 602
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 667 place count 210 transition count 475
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 731 place count 146 transition count 347
Iterating global reduction 3 with 64 rules applied. Total rules applied 795 place count 146 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 796 place count 146 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 796 place count 146 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 798 place count 145 transition count 345
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 861 place count 82 transition count 219
Iterating global reduction 4 with 63 rules applied. Total rules applied 924 place count 82 transition count 219
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 987 place count 19 transition count 93
Iterating global reduction 4 with 63 rules applied. Total rules applied 1050 place count 19 transition count 93
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1113 place count 19 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1113 place count 19 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1115 place count 18 transition count 29
Applied a total of 1115 rules in 39 ms. Remains 18 /608 variables (removed 590) and now considering 29/1590 (removed 1561) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 29 rows 18 cols
[2022-06-10 10:52:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 10:52:35] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 10:52:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:52:35] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 10:52:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 10:52:35] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:52:35] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:52:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 10:52:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:52:35] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:52:35] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:52:35] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-10 10:52:35] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:52:35] [INFO ] Flatten gal took : 3 ms
[2022-06-10 10:52:35] [INFO ] Flatten gal took : 1 ms
[2022-06-10 10:52:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6664009573898918784.gal : 0 ms
[2022-06-10 10:52:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17342565882758568206.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17224546365837730401;'/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/ReachabilityCardinality6664009573898918784.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17342565882758568206.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality17342565882758568206.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 126
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :126 after 2700
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2700 after 8580
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8580 after 20340
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :20340 after 43500
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :43500 after 89820
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :89820 after 182100
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :182100 after 366660
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :366660 after 735420
Detected timeout of ITS tools.
[2022-06-10 10:52:50] [INFO ] Flatten gal took : 1 ms
[2022-06-10 10:52:50] [INFO ] Applying decomposition
[2022-06-10 10:52:50] [INFO ] Flatten gal took : 1 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/graph16208350841725597271.txt' '-o' '/tmp/graph16208350841725597271.bin' '-w' '/tmp/graph16208350841725597271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16208350841725597271.bin' '-l' '-1' '-v' '-w' '/tmp/graph16208350841725597271.weights' '-q' '0' '-e' '0.001'
[2022-06-10 10:52:50] [INFO ] Decomposing Gal with order
[2022-06-10 10:52:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 10:52:50] [INFO ] Removed a total of 25 redundant transitions.
[2022-06-10 10:52:50] [INFO ] Flatten gal took : 2 ms
[2022-06-10 10:52:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2022-06-10 10:52:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2128709201936664970.gal : 2 ms
[2022-06-10 10:52:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16601616108140401277.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17224546365837730401;'/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/ReachabilityCardinality2128709201936664970.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16601616108140401277.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality16601616108140401277.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 286
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :286 after 1403
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1403 after 4888
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4888 after 12688
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12688 after 28288
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :28288 after 59488
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :59488 after 121288
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :121288 after 244288
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :244288 after 490288
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin438818468245865840
[2022-06-10 10:53:05] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin438818468245865840
Running compilation step : cd /tmp/ltsmin438818468245865840;'/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'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin438818468245865840;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin438818468245865840;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
LTSmin run took 194 ms.
Found Violation
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 264 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 608 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1592/1592 transitions.
Applied a total of 0 rules in 14 ms. Remains 608 /608 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2022-06-10 10:53:06] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:53:06] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 10:53:06] [INFO ] Implicit Places using invariants in 369 ms returned []
[2022-06-10 10:53:06] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:53:06] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:53:06] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:53:08] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 1963 ms to find 0 implicit places.
[2022-06-10 10:53:08] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:53:08] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 10:53:08] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1592/1592 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 515440 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 515440 steps, saw 334552 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 10:53:12] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:53:12] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 10:53:12] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:53:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:53:12] [INFO ] After 380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:53:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 10:53:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:53:12] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:53:12] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:53:13] [INFO ] After 141ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:53:13] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 1 ms to minimize.
[2022-06-10 10:53:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2022-06-10 10:53:13] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-06-10 10:53:13] [INFO ] After 923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 608/608 places, 1592/1592 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 608 transition count 1590
Applied a total of 2 rules in 138 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1592 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1592 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 520479 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 520479 steps, saw 337823 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 10:53:16] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:53:16] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 10:53:16] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 10:53:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:53:17] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:53:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 10:53:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 10:53:17] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:53:17] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:53:17] [INFO ] After 140ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:53:17] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 1 ms to minimize.
[2022-06-10 10:53:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2022-06-10 10:53:17] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2022-06-10 10:53:17] [INFO ] After 889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 608/608 places, 1590/1590 transitions.
Applied a total of 0 rules in 74 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1590 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1590 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 608/608 places, 1590/1590 transitions.
Applied a total of 0 rules in 67 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1590 (removed 0) transitions.
[2022-06-10 10:53:18] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:53:18] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 10:53:18] [INFO ] Implicit Places using invariants in 357 ms returned []
[2022-06-10 10:53:18] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:53:18] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 10:53:18] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:53:19] [INFO ] Implicit Places using invariants and state equation in 1516 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
[2022-06-10 10:53:19] [INFO ] Redundant transitions in 28 ms returned []
[2022-06-10 10:53:19] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:53:19] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:53:20] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1590 transitions.
Graph (trivial) has 934 edges and 608 vertex of which 192 / 608 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 719 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 480 transition count 860
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 469 transition count 860
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 23 place count 469 transition count 791
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 161 place count 400 transition count 791
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 224 place count 337 transition count 728
Iterating global reduction 2 with 63 rules applied. Total rules applied 287 place count 337 transition count 728
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 413 place count 337 transition count 602
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 667 place count 210 transition count 475
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 731 place count 146 transition count 347
Iterating global reduction 3 with 64 rules applied. Total rules applied 795 place count 146 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 796 place count 146 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 796 place count 146 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 798 place count 145 transition count 345
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 861 place count 82 transition count 219
Iterating global reduction 4 with 63 rules applied. Total rules applied 924 place count 82 transition count 219
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 987 place count 19 transition count 93
Iterating global reduction 4 with 63 rules applied. Total rules applied 1050 place count 19 transition count 93
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1113 place count 19 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1113 place count 19 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1115 place count 18 transition count 29
Applied a total of 1115 rules in 29 ms. Remains 18 /608 variables (removed 590) and now considering 29/1590 (removed 1561) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 29 rows 18 cols
[2022-06-10 10:53:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 10:53:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 10:53:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:53:20] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 10:53:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 10:53:20] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:53:20] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 10:53:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-10 10:53:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 10:53:20] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 10:53:20] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:53:20] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-10 10:53:20] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 10:53:20] [INFO ] Flatten gal took : 1 ms
[2022-06-10 10:53:20] [INFO ] Flatten gal took : 1 ms
[2022-06-10 10:53:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2468575060955326819.gal : 0 ms
[2022-06-10 10:53:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3654289274808461600.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16573411011632904028;'/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/ReachabilityCardinality2468575060955326819.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3654289274808461600.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/ReachabilityCardinality3654289274808461600.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 126
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :126 after 2700
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2700 after 8580
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8580 after 20340
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :20340 after 43500
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :43500 after 89820
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :89820 after 182100
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :182100 after 366660
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :366660 after 735420
Detected timeout of ITS tools.
[2022-06-10 10:53:35] [INFO ] Flatten gal took : 1 ms
[2022-06-10 10:53:35] [INFO ] Applying decomposition
[2022-06-10 10:53:35] [INFO ] Flatten gal took : 1 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/graph7488373640576988971.txt' '-o' '/tmp/graph7488373640576988971.bin' '-w' '/tmp/graph7488373640576988971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7488373640576988971.bin' '-l' '-1' '-v' '-w' '/tmp/graph7488373640576988971.weights' '-q' '0' '-e' '0.001'
[2022-06-10 10:53:35] [INFO ] Decomposing Gal with order
[2022-06-10 10:53:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 10:53:35] [INFO ] Removed a total of 26 redundant transitions.
[2022-06-10 10:53:35] [INFO ] Flatten gal took : 3 ms
[2022-06-10 10:53:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2022-06-10 10:53:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5545039808741113108.gal : 1 ms
[2022-06-10 10:53:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1729768193617533983.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16573411011632904028;'/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/ReachabilityCardinality5545039808741113108.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1729768193617533983.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality1729768193617533983.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 178
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :178 after 2263
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2263 after 8128
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8128 after 18328
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :18328 after 37528
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :37528 after 76528
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :76528 after 153328
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :153328 after 307528
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :307528 after 614728
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1908383779257388886
[2022-06-10 10:53:50] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1908383779257388886
Running compilation step : cd /tmp/ltsmin1908383779257388886;'/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'
Compilation finished in 106 ms.
Running link step : cd /tmp/ltsmin1908383779257388886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1908383779257388886;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
LTSmin run took 93 ms.
Found Violation
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 441 ms.
Product exploration explored 100000 steps with 0 reset in 549 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 1592/1592 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 608 transition count 1590
Applied a total of 2 rules in 164 ms. Remains 608 /608 variables (removed 0) and now considering 1590/1592 (removed 2) transitions.
[2022-06-10 10:53:52] [INFO ] Redundant transitions in 24 ms returned []
[2022-06-10 10:53:52] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2022-06-10 10:53:52] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 10:53:53] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 608/608 places, 1590/1592 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1590/1592 transitions.
Product exploration explored 100000 steps with 0 reset in 480 ms.
Product exploration explored 100000 steps with 0 reset in 525 ms.
Built C files in :
/tmp/ltsmin5712841755688042905
[2022-06-10 10:53:54] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5712841755688042905
Running compilation step : cd /tmp/ltsmin5712841755688042905;'/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'
Compilation finished in 2822 ms.
Running link step : cd /tmp/ltsmin5712841755688042905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5712841755688042905;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15555767276314865848.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1592/1592 transitions.
Applied a total of 0 rules in 17 ms. Remains 608 /608 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2022-06-10 10:54:09] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:54:09] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:54:09] [INFO ] Implicit Places using invariants in 344 ms returned []
[2022-06-10 10:54:09] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:54:09] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 10:54:10] [INFO ] State equation strengthened by 264 read => feed constraints.
[2022-06-10 10:54:11] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2022-06-10 10:54:11] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2022-06-10 10:54:11] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 10:54:11] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/608 places, 1592/1592 transitions.
Built C files in :
/tmp/ltsmin12684809287759923429
[2022-06-10 10:54:11] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12684809287759923429
Running compilation step : cd /tmp/ltsmin12684809287759923429;'/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'
Compilation finished in 2986 ms.
Running link step : cd /tmp/ltsmin12684809287759923429;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12684809287759923429;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4448841358737563612.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 10:54:27] [INFO ] Flatten gal took : 52 ms
[2022-06-10 10:54:27] [INFO ] Flatten gal took : 42 ms
[2022-06-10 10:54:27] [INFO ] Time to serialize gal into /tmp/LTL3441677729231777280.gal : 5 ms
[2022-06-10 10:54:27] [INFO ] Time to serialize properties into /tmp/LTL12471557425673841828.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/LTL3441677729231777280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12471557425673841828.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/LTL3441677...267
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((s0<1)||(l1216<1))")))||(G("((s0>=1)&&(l719>=1))")))))
Formula 0 simplified : !X(XG"((s0<1)||(l1216<1))" | G"((s0>=1)&&(l719>=1))")
Detected timeout of ITS tools.
[2022-06-10 10:54:42] [INFO ] Flatten gal took : 40 ms
[2022-06-10 10:54:42] [INFO ] Applying decomposition
[2022-06-10 10:54:42] [INFO ] Flatten gal took : 44 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/graph938745821584682924.txt' '-o' '/tmp/graph938745821584682924.bin' '-w' '/tmp/graph938745821584682924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph938745821584682924.bin' '-l' '-1' '-v' '-w' '/tmp/graph938745821584682924.weights' '-q' '0' '-e' '0.001'
[2022-06-10 10:54:42] [INFO ] Decomposing Gal with order
[2022-06-10 10:54:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 10:54:42] [INFO ] Removed a total of 2640 redundant transitions.
[2022-06-10 10:54:42] [INFO ] Flatten gal took : 80 ms
[2022-06-10 10:54:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 1228 labels/synchronizations in 32 ms.
[2022-06-10 10:54:42] [INFO ] Time to serialize gal into /tmp/LTL6770099048454583206.gal : 8 ms
[2022-06-10 10:54:42] [INFO ] Time to serialize properties into /tmp/LTL13482816608695131226.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/LTL6770099048454583206.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13482816608695131226.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/LTL6770099...246
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((i0.u0.s0<1)||(i27.i1.u141.l1216<1))")))||(G("((i0.u0.s0>=1)&&(i21.i1.u82.l719>=1))")))))
Formula 0 simplified : !X(XG"((i0.u0.s0<1)||(i27.i1.u141.l1216<1))" | G"((i0.u0.s0>=1)&&(i21.i1.u82.l719>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13943529107871293913
[2022-06-10 10:54:57] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13943529107871293913
Running compilation step : cd /tmp/ltsmin13943529107871293913;'/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'
Compilation finished in 2977 ms.
Running link step : cd /tmp/ltsmin13943529107871293913;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13943529107871293913;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c008-LTLFireability-05 finished in 173228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2022-06-10 10:55:12] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5828892857203456088
[2022-06-10 10:55:12] [INFO ] Too many transitions (1792) to apply POR reductions. Disabling POR matrices.
[2022-06-10 10:55:12] [INFO ] Applying decomposition
[2022-06-10 10:55:12] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5828892857203456088
Running compilation step : cd /tmp/ltsmin5828892857203456088;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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-06-10 10:55:12] [INFO ] Flatten gal took : 49 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/graph15730436327709591997.txt' '-o' '/tmp/graph15730436327709591997.bin' '-w' '/tmp/graph15730436327709591997.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15730436327709591997.bin' '-l' '-1' '-v' '-w' '/tmp/graph15730436327709591997.weights' '-q' '0' '-e' '0.001'
[2022-06-10 10:55:13] [INFO ] Decomposing Gal with order
[2022-06-10 10:55:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 10:55:13] [INFO ] Removed a total of 3000 redundant transitions.
[2022-06-10 10:55:13] [INFO ] Flatten gal took : 114 ms
[2022-06-10 10:55:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1376 labels/synchronizations in 36 ms.
[2022-06-10 10:55:13] [INFO ] Time to serialize gal into /tmp/LTLFireability4929985860495677941.gal : 7 ms
[2022-06-10 10:55:13] [INFO ] Time to serialize properties into /tmp/LTLFireability841540136156623786.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/LTLFireability4929985860495677941.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability841540136156623786.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...266
Read 2 LTL properties
Checking formula 0 : !((X((X(G("((i0.u0.s0<1)||(i22.i0.u142.l1216<1))")))||(G("((i0.u0.s0>=1)&&(i13.i1.u49.l719>=1))")))))
Formula 0 simplified : !X(XG"((i0.u0.s0<1)||(i22.i0.u142.l1216<1))" | G"((i0.u0.s0>=1)&&(i13.i1.u49.l719>=1))")
Compilation finished in 3353 ms.
Running link step : cd /tmp/ltsmin5828892857203456088;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5828892857203456088;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 83874 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin5828892857203456088;'/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' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-10 11:18:13] [INFO ] Flatten gal took : 172 ms
[2022-06-10 11:18:13] [INFO ] Time to serialize gal into /tmp/LTLFireability3889655202199018113.gal : 23 ms
[2022-06-10 11:18:13] [INFO ] Time to serialize properties into /tmp/LTLFireability14190398824965466333.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/LTLFireability3889655202199018113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14190398824965466333.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...289
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l1703<1))"))))
Formula 0 simplified : !FG"((s1<1)||(l1703<1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin5828892857203456088;'/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' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin5828892857203456088;'/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' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-10 11:41:15] [INFO ] Flatten gal took : 191 ms
[2022-06-10 11:41:15] [INFO ] Input system was already deterministic with 1792 transitions.
[2022-06-10 11:41:16] [INFO ] Transformed 689 places.
[2022-06-10 11:41:16] [INFO ] Transformed 1792 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-10 11:41:16] [INFO ] Time to serialize gal into /tmp/LTLFireability16003873252883351403.gal : 4 ms
[2022-06-10 11:41:16] [INFO ] Time to serialize properties into /tmp/LTLFireability13988683336830100675.ltl : 21 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/LTLFireability16003873252883351403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13988683336830100675.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((s1<1)||(l1703<1))"))))
Formula 0 simplified : !FG"((s1<1)||(l1703<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="FunctionPointer-PT-c008"
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 FunctionPointer-PT-c008, 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 r312-tall-165472282300492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 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 ;