About the Execution of ITS-Tools for FunctionPointer-PT-c002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.651 | 3600000.00 | 4151192.00 | 295983.70 | FFT?FFFTTTF?TFFF | 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-165472282300475.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-c002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282300475
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 8.4K Jun 7 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 17:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Jun 7 17:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Jun 7 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 7 17:21 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-c002-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1654849612755
Running Version 202205111006
[2022-06-10 08:26:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 08:26:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 08:26:54] [INFO ] Load time of PNML (sax parser for PT used): 447 ms
[2022-06-10 08:26:54] [INFO ] Transformed 2826 places.
[2022-06-10 08:26:54] [INFO ] Transformed 8960 transitions.
[2022-06-10 08:26:54] [INFO ] Parsed PT model containing 2826 places and 8960 transitions in 600 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1198 places in 40 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c002-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 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 298 places :
Symmetric choice reduction at 1 with 298 rule applications. Total rules 315 place count 1313 transition count 3700
Iterating global reduction 1 with 298 rules applied. Total rules applied 613 place count 1313 transition count 3700
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 370 transitions.
Iterating post reduction 1 with 370 rules applied. Total rules applied 983 place count 1313 transition count 3330
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 1137 place count 1159 transition count 3022
Iterating global reduction 2 with 154 rules applied. Total rules applied 1291 place count 1159 transition count 3022
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1363 place count 1159 transition count 2950
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1377 place count 1145 transition count 2922
Iterating global reduction 3 with 14 rules applied. Total rules applied 1391 place count 1145 transition count 2922
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1405 place count 1131 transition count 2894
Iterating global reduction 3 with 14 rules applied. Total rules applied 1419 place count 1131 transition count 2894
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1433 place count 1117 transition count 2866
Iterating global reduction 3 with 14 rules applied. Total rules applied 1447 place count 1117 transition count 2866
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1461 place count 1103 transition count 2838
Iterating global reduction 3 with 14 rules applied. Total rules applied 1475 place count 1103 transition count 2838
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1489 place count 1089 transition count 2810
Iterating global reduction 3 with 14 rules applied. Total rules applied 1503 place count 1089 transition count 2810
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1516 place count 1076 transition count 2784
Iterating global reduction 3 with 13 rules applied. Total rules applied 1529 place count 1076 transition count 2784
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1542 place count 1063 transition count 2758
Iterating global reduction 3 with 13 rules applied. Total rules applied 1555 place count 1063 transition count 2758
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1608 place count 1010 transition count 2560
Iterating global reduction 3 with 53 rules applied. Total rules applied 1661 place count 1010 transition count 2560
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1718 place count 953 transition count 2332
Iterating global reduction 3 with 57 rules applied. Total rules applied 1775 place count 953 transition count 2332
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1829 place count 899 transition count 2198
Iterating global reduction 3 with 54 rules applied. Total rules applied 1883 place count 899 transition count 2198
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1937 place count 845 transition count 2090
Iterating global reduction 3 with 54 rules applied. Total rules applied 1991 place count 845 transition count 2090
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2045 place count 791 transition count 1982
Iterating global reduction 3 with 54 rules applied. Total rules applied 2099 place count 791 transition count 1982
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2153 place count 737 transition count 1874
Iterating global reduction 3 with 54 rules applied. Total rules applied 2207 place count 737 transition count 1874
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2261 place count 683 transition count 1766
Iterating global reduction 3 with 54 rules applied. Total rules applied 2315 place count 683 transition count 1766
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 2328 place count 670 transition count 1740
Iterating global reduction 3 with 13 rules applied. Total rules applied 2341 place count 670 transition count 1740
Applied a total of 2341 rules in 1021 ms. Remains 670 /1628 variables (removed 958) and now considering 1740/5962 (removed 4222) transitions.
[2022-06-10 08:26:55] [INFO ] Flow matrix only has 1171 transitions (discarded 569 similar events)
// Phase 1: matrix 1171 rows 670 cols
[2022-06-10 08:26:55] [INFO ] Computed 2 place invariants in 40 ms
[2022-06-10 08:26:56] [INFO ] Implicit Places using invariants in 659 ms returned []
[2022-06-10 08:26:56] [INFO ] Flow matrix only has 1171 transitions (discarded 569 similar events)
// Phase 1: matrix 1171 rows 670 cols
[2022-06-10 08:26:56] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 08:26:56] [INFO ] State equation strengthened by 289 read => feed constraints.
[2022-06-10 08:26:58] [INFO ] Implicit Places using invariants and state equation in 1955 ms returned []
Implicit Place search using SMT with State Equation took 2641 ms to find 0 implicit places.
[2022-06-10 08:26:58] [INFO ] Flow matrix only has 1171 transitions (discarded 569 similar events)
// Phase 1: matrix 1171 rows 670 cols
[2022-06-10 08:26:58] [INFO ] Computed 2 place invariants in 24 ms
[2022-06-10 08:26:59] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 670/1628 places, 1740/5962 transitions.
Finished structural reductions, in 1 iterations. Remains : 670/1628 places, 1740/5962 transitions.
Support contains 18 out of 670 places after structural reductions.
[2022-06-10 08:26:59] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-06-10 08:26:59] [INFO ] Flatten gal took : 148 ms
[2022-06-10 08:26:59] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA FunctionPointer-PT-c002-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-10 08:26:59] [INFO ] Flatten gal took : 105 ms
[2022-06-10 08:26:59] [INFO ] Input system was already deterministic with 1740 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) 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 8) seen :1
Running SMT prover for 7 properties.
[2022-06-10 08:27:00] [INFO ] Flow matrix only has 1171 transitions (discarded 569 similar events)
// Phase 1: matrix 1171 rows 670 cols
[2022-06-10 08:27:00] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 08:27:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 08:27:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-10 08:27:00] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-10 08:27:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 08:27:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 08:27:01] [INFO ] After 470ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2022-06-10 08:27:01] [INFO ] State equation strengthened by 289 read => feed constraints.
[2022-06-10 08:27:01] [INFO ] After 296ms SMT Verify possible using 289 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2022-06-10 08:27:01] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 5 ms to minimize.
[2022-06-10 08:27:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2022-06-10 08:27:02] [INFO ] After 903ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 225 ms.
[2022-06-10 08:27:02] [INFO ] After 1874ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 32 ms.
Support contains 6 out of 670 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 670/670 places, 1740/1740 transitions.
Graph (complete) has 2892 edges and 670 vertex of which 478 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.8 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 478 transition count 1356
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 391 place count 472 transition count 1342
Iterating global reduction 1 with 6 rules applied. Total rules applied 397 place count 472 transition count 1342
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 401 place count 472 transition count 1338
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 406 place count 467 transition count 1328
Iterating global reduction 2 with 5 rules applied. Total rules applied 411 place count 467 transition count 1328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 416 place count 462 transition count 1318
Iterating global reduction 2 with 5 rules applied. Total rules applied 421 place count 462 transition count 1318
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 426 place count 457 transition count 1306
Iterating global reduction 2 with 5 rules applied. Total rules applied 431 place count 457 transition count 1306
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 436 place count 452 transition count 1294
Iterating global reduction 2 with 5 rules applied. Total rules applied 441 place count 452 transition count 1294
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 443 place count 450 transition count 1290
Iterating global reduction 2 with 2 rules applied. Total rules applied 445 place count 450 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 446 place count 449 transition count 1288
Iterating global reduction 2 with 1 rules applied. Total rules applied 447 place count 449 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 448 place count 448 transition count 1286
Iterating global reduction 2 with 1 rules applied. Total rules applied 449 place count 448 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 450 place count 447 transition count 1284
Iterating global reduction 2 with 1 rules applied. Total rules applied 451 place count 447 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 452 place count 446 transition count 1282
Iterating global reduction 2 with 1 rules applied. Total rules applied 453 place count 446 transition count 1282
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 463 place count 446 transition count 1272
Applied a total of 463 rules in 333 ms. Remains 446 /670 variables (removed 224) and now considering 1272/1740 (removed 468) transitions.
Finished structural reductions, in 1 iterations. Remains : 446/670 places, 1272/1740 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 212922 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{3=1, 4=1}
Probabilistic random walk after 212922 steps, saw 130576 distinct states, run finished after 3004 ms. (steps per millisecond=70 ) properties seen :2
Running SMT prover for 3 properties.
[2022-06-10 08:27:06] [INFO ] Flow matrix only has 727 transitions (discarded 545 similar events)
// Phase 1: matrix 727 rows 446 cols
[2022-06-10 08:27:06] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 08:27:06] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-10 08:27:06] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 08:27:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 08:27:06] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-10 08:27:06] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-06-10 08:27:06] [INFO ] After 92ms SMT Verify possible using 84 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-10 08:27:07] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2022-06-10 08:27:07] [INFO ] After 627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 446 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 446/446 places, 1272/1272 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 444 transition count 1268
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 444 transition count 1268
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 443 transition count 1264
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 443 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 442 transition count 1262
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 442 transition count 1262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 441 transition count 1260
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 441 transition count 1260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 440 transition count 1258
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 440 transition count 1258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 439 transition count 1256
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 439 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 438 transition count 1254
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 438 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 437 transition count 1252
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 437 transition count 1252
Applied a total of 18 rules in 124 ms. Remains 437 /446 variables (removed 9) and now considering 1252/1272 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 437/446 places, 1252/1272 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 223919 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223919 steps, saw 137320 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-10 08:27:10] [INFO ] Flow matrix only has 713 transitions (discarded 539 similar events)
// Phase 1: matrix 713 rows 437 cols
[2022-06-10 08:27:10] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 08:27:10] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 08:27:10] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 08:27:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 08:27:10] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-10 08:27:10] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-10 08:27:11] [INFO ] After 130ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-10 08:27:11] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-06-10 08:27:11] [INFO ] After 667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 437 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 437/437 places, 1252/1252 transitions.
Applied a total of 0 rules in 50 ms. Remains 437 /437 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 437/437 places, 1252/1252 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 437/437 places, 1252/1252 transitions.
Applied a total of 0 rules in 79 ms. Remains 437 /437 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2022-06-10 08:27:11] [INFO ] Flow matrix only has 713 transitions (discarded 539 similar events)
// Phase 1: matrix 713 rows 437 cols
[2022-06-10 08:27:11] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-10 08:27:11] [INFO ] Implicit Places using invariants in 337 ms returned []
[2022-06-10 08:27:11] [INFO ] Flow matrix only has 713 transitions (discarded 539 similar events)
// Phase 1: matrix 713 rows 437 cols
[2022-06-10 08:27:11] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 08:27:11] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-10 08:27:12] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2022-06-10 08:27:12] [INFO ] Redundant transitions in 82 ms returned []
[2022-06-10 08:27:12] [INFO ] Flow matrix only has 713 transitions (discarded 539 similar events)
// Phase 1: matrix 713 rows 437 cols
[2022-06-10 08:27:12] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 08:27:13] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 437/437 places, 1252/1252 transitions.
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 551 rules applied. Total rules applied 551 place count 437 transition count 701
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 563 place count 425 transition count 701
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 563 place count 425 transition count 624
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 717 place count 348 transition count 624
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 973 place count 220 transition count 496
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1037 place count 156 transition count 368
Iterating global reduction 2 with 64 rules applied. Total rules applied 1101 place count 156 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1102 place count 156 transition count 367
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1165 place count 93 transition count 241
Iterating global reduction 3 with 63 rules applied. Total rules applied 1228 place count 93 transition count 241
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1291 place count 30 transition count 115
Iterating global reduction 3 with 63 rules applied. Total rules applied 1354 place count 30 transition count 115
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1417 place count 30 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1417 place count 30 transition count 51
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 1419 place count 29 transition count 51
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 4 with 2 rules applied. Total rules applied 1421 place count 28 transition count 50
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 4 with 4 rules applied. Total rules applied 1425 place count 26 transition count 50
Applied a total of 1425 rules in 49 ms. Remains 26 /437 variables (removed 411) and now considering 50/1252 (removed 1202) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 50 rows 26 cols
[2022-06-10 08:27:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 08:27:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 08:27:13] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 08:27:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 08:27:13] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-10 08:27:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 08:27:13] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-10 08:27:13] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-10 08:27:13] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-06-10 08:27:13] [INFO ] Flatten gal took : 3 ms
[2022-06-10 08:27:13] [INFO ] Flatten gal took : 2 ms
[2022-06-10 08:27:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4926686906639303411.gal : 1 ms
[2022-06-10 08:27:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10413123771223861978.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9294069247164115651;'/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/ReachabilityCardinality4926686906639303411.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10413123771223861978.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/ReachabilityCardinality10413123771223861978.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 236
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :236 after 2676
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :2676 after 34920
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :34920 after 471276
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :471276 after 6.71558e+06
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :6.71558e+06 after 9.96596e+07
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :9.96596e+07 after 1.52323e+09
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.52323e+09 after 2.37223e+10
Detected timeout of ITS tools.
[2022-06-10 08:27:28] [INFO ] Flatten gal took : 3 ms
[2022-06-10 08:27:28] [INFO ] Applying decomposition
[2022-06-10 08:27:28] [INFO ] Flatten gal took : 2 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/graph15518983455056785536.txt' '-o' '/tmp/graph15518983455056785536.bin' '-w' '/tmp/graph15518983455056785536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15518983455056785536.bin' '-l' '-1' '-v' '-w' '/tmp/graph15518983455056785536.weights' '-q' '0' '-e' '0.001'
[2022-06-10 08:27:28] [INFO ] Decomposing Gal with order
[2022-06-10 08:27:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 08:27:28] [INFO ] Removed a total of 63 redundant transitions.
[2022-06-10 08:27:28] [INFO ] Flatten gal took : 34 ms
[2022-06-10 08:27:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2022-06-10 08:27:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14999217472887228993.gal : 2 ms
[2022-06-10 08:27:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16796524767734871273.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9294069247164115651;'/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/ReachabilityCardinality14999217472887228993.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16796524767734871273.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/ReachabilityCardinality16796524767734871273.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15560807318070411344
[2022-06-10 08:27:43] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15560807318070411344
Running compilation step : cd /tmp/ltsmin15560807318070411344;'/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 196 ms.
Running link step : cd /tmp/ltsmin15560807318070411344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15560807318070411344;'/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' 'AtomicPropp0==true'
LTSmin run took 68 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin15560807318070411344;'/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' 'AtomicPropp1==true'
LTSmin run took 36 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin15560807318070411344;'/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' 'AtomicPropp5==true'
LTSmin run took 35 ms.
Found Violation
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA FunctionPointer-PT-c002-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((p0 U G(X(p1))))'
Support contains 2 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1740/1740 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 661 transition count 1718
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 661 transition count 1718
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 661 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 654 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 654 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 647 transition count 1682
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 647 transition count 1682
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 640 transition count 1666
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 640 transition count 1666
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 633 transition count 1650
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 633 transition count 1650
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 629 transition count 1642
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 629 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 627 transition count 1638
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 627 transition count 1638
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 625 transition count 1634
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 624 transition count 1632
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 623 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 623 transition count 1630
Applied a total of 98 rules in 153 ms. Remains 623 /670 variables (removed 47) and now considering 1630/1740 (removed 110) transitions.
[2022-06-10 08:27:44] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2022-06-10 08:27:44] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 08:27:44] [INFO ] Implicit Places using invariants in 433 ms returned []
[2022-06-10 08:27:44] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2022-06-10 08:27:44] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 08:27:44] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:27:46] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 2071 ms to find 0 implicit places.
[2022-06-10 08:27:46] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2022-06-10 08:27:46] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 08:27:46] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/670 places, 1630/1740 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/670 places, 1630/1740 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 1 s543), p0:(OR (LEQ 1 s543) (LEQ 3 s544))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c002-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c002-LTLCardinality-00 finished in 3110 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p1))&&p0)))'
Support contains 2 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1740/1740 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 660 transition count 1716
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 660 transition count 1716
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 660 transition count 1714
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 652 transition count 1696
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 652 transition count 1696
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 644 transition count 1674
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 644 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 636 transition count 1654
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 636 transition count 1654
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 628 transition count 1638
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 628 transition count 1638
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 623 transition count 1628
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 623 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 620 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 620 transition count 1622
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 617 transition count 1616
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 615 transition count 1612
Applied a total of 112 rules in 110 ms. Remains 615 /670 variables (removed 55) and now considering 1612/1740 (removed 128) transitions.
[2022-06-10 08:27:47] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2022-06-10 08:27:47] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 08:27:47] [INFO ] Implicit Places using invariants in 404 ms returned []
[2022-06-10 08:27:47] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2022-06-10 08:27:47] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 08:27:47] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 08:27:49] [INFO ] Implicit Places using invariants and state equation in 1692 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
[2022-06-10 08:27:49] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2022-06-10 08:27:49] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 08:27:49] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/670 places, 1612/1740 transitions.
Finished structural reductions, in 1 iterations. Remains : 615/670 places, 1612/1740 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ 2 s21) (LEQ s544 0)), p1:(LEQ s544 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 0 reset in 482 ms.
Stack based approach found an accepted trace after 901 steps with 0 reset with depth 902 and stack size 902 in 4 ms.
FORMULA FunctionPointer-PT-c002-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLCardinality-01 finished in 3330 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(X((X(p0) U p1)))))))'
Support contains 3 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1740/1740 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 661 transition count 1720
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 661 transition count 1720
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 661 transition count 1716
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 654 transition count 1700
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 654 transition count 1700
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 647 transition count 1680
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 647 transition count 1680
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 640 transition count 1660
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 640 transition count 1660
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 633 transition count 1644
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 633 transition count 1644
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 628 transition count 1634
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 628 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 624 transition count 1626
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 624 transition count 1626
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 620 transition count 1618
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 620 transition count 1618
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 617 transition count 1612
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 617 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 616 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 616 transition count 1610
Applied a total of 112 rules in 122 ms. Remains 616 /670 variables (removed 54) and now considering 1610/1740 (removed 130) transitions.
[2022-06-10 08:27:50] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:27:50] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 08:27:50] [INFO ] Implicit Places using invariants in 412 ms returned []
[2022-06-10 08:27:50] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:27:50] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 08:27:51] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:27:52] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 1990 ms to find 0 implicit places.
[2022-06-10 08:27:52] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:27:52] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 08:27:53] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 616/670 places, 1610/1740 transitions.
Finished structural reductions, in 1 iterations. Remains : 616/670 places, 1610/1740 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s534 0), p0:(LEQ s531 s113)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 371 ms.
Product exploration explored 100000 steps with 0 reset in 560 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 p1 p0), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2022-06-10 08:27:54] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:27:54] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 08:27:54] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 08:27:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 08:27:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-10 08:27:54] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 08:27:55] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:27:55] [INFO ] After 78ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:27:55] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-10 08:27:55] [INFO ] After 524ms 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 616 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 616/616 places, 1610/1610 transitions.
Graph (complete) has 2691 edges and 616 vertex of which 424 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.2 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 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 388 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 389 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 420 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 420 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 394 place count 419 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 395 place count 419 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 396 place count 418 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 397 place count 418 transition count 1212
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 399 place count 418 transition count 1210
Applied a total of 399 rules in 147 ms. Remains 418 /616 variables (removed 198) and now considering 1210/1610 (removed 400) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/616 places, 1210/1610 transitions.
Incomplete random walk after 10000 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 574040 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 574040 steps, saw 351991 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 08:27:58] [INFO ] Flow matrix only has 684 transitions (discarded 526 similar events)
// Phase 1: matrix 684 rows 418 cols
[2022-06-10 08:27:58] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-10 08:27:58] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 08:27:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 08:27:58] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 08:27:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 08:27:58] [INFO ] After 41ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:27:58] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-10 08:27:58] [INFO ] After 366ms 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 418 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 1210/1210 transitions.
Applied a total of 0 rules in 48 ms. Remains 418 /418 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 1210/1210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 1210/1210 transitions.
Applied a total of 0 rules in 63 ms. Remains 418 /418 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
[2022-06-10 08:27:58] [INFO ] Flow matrix only has 684 transitions (discarded 526 similar events)
// Phase 1: matrix 684 rows 418 cols
[2022-06-10 08:27:58] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 08:27:59] [INFO ] Implicit Places using invariants in 307 ms returned []
[2022-06-10 08:27:59] [INFO ] Flow matrix only has 684 transitions (discarded 526 similar events)
// Phase 1: matrix 684 rows 418 cols
[2022-06-10 08:27:59] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 08:27:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 08:28:00] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
[2022-06-10 08:28:00] [INFO ] Redundant transitions in 18 ms returned []
[2022-06-10 08:28:00] [INFO ] Flow matrix only has 684 transitions (discarded 526 similar events)
// Phase 1: matrix 684 rows 418 cols
[2022-06-10 08:28:00] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-10 08:28:00] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 1210/1210 transitions.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 538 rules applied. Total rules applied 538 place count 418 transition count 672
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 550 place count 406 transition count 672
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 550 place count 406 transition count 603
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 688 place count 337 transition count 603
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 1 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 940 place count 211 transition count 477
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1004 place count 147 transition count 349
Iterating global reduction 2 with 64 rules applied. Total rules applied 1068 place count 147 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1069 place count 147 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1069 place count 147 transition count 347
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1071 place count 146 transition count 347
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1134 place count 83 transition count 221
Iterating global reduction 3 with 63 rules applied. Total rules applied 1197 place count 83 transition count 221
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1259 place count 21 transition count 97
Iterating global reduction 3 with 62 rules applied. Total rules applied 1321 place count 21 transition count 97
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 1382 place count 21 transition count 36
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 4 with 2 rules applied. Total rules applied 1384 place count 20 transition count 37
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1387 place count 20 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 20 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 19 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 19 transition count 32
Applied a total of 1390 rules in 32 ms. Remains 19 /418 variables (removed 399) and now considering 32/1210 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 19 cols
[2022-06-10 08:28:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 08:28:00] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 08:28:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 08:28:00] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 08:28:00] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:00] [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 08:28:00] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:00] [INFO ] Flatten gal took : 2 ms
[2022-06-10 08:28:00] [INFO ] Flatten gal took : 2 ms
[2022-06-10 08:28:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11146812040531947288.gal : 1 ms
[2022-06-10 08:28:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12955553952105992639.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6952710015998133749;'/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/ReachabilityCardinality11146812040531947288.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12955553952105992639.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...321
Loading property file /tmp/ReachabilityCardinality12955553952105992639.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 85
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :85 after 255
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :255 after 585
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :585 after 1235
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1235 after 2525
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2525 after 5095
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5095 after 10225
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :10225 after 20475
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :20475 after 40965
Detected timeout of ITS tools.
[2022-06-10 08:28:15] [INFO ] Flatten gal took : 3 ms
[2022-06-10 08:28:15] [INFO ] Applying decomposition
[2022-06-10 08:28:15] [INFO ] Flatten gal took : 4 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/graph10856681954102819102.txt' '-o' '/tmp/graph10856681954102819102.bin' '-w' '/tmp/graph10856681954102819102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10856681954102819102.bin' '-l' '-1' '-v' '-w' '/tmp/graph10856681954102819102.weights' '-q' '0' '-e' '0.001'
[2022-06-10 08:28:15] [INFO ] Decomposing Gal with order
[2022-06-10 08:28:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 08:28:15] [INFO ] Removed a total of 18 redundant transitions.
[2022-06-10 08:28:15] [INFO ] Flatten gal took : 4 ms
[2022-06-10 08:28:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 0 ms.
[2022-06-10 08:28:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6228231173472221009.gal : 1 ms
[2022-06-10 08:28:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1780385734273979448.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6952710015998133749;'/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/ReachabilityCardinality6228231173472221009.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1780385734273979448.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/ReachabilityCardinality1780385734273979448.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 108
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :108 after 702
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :702 after 1872
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1872 after 4194
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4194 after 8820
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8820 after 18054
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :18054 after 36504
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :36504 after 73386
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5032699761603154605
[2022-06-10 08:28:30] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5032699761603154605
Running compilation step : cd /tmp/ltsmin5032699761603154605;'/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/ltsmin5032699761603154605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5032699761603154605;'/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' 'apf1==true'
LTSmin run took 99 ms.
Found Violation
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 352 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 1610/1610 transitions.
Applied a total of 0 rules in 10 ms. Remains 616 /616 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2022-06-10 08:28:31] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:28:31] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 08:28:31] [INFO ] Implicit Places using invariants in 461 ms returned []
[2022-06-10 08:28:31] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:28:32] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 08:28:32] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:28:33] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 1987 ms to find 0 implicit places.
[2022-06-10 08:28:33] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:28:33] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 08:28:34] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 616/616 places, 1610/1610 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 p1 p0), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 217 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-06-10 08:28:34] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:28:34] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 08:28:34] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 08:28:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 08:28:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 08:28:34] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:34] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:28:35] [INFO ] After 69ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:35] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-06-10 08:28:35] [INFO ] After 514ms 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 616 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 616/616 places, 1610/1610 transitions.
Graph (complete) has 2691 edges and 616 vertex of which 424 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 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 388 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 389 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 420 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 420 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 394 place count 419 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 395 place count 419 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 396 place count 418 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 397 place count 418 transition count 1212
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 399 place count 418 transition count 1210
Applied a total of 399 rules in 147 ms. Remains 418 /616 variables (removed 198) and now considering 1210/1610 (removed 400) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/616 places, 1210/1610 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 583578 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 583578 steps, saw 357838 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 08:28:38] [INFO ] Flow matrix only has 684 transitions (discarded 526 similar events)
// Phase 1: matrix 684 rows 418 cols
[2022-06-10 08:28:38] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 08:28:38] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 08:28:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 08:28:38] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 08:28:38] [INFO ] After 39ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:38] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-06-10 08:28:38] [INFO ] After 338ms 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 418 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 1210/1210 transitions.
Applied a total of 0 rules in 44 ms. Remains 418 /418 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 1210/1210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 1210/1210 transitions.
Applied a total of 0 rules in 41 ms. Remains 418 /418 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
[2022-06-10 08:28:38] [INFO ] Flow matrix only has 684 transitions (discarded 526 similar events)
// Phase 1: matrix 684 rows 418 cols
[2022-06-10 08:28:38] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-10 08:28:39] [INFO ] Implicit Places using invariants in 313 ms returned []
[2022-06-10 08:28:39] [INFO ] Flow matrix only has 684 transitions (discarded 526 similar events)
// Phase 1: matrix 684 rows 418 cols
[2022-06-10 08:28:39] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 08:28:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 08:28:40] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
[2022-06-10 08:28:40] [INFO ] Redundant transitions in 100 ms returned []
[2022-06-10 08:28:40] [INFO ] Flow matrix only has 684 transitions (discarded 526 similar events)
// Phase 1: matrix 684 rows 418 cols
[2022-06-10 08:28:40] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-10 08:28:40] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 1210/1210 transitions.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 538 rules applied. Total rules applied 538 place count 418 transition count 672
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 550 place count 406 transition count 672
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 550 place count 406 transition count 603
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 688 place count 337 transition count 603
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 940 place count 211 transition count 477
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1004 place count 147 transition count 349
Iterating global reduction 2 with 64 rules applied. Total rules applied 1068 place count 147 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1069 place count 147 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1069 place count 147 transition count 347
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1071 place count 146 transition count 347
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1134 place count 83 transition count 221
Iterating global reduction 3 with 63 rules applied. Total rules applied 1197 place count 83 transition count 221
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1259 place count 21 transition count 97
Iterating global reduction 3 with 62 rules applied. Total rules applied 1321 place count 21 transition count 97
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 1382 place count 21 transition count 36
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 4 with 2 rules applied. Total rules applied 1384 place count 20 transition count 37
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1387 place count 20 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 20 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 19 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 19 transition count 32
Applied a total of 1390 rules in 27 ms. Remains 19 /418 variables (removed 399) and now considering 32/1210 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 19 cols
[2022-06-10 08:28:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 08:28:40] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 08:28:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 08:28:40] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 08:28:40] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:40] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-10 08:28:40] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:28:40] [INFO ] Flatten gal took : 4 ms
[2022-06-10 08:28:40] [INFO ] Flatten gal took : 2 ms
[2022-06-10 08:28:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16137565132976901729.gal : 1 ms
[2022-06-10 08:28:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality384991124462538213.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10799364911650868860;'/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/ReachabilityCardinality16137565132976901729.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality384991124462538213.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/ReachabilityCardinality384991124462538213.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 85
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :85 after 255
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :255 after 585
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :585 after 1235
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1235 after 2525
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2525 after 5095
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5095 after 10225
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :10225 after 20475
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :20475 after 40965
Detected timeout of ITS tools.
[2022-06-10 08:28:55] [INFO ] Flatten gal took : 3 ms
[2022-06-10 08:28:55] [INFO ] Applying decomposition
[2022-06-10 08:28:55] [INFO ] Flatten gal took : 2 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/graph3748406276651203878.txt' '-o' '/tmp/graph3748406276651203878.bin' '-w' '/tmp/graph3748406276651203878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3748406276651203878.bin' '-l' '-1' '-v' '-w' '/tmp/graph3748406276651203878.weights' '-q' '0' '-e' '0.001'
[2022-06-10 08:28:55] [INFO ] Decomposing Gal with order
[2022-06-10 08:28:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 08:28:55] [INFO ] Removed a total of 18 redundant transitions.
[2022-06-10 08:28:55] [INFO ] Flatten gal took : 4 ms
[2022-06-10 08:28:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 1 ms.
[2022-06-10 08:28:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11114540981059781699.gal : 0 ms
[2022-06-10 08:28:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4639212486610213135.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10799364911650868860;'/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/ReachabilityCardinality11114540981059781699.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4639212486610213135.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/ReachabilityCardinality4639212486610213135.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 108
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :108 after 702
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :702 after 1872
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1872 after 4194
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4194 after 8820
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8820 after 18054
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :18054 after 36504
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :36504 after 73386
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11329945775310793140
[2022-06-10 08:29:10] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11329945775310793140
Running compilation step : cd /tmp/ltsmin11329945775310793140;'/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/ltsmin11329945775310793140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11329945775310793140;'/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' 'apf1==true'
LTSmin run took 38 ms.
Found Violation
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 364 ms.
Product exploration explored 100000 steps with 0 reset in 465 ms.
Built C files in :
/tmp/ltsmin10137145366357826780
[2022-06-10 08:29:12] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10137145366357826780
Running compilation step : cd /tmp/ltsmin10137145366357826780;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10137145366357826780;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10137145366357826780;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 1610/1610 transitions.
Applied a total of 0 rules in 16 ms. Remains 616 /616 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2022-06-10 08:29:15] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:29:15] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 08:29:15] [INFO ] Implicit Places using invariants in 430 ms returned []
[2022-06-10 08:29:15] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:29:15] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 08:29:16] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:29:17] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
[2022-06-10 08:29:17] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:29:17] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 08:29:18] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 616/616 places, 1610/1610 transitions.
Built C files in :
/tmp/ltsmin10194080050936151386
[2022-06-10 08:29:18] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10194080050936151386
Running compilation step : cd /tmp/ltsmin10194080050936151386;'/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 2784 ms.
Running link step : cd /tmp/ltsmin10194080050936151386;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10194080050936151386;'/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/stateBased17868834307250410765.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 08:29:33] [INFO ] Flatten gal took : 61 ms
[2022-06-10 08:29:33] [INFO ] Flatten gal took : 64 ms
[2022-06-10 08:29:33] [INFO ] Time to serialize gal into /tmp/LTL7642208242821855377.gal : 12 ms
[2022-06-10 08:29:33] [INFO ] Time to serialize properties into /tmp/LTL9887818874126022944.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/LTL7642208242821855377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9887818874126022944.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/LTL7642208...266
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X(X((X("(l1346<=l491)"))U("(l1426<=0)"))))))))
Formula 0 simplified : !XFGXX(X"(l1346<=l491)" U "(l1426<=0)")
Detected timeout of ITS tools.
[2022-06-10 08:29:48] [INFO ] Flatten gal took : 51 ms
[2022-06-10 08:29:48] [INFO ] Applying decomposition
[2022-06-10 08:29:48] [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/graph6364149610793850680.txt' '-o' '/tmp/graph6364149610793850680.bin' '-w' '/tmp/graph6364149610793850680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6364149610793850680.bin' '-l' '-1' '-v' '-w' '/tmp/graph6364149610793850680.weights' '-q' '0' '-e' '0.001'
[2022-06-10 08:29:48] [INFO ] Decomposing Gal with order
[2022-06-10 08:29:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 08:29:48] [INFO ] Removed a total of 566 redundant transitions.
[2022-06-10 08:29:48] [INFO ] Flatten gal took : 151 ms
[2022-06-10 08:29:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 271 labels/synchronizations in 22 ms.
[2022-06-10 08:29:48] [INFO ] Time to serialize gal into /tmp/LTL6773850402914856770.gal : 7 ms
[2022-06-10 08:29:48] [INFO ] Time to serialize properties into /tmp/LTL14657118964621034201.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/LTL6773850402914856770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14657118964621034201.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/LTL6773850...267
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X(X((X("(gu1.l1346<=gu1.l491)"))U("(gi0.gu62.l1426<=0)"))))))))
Formula 0 simplified : !XFGXX(X"(gu1.l1346<=gu1.l491)" U "(gi0.gu62.l1426<=0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18376982377810669402
[2022-06-10 08:30:04] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18376982377810669402
Running compilation step : cd /tmp/ltsmin18376982377810669402;'/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 2797 ms.
Running link step : cd /tmp/ltsmin18376982377810669402;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18376982377810669402;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](X(X((X((LTLAPp0==true)) U (LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c002-LTLCardinality-03 finished in 148703 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1740/1740 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 659 transition count 1714
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 659 transition count 1714
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 659 transition count 1710
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 650 transition count 1690
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 650 transition count 1690
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 641 transition count 1666
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 641 transition count 1666
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 71 place count 632 transition count 1642
Iterating global reduction 1 with 9 rules applied. Total rules applied 80 place count 632 transition count 1642
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 89 place count 623 transition count 1622
Iterating global reduction 1 with 9 rules applied. Total rules applied 98 place count 623 transition count 1622
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 617 transition count 1610
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 617 transition count 1610
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 114 place count 613 transition count 1602
Iterating global reduction 1 with 4 rules applied. Total rules applied 118 place count 613 transition count 1602
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 609 transition count 1594
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 609 transition count 1594
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 606 transition count 1588
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 605 transition count 1586
Applied a total of 134 rules in 108 ms. Remains 605 /670 variables (removed 65) and now considering 1586/1740 (removed 154) transitions.
[2022-06-10 08:30:19] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 08:30:19] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 08:30:19] [INFO ] Implicit Places using invariants in 415 ms returned []
[2022-06-10 08:30:19] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 08:30:19] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 08:30:19] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 08:30:21] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 2190 ms to find 0 implicit places.
[2022-06-10 08:30:21] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 08:30:21] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 08:30:21] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/670 places, 1586/1740 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/670 places, 1586/1740 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s41)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c002-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c002-LTLCardinality-06 finished in 2924 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 670 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 670/670 places, 1740/1740 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 661 transition count 1718
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 661 transition count 1718
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 661 transition count 1716
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 654 transition count 1700
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 654 transition count 1700
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 647 transition count 1680
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 647 transition count 1680
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 55 place count 640 transition count 1662
Iterating global reduction 1 with 7 rules applied. Total rules applied 62 place count 640 transition count 1662
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 69 place count 633 transition count 1648
Iterating global reduction 1 with 7 rules applied. Total rules applied 76 place count 633 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 628 transition count 1638
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 628 transition count 1638
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 625 transition count 1632
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 625 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 622 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 622 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 620 transition count 1622
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 620 transition count 1622
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 620 transition count 1618
Applied a total of 106 rules in 399 ms. Remains 620 /670 variables (removed 50) and now considering 1618/1740 (removed 122) transitions.
[2022-06-10 08:30:22] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
// Phase 1: matrix 1082 rows 620 cols
[2022-06-10 08:30:22] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 08:30:22] [INFO ] Implicit Places using invariants in 441 ms returned []
[2022-06-10 08:30:22] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
// Phase 1: matrix 1082 rows 620 cols
[2022-06-10 08:30:22] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 08:30:23] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:30:24] [INFO ] Implicit Places using invariants and state equation in 1922 ms returned []
Implicit Place search using SMT with State Equation took 2365 ms to find 0 implicit places.
[2022-06-10 08:30:24] [INFO ] Redundant transitions in 27 ms returned []
[2022-06-10 08:30:24] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
// Phase 1: matrix 1082 rows 620 cols
[2022-06-10 08:30:24] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 08:30:25] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 620/670 places, 1618/1740 transitions.
Finished structural reductions, in 1 iterations. Remains : 620/670 places, 1618/1740 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-11 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 (GT s13 s557) (LEQ s549 s531))], 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 396 ms.
Product exploration explored 100000 steps with 0 reset in 473 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 93 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 43 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Finished Best-First random walk after 564 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=282 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 4 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1618/1618 transitions.
Applied a total of 0 rules in 87 ms. Remains 620 /620 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
[2022-06-10 08:30:26] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
// Phase 1: matrix 1082 rows 620 cols
[2022-06-10 08:30:26] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 08:30:27] [INFO ] Implicit Places using invariants in 411 ms returned []
[2022-06-10 08:30:27] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
// Phase 1: matrix 1082 rows 620 cols
[2022-06-10 08:30:27] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 08:30:27] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:30:29] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 2423 ms to find 0 implicit places.
[2022-06-10 08:30:29] [INFO ] Redundant transitions in 31 ms returned []
[2022-06-10 08:30:29] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
// Phase 1: matrix 1082 rows 620 cols
[2022-06-10 08:30:29] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 08:30:29] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 620/620 places, 1618/1618 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 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Finished Best-First random walk after 676 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=338 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 360 ms.
Product exploration explored 100000 steps with 0 reset in 446 ms.
Built C files in :
/tmp/ltsmin13479015167937544450
[2022-06-10 08:30:31] [INFO ] Too many transitions (1618) to apply POR reductions. Disabling POR matrices.
[2022-06-10 08:30:31] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13479015167937544450
Running compilation step : cd /tmp/ltsmin13479015167937544450;'/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 2827 ms.
Running link step : cd /tmp/ltsmin13479015167937544450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13479015167937544450;'/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/stateBased12439754158897380271.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1618/1618 transitions.
Applied a total of 0 rules in 75 ms. Remains 620 /620 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
[2022-06-10 08:30:46] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
// Phase 1: matrix 1082 rows 620 cols
[2022-06-10 08:30:46] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 08:30:46] [INFO ] Implicit Places using invariants in 428 ms returned []
[2022-06-10 08:30:46] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
// Phase 1: matrix 1082 rows 620 cols
[2022-06-10 08:30:46] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 08:30:46] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:30:48] [INFO ] Implicit Places using invariants and state equation in 1734 ms returned []
Implicit Place search using SMT with State Equation took 2164 ms to find 0 implicit places.
[2022-06-10 08:30:48] [INFO ] Redundant transitions in 29 ms returned []
[2022-06-10 08:30:48] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
// Phase 1: matrix 1082 rows 620 cols
[2022-06-10 08:30:48] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 08:30:48] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 620/620 places, 1618/1618 transitions.
Built C files in :
/tmp/ltsmin16322300741166950852
[2022-06-10 08:30:48] [INFO ] Too many transitions (1618) to apply POR reductions. Disabling POR matrices.
[2022-06-10 08:30:48] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16322300741166950852
Running compilation step : cd /tmp/ltsmin16322300741166950852;'/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 2864 ms.
Running link step : cd /tmp/ltsmin16322300741166950852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16322300741166950852;'/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/stateBased17617917474716181130.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 08:31:03] [INFO ] Flatten gal took : 47 ms
[2022-06-10 08:31:04] [INFO ] Flatten gal took : 48 ms
[2022-06-10 08:31:04] [INFO ] Time to serialize gal into /tmp/LTL10228086050576124195.gal : 5 ms
[2022-06-10 08:31:04] [INFO ] Time to serialize properties into /tmp/LTL6753513128760386245.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/LTL10228086050576124195.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6753513128760386245.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/LTL1022808...267
Read 1 LTL properties
Checking formula 0 : !((F(G("((l240>l2625)||(l2158<=l1359))"))))
Formula 0 simplified : !FG"((l240>l2625)||(l2158<=l1359))"
Detected timeout of ITS tools.
[2022-06-10 08:31:19] [INFO ] Flatten gal took : 54 ms
[2022-06-10 08:31:19] [INFO ] Applying decomposition
[2022-06-10 08:31:19] [INFO ] Flatten gal took : 41 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/graph6818483244606168145.txt' '-o' '/tmp/graph6818483244606168145.bin' '-w' '/tmp/graph6818483244606168145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6818483244606168145.bin' '-l' '-1' '-v' '-w' '/tmp/graph6818483244606168145.weights' '-q' '0' '-e' '0.001'
[2022-06-10 08:31:19] [INFO ] Decomposing Gal with order
[2022-06-10 08:31:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 08:31:19] [INFO ] Removed a total of 547 redundant transitions.
[2022-06-10 08:31:19] [INFO ] Flatten gal took : 94 ms
[2022-06-10 08:31:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 278 labels/synchronizations in 12 ms.
[2022-06-10 08:31:19] [INFO ] Time to serialize gal into /tmp/LTL15192501006105567496.gal : 6 ms
[2022-06-10 08:31:19] [INFO ] Time to serialize properties into /tmp/LTL16026068539149134685.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/LTL15192501006105567496.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16026068539149134685.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/LTL1519250...268
Read 1 LTL properties
Checking formula 0 : !((F(G("((gu1.l240>gu1.l2625)||(gu62.l2158<=gu62.l1359))"))))
Formula 0 simplified : !FG"((gu1.l240>gu1.l2625)||(gu62.l2158<=gu62.l1359))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13697851409662224342
[2022-06-10 08:31:34] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13697851409662224342
Running compilation step : cd /tmp/ltsmin13697851409662224342;'/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 2882 ms.
Running link step : cd /tmp/ltsmin13697851409662224342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13697851409662224342;'/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-c002-LTLCardinality-11 finished in 87611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(X(X(p1))))))'
Support contains 3 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1740/1740 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 660 transition count 1718
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 660 transition count 1718
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 660 transition count 1714
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 652 transition count 1696
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 652 transition count 1696
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 644 transition count 1674
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 644 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 636 transition count 1652
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 636 transition count 1652
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 628 transition count 1634
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 628 transition count 1634
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 623 transition count 1624
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 623 transition count 1624
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 619 transition count 1616
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 619 transition count 1616
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 615 transition count 1608
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 615 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 612 transition count 1602
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 611 transition count 1600
Applied a total of 122 rules in 118 ms. Remains 611 /670 variables (removed 59) and now considering 1600/1740 (removed 140) transitions.
[2022-06-10 08:31:49] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
// Phase 1: matrix 1069 rows 611 cols
[2022-06-10 08:31:49] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 08:31:50] [INFO ] Implicit Places using invariants in 403 ms returned []
[2022-06-10 08:31:50] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
// Phase 1: matrix 1069 rows 611 cols
[2022-06-10 08:31:50] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 08:31:50] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 08:31:51] [INFO ] Implicit Places using invariants and state equation in 1508 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
[2022-06-10 08:31:51] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
// Phase 1: matrix 1069 rows 611 cols
[2022-06-10 08:31:51] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 08:31:52] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 611/670 places, 1600/1740 transitions.
Finished structural reductions, in 1 iterations. Remains : 611/670 places, 1600/1740 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(GT 1 s364), p1:(LEQ s610 s529)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 934 ms.
Product exploration explored 100000 steps with 50000 reset in 796 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 p1), (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 63 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FunctionPointer-PT-c002-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c002-LTLCardinality-12 finished in 4655 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1740/1740 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 660 transition count 1716
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 660 transition count 1716
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 660 transition count 1712
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 652 transition count 1696
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 652 transition count 1696
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 644 transition count 1676
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 644 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 636 transition count 1654
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 636 transition count 1654
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 628 transition count 1636
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 628 transition count 1636
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 623 transition count 1626
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 620 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 620 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 617 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 614 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 613 transition count 1606
Applied a total of 118 rules in 108 ms. Remains 613 /670 variables (removed 57) and now considering 1606/1740 (removed 134) transitions.
[2022-06-10 08:31:54] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 08:31:54] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 08:31:54] [INFO ] Implicit Places using invariants in 459 ms returned []
[2022-06-10 08:31:54] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 08:31:54] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 08:31:55] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 08:31:56] [INFO ] Implicit Places using invariants and state equation in 2019 ms returned []
Implicit Place search using SMT with State Equation took 2482 ms to find 0 implicit places.
[2022-06-10 08:31:56] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 08:31:56] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 08:31:57] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/670 places, 1606/1740 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/670 places, 1606/1740 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s533 s550)], 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]]
Product exploration explored 100000 steps with 0 reset in 382 ms.
Product exploration explored 100000 steps with 0 reset in 425 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, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 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
Finished probabilistic random walk after 10090 steps, run visited all 1 properties in 65 ms. (steps per millisecond=155 )
Probabilistic random walk after 10090 steps, saw 6570 distinct states, run finished after 66 ms. (steps per millisecond=152 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 13 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2022-06-10 08:31:59] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 08:31:59] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 08:31:59] [INFO ] Implicit Places using invariants in 418 ms returned []
[2022-06-10 08:31:59] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 08:31:59] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 08:31:59] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 08:32:01] [INFO ] Implicit Places using invariants and state equation in 1829 ms returned []
Implicit Place search using SMT with State Equation took 2249 ms to find 0 implicit places.
[2022-06-10 08:32:01] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 08:32:01] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 08:32:01] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/613 places, 1606/1606 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) 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
Finished probabilistic random walk after 10090 steps, run visited all 1 properties in 62 ms. (steps per millisecond=162 )
Probabilistic random walk after 10090 steps, saw 6570 distinct states, run finished after 63 ms. (steps per millisecond=160 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 345 ms.
Product exploration explored 100000 steps with 0 reset in 388 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1606/1606 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 613 transition count 1602
Applied a total of 4 rules in 192 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
[2022-06-10 08:32:03] [INFO ] Redundant transitions in 22 ms returned []
[2022-06-10 08:32:03] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2022-06-10 08:32:03] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 08:32:04] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/613 places, 1602/1606 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/613 places, 1602/1606 transitions.
Product exploration explored 100000 steps with 0 reset in 337 ms.
Product exploration explored 100000 steps with 0 reset in 444 ms.
Built C files in :
/tmp/ltsmin12242742538255116666
[2022-06-10 08:32:05] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12242742538255116666
Running compilation step : cd /tmp/ltsmin12242742538255116666;'/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 2917 ms.
Running link step : cd /tmp/ltsmin12242742538255116666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12242742538255116666;'/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/stateBased3750793850895272893.hoa' '--buchi-type=spotba'
LTSmin run took 8649 ms.
FORMULA FunctionPointer-PT-c002-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c002-LTLCardinality-13 finished in 22470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(X((X(p0) U p1)))))))'
Found a SL insensitive property : FunctionPointer-PT-c002-LTLCardinality-03
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 670 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 670/670 places, 1740/1740 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 661 transition count 1720
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 661 transition count 1720
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 661 transition count 1716
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 654 transition count 1700
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 654 transition count 1700
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 647 transition count 1680
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 647 transition count 1680
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 640 transition count 1660
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 640 transition count 1660
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 633 transition count 1644
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 633 transition count 1644
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 628 transition count 1634
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 628 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 624 transition count 1626
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 624 transition count 1626
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 620 transition count 1618
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 620 transition count 1618
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 617 transition count 1612
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 617 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 616 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 616 transition count 1610
Applied a total of 112 rules in 187 ms. Remains 616 /670 variables (removed 54) and now considering 1610/1740 (removed 130) transitions.
[2022-06-10 08:32:17] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:32:17] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 08:32:17] [INFO ] Implicit Places using invariants in 428 ms returned []
[2022-06-10 08:32:17] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:32:17] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 08:32:17] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:32:19] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 1967 ms to find 0 implicit places.
[2022-06-10 08:32:19] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:32:19] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 08:32:19] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 616/670 places, 1610/1740 transitions.
Finished structural reductions, in 1 iterations. Remains : 616/670 places, 1610/1740 transitions.
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s534 0), p0:(LEQ s531 s113)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 367 ms.
Product exploration explored 100000 steps with 0 reset in 438 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 p1 p0), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) 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 2) seen :1
Running SMT prover for 1 properties.
[2022-06-10 08:32:20] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:32:20] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 08:32:20] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 08:32:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 08:32:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 08:32:21] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 08:32:21] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:32:21] [INFO ] After 70ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:32:21] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-06-10 08:32:21] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 616 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 616/616 places, 1610/1610 transitions.
Graph (complete) has 2691 edges and 616 vertex of which 424 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.2 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 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 423 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 423 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 388 place count 422 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 389 place count 422 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 421 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 421 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 420 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 420 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 394 place count 419 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 395 place count 419 transition count 1216
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 399 place count 419 transition count 1212
Applied a total of 399 rules in 143 ms. Remains 419 /616 variables (removed 197) and now considering 1212/1610 (removed 398) transitions.
Finished structural reductions, in 1 iterations. Remains : 419/616 places, 1212/1610 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 558661 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :{}
Probabilistic random walk after 558661 steps, saw 342562 distinct states, run finished after 3004 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 08:32:24] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2022-06-10 08:32:24] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-10 08:32:24] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 08:32:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 08:32:24] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 08:32:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 08:32:24] [INFO ] After 38ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:32:24] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-06-10 08:32:25] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 49 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 46 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2022-06-10 08:32:25] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2022-06-10 08:32:25] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-10 08:32:25] [INFO ] Implicit Places using invariants in 297 ms returned []
[2022-06-10 08:32:25] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2022-06-10 08:32:25] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 08:32:25] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 08:32:26] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2022-06-10 08:32:26] [INFO ] Redundant transitions in 20 ms returned []
[2022-06-10 08:32:26] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2022-06-10 08:32:26] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-10 08:32:26] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 1212/1212 transitions.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 419 transition count 673
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 551 place count 407 transition count 673
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 551 place count 407 transition count 604
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 689 place count 338 transition count 604
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 945 place count 210 transition count 476
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1009 place count 146 transition count 348
Iterating global reduction 2 with 64 rules applied. Total rules applied 1073 place count 146 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1074 place count 146 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1074 place count 146 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1076 place count 145 transition count 346
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1139 place count 82 transition count 220
Iterating global reduction 3 with 63 rules applied. Total rules applied 1202 place count 82 transition count 220
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1265 place count 19 transition count 94
Iterating global reduction 3 with 63 rules applied. Total rules applied 1328 place count 19 transition count 94
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1391 place count 19 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1391 place count 19 transition count 30
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 1393 place count 18 transition count 30
Applied a total of 1393 rules in 26 ms. Remains 18 /419 variables (removed 401) and now considering 30/1212 (removed 1182) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 18 cols
[2022-06-10 08:32:26] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 08:32:26] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 08:32:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-10 08:32:26] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 08:32:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 08:32:26] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:32:26] [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 1 ms.
[2022-06-10 08:32:26] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:32:26] [INFO ] Flatten gal took : 2 ms
[2022-06-10 08:32:26] [INFO ] Flatten gal took : 1 ms
[2022-06-10 08:32:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9882091952378679099.gal : 1 ms
[2022-06-10 08:32:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15772114733552586469.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13979436367673127198;'/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/ReachabilityCardinality9882091952378679099.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15772114733552586469.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/ReachabilityCardinality15772114733552586469.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 46
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :46 after 82
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :82 after 150
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :150 after 282
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :282 after 542
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :542 after 1058
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1058 after 2086
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2086 after 4138
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4138 after 8238
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8238 after 16434
Detected timeout of ITS tools.
[2022-06-10 08:32:41] [INFO ] Flatten gal took : 3 ms
[2022-06-10 08:32:41] [INFO ] Applying decomposition
[2022-06-10 08:32:41] [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/graph1283402214956721841.txt' '-o' '/tmp/graph1283402214956721841.bin' '-w' '/tmp/graph1283402214956721841.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1283402214956721841.bin' '-l' '-1' '-v' '-w' '/tmp/graph1283402214956721841.weights' '-q' '0' '-e' '0.001'
[2022-06-10 08:32:41] [INFO ] Decomposing Gal with order
[2022-06-10 08:32:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 08:32:41] [INFO ] Removed a total of 29 redundant transitions.
[2022-06-10 08:32:41] [INFO ] Flatten gal took : 2 ms
[2022-06-10 08:32:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-06-10 08:32:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11959031601041175097.gal : 20 ms
[2022-06-10 08:32:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3673352510043432011.prop : 2 ms
Invoking ITS tools like this :cd /tmp/redAtoms13979436367673127198;'/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/ReachabilityCardinality11959031601041175097.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3673352510043432011.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/ReachabilityCardinality3673352510043432011.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6883584080570819641
[2022-06-10 08:32:56] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6883584080570819641
Running compilation step : cd /tmp/ltsmin6883584080570819641;'/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 107 ms.
Running link step : cd /tmp/ltsmin6883584080570819641;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6883584080570819641;'/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 151 ms.
Found Violation
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 291 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 1610/1610 transitions.
Applied a total of 0 rules in 16 ms. Remains 616 /616 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2022-06-10 08:32:57] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:32:57] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 08:32:58] [INFO ] Implicit Places using invariants in 436 ms returned []
[2022-06-10 08:32:58] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:32:58] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 08:32:58] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:32:59] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 1992 ms to find 0 implicit places.
[2022-06-10 08:32:59] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:32:59] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 08:33:00] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 616/616 places, 1610/1610 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 p1 p0), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 209 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-06-10 08:33:00] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:33:00] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 08:33:00] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 08:33:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 08:33:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 08:33:01] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 08:33:01] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:33:01] [INFO ] After 74ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 08:33:01] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-10 08:33:01] [INFO ] After 514ms 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 616 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 616/616 places, 1610/1610 transitions.
Graph (complete) has 2691 edges and 616 vertex of which 424 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 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 388 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 389 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 420 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 420 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 394 place count 419 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 395 place count 419 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 396 place count 418 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 397 place count 418 transition count 1212
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 399 place count 418 transition count 1210
Applied a total of 399 rules in 141 ms. Remains 418 /616 variables (removed 198) and now considering 1210/1610 (removed 400) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/616 places, 1210/1610 transitions.
Finished random walk after 3385 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=376 )
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 360 ms.
Product exploration explored 100000 steps with 0 reset in 415 ms.
Built C files in :
/tmp/ltsmin1021977987030516091
[2022-06-10 08:33:02] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1021977987030516091
Running compilation step : cd /tmp/ltsmin1021977987030516091;'/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 2876 ms.
Running link step : cd /tmp/ltsmin1021977987030516091;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1021977987030516091;'/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/stateBased7449254967257640963.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 1610/1610 transitions.
Applied a total of 0 rules in 16 ms. Remains 616 /616 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2022-06-10 08:33:17] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:33:17] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 08:33:18] [INFO ] Implicit Places using invariants in 400 ms returned []
[2022-06-10 08:33:18] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:33:18] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 08:33:18] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 08:33:20] [INFO ] Implicit Places using invariants and state equation in 1710 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
[2022-06-10 08:33:20] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2022-06-10 08:33:20] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 08:33:20] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 616/616 places, 1610/1610 transitions.
Built C files in :
/tmp/ltsmin17881744347982304335
[2022-06-10 08:33:20] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17881744347982304335
Running compilation step : cd /tmp/ltsmin17881744347982304335;'/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 2789 ms.
Running link step : cd /tmp/ltsmin17881744347982304335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17881744347982304335;'/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/stateBased15073024031072080361.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 08:33:35] [INFO ] Flatten gal took : 40 ms
[2022-06-10 08:33:35] [INFO ] Flatten gal took : 40 ms
[2022-06-10 08:33:35] [INFO ] Time to serialize gal into /tmp/LTL9594704872086087039.gal : 4 ms
[2022-06-10 08:33:35] [INFO ] Time to serialize properties into /tmp/LTL5078221325663914260.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/LTL9594704872086087039.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5078221325663914260.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/LTL9594704...266
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X(X((X("(l1346<=l491)"))U("(l1426<=0)"))))))))
Formula 0 simplified : !XFGXX(X"(l1346<=l491)" U "(l1426<=0)")
Detected timeout of ITS tools.
[2022-06-10 08:33:50] [INFO ] Flatten gal took : 40 ms
[2022-06-10 08:33:50] [INFO ] Applying decomposition
[2022-06-10 08:33:50] [INFO ] Flatten gal took : 39 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/graph15642104183840180857.txt' '-o' '/tmp/graph15642104183840180857.bin' '-w' '/tmp/graph15642104183840180857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15642104183840180857.bin' '-l' '-1' '-v' '-w' '/tmp/graph15642104183840180857.weights' '-q' '0' '-e' '0.001'
[2022-06-10 08:33:51] [INFO ] Decomposing Gal with order
[2022-06-10 08:33:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 08:33:51] [INFO ] Removed a total of 577 redundant transitions.
[2022-06-10 08:33:51] [INFO ] Flatten gal took : 98 ms
[2022-06-10 08:33:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 13 ms.
[2022-06-10 08:33:51] [INFO ] Time to serialize gal into /tmp/LTL12043336237437761396.gal : 4 ms
[2022-06-10 08:33:51] [INFO ] Time to serialize properties into /tmp/LTL2011334611587154996.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/LTL12043336237437761396.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2011334611587154996.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/LTL1204333...267
Read 1 LTL properties
Checking formula 0 : !((X(F(G(X(X((X("(gu1.l1346<=gu1.l491)"))U("(gi0.gu0.l1426<=0)"))))))))
Formula 0 simplified : !XFGXX(X"(gu1.l1346<=gu1.l491)" U "(gi0.gu0.l1426<=0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8460018277490132829
[2022-06-10 08:34:06] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8460018277490132829
Running compilation step : cd /tmp/ltsmin8460018277490132829;'/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 2833 ms.
Running link step : cd /tmp/ltsmin8460018277490132829;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8460018277490132829;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](X(X((X((LTLAPp0==true)) U (LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c002-LTLCardinality-03 finished in 124604 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2022-06-10 08:34:21] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4431521734449222348
[2022-06-10 08:34:21] [INFO ] Too many transitions (1740) to apply POR reductions. Disabling POR matrices.
[2022-06-10 08:34:21] [INFO ] Applying decomposition
[2022-06-10 08:34:21] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4431521734449222348
Running compilation step : cd /tmp/ltsmin4431521734449222348;'/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 08:34:21] [INFO ] Flatten gal took : 43 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/graph17611745090736108347.txt' '-o' '/tmp/graph17611745090736108347.bin' '-w' '/tmp/graph17611745090736108347.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17611745090736108347.bin' '-l' '-1' '-v' '-w' '/tmp/graph17611745090736108347.weights' '-q' '0' '-e' '0.001'
[2022-06-10 08:34:21] [INFO ] Decomposing Gal with order
[2022-06-10 08:34:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 08:34:21] [INFO ] Removed a total of 563 redundant transitions.
[2022-06-10 08:34:21] [INFO ] Flatten gal took : 97 ms
[2022-06-10 08:34:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 10 ms.
[2022-06-10 08:34:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality14638374877932317307.gal : 5 ms
[2022-06-10 08:34:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality110985409347701470.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/LTLCardinality14638374877932317307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality110985409347701470.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/LTLCardina...288
Read 2 LTL properties
Checking formula 0 : !((X(F(G(X(X((X("(gu3.l1346<=gu3.l491)"))U("(gi0.gu1.l1426<=0)"))))))))
Formula 0 simplified : !XFGXX(X"(gu3.l1346<=gu3.l491)" U "(gi0.gu1.l1426<=0)")
Compilation finished in 3241 ms.
Running link step : cd /tmp/ltsmin4431521734449222348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4431521734449222348;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](X(X((X((LTLAPp0==true)) U (LTLAPp1==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: LTL layer: formula: X(<>([](X(X((X((LTLAPp0==true)) U (LTLAPp1==true)))))))
pins2lts-mc-linux64( 1/ 8), 0.013: "X(<>([](X(X((X((LTLAPp0==true)) U (LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.155: There are 1744 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.155: State length is 671, there are 1744 groups
pins2lts-mc-linux64( 0/ 8), 0.155: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.155: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.155: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.155: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.236: [Blue] ~120 levels ~960 states ~3696 transitions
pins2lts-mc-linux64( 3/ 8), 0.319: [Blue] ~240 levels ~1920 states ~7616 transitions
pins2lts-mc-linux64( 1/ 8), 0.487: [Blue] ~454 levels ~3840 states ~15152 transitions
pins2lts-mc-linux64( 1/ 8), 0.801: [Blue] ~866 levels ~7680 states ~32248 transitions
pins2lts-mc-linux64( 1/ 8), 1.316: [Blue] ~1624 levels ~15360 states ~64600 transitions
pins2lts-mc-linux64( 1/ 8), 2.280: [Blue] ~3265 levels ~30720 states ~133552 transitions
pins2lts-mc-linux64( 1/ 8), 3.922: [Blue] ~6459 levels ~61440 states ~272656 transitions
pins2lts-mc-linux64( 3/ 8), 7.302: [Blue] ~15360 levels ~122880 states ~501536 transitions
pins2lts-mc-linux64( 3/ 8), 13.490: [Blue] ~30720 levels ~245760 states ~1003296 transitions
pins2lts-mc-linux64( 4/ 8), 25.240: [Blue] ~61440 levels ~491520 states ~1993184 transitions
pins2lts-mc-linux64( 4/ 8), 48.300: [Blue] ~122880 levels ~983040 states ~3986568 transitions
pins2lts-mc-linux64( 3/ 8), 94.971: [Blue] ~245760 levels ~1966080 states ~8027936 transitions
pins2lts-mc-linux64( 3/ 8), 188.198: [Blue] ~491520 levels ~3932160 states ~16056096 transitions
pins2lts-mc-linux64( 0/ 8), 222.109: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 222.276:
pins2lts-mc-linux64( 0/ 8), 222.276: Explored 4535399 states 18991019 transitions, fanout: 4.187
pins2lts-mc-linux64( 0/ 8), 222.276: Total exploration time 222.110 sec (221.940 sec minimum, 222.021 sec on average)
pins2lts-mc-linux64( 0/ 8), 222.276: States per second: 20420, Transitions per second: 85503
pins2lts-mc-linux64( 0/ 8), 222.276:
pins2lts-mc-linux64( 0/ 8), 222.276: State space has 16894988 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 222.276: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 222.276: blue states: 4535399 (26.84%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 222.276: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 222.276: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 222.276:
pins2lts-mc-linux64( 0/ 8), 222.276: Total memory used for local state coloring: 67.6MB
pins2lts-mc-linux64( 0/ 8), 222.276:
pins2lts-mc-linux64( 0/ 8), 222.276: Queue width: 8B, total height: 4429139, memory: 33.79MB
pins2lts-mc-linux64( 0/ 8), 222.276: Tree memory: 384.9MB, 23.9 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 222.276: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 222.276: Stored 2199 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 222.276: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 222.276: Est. total memory use: 418.7MB (~1057.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4431521734449222348;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](X(X((X((LTLAPp0==true)) U (LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4431521734449222348;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](X(X((X((LTLAPp0==true)) U (LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-10 08:56:52] [INFO ] Flatten gal took : 352 ms
[2022-06-10 08:56:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality12501100750998219479.gal : 50 ms
[2022-06-10 08:56:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality8690424914517789563.ltl : 10 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/LTLCardinality12501100750998219479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8690424914517789563.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/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !((X(F(G(X(X((X("(l1346<=l491)"))U("(l1426<=0)"))))))))
Formula 0 simplified : !XFGXX(X"(l1346<=l491)" U "(l1426<=0)")
Detected timeout of ITS tools.
[2022-06-10 09:19:27] [INFO ] Flatten gal took : 336 ms
[2022-06-10 09:19:30] [INFO ] Input system was already deterministic with 1740 transitions.
[2022-06-10 09:19:30] [INFO ] Transformed 670 places.
[2022-06-10 09:19:30] [INFO ] Transformed 1740 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 09:19:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality7465718535036913263.gal : 14 ms
[2022-06-10 09:19:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality15326657527803377892.ltl : 25 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/LTLCardinality7465718535036913263.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15326657527803377892.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/LTLCardina...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(G(X(X((X("(l1346<=l491)"))U("(l1426<=0)"))))))))
Formula 0 simplified : !XFGXX(X"(l1346<=l491)" U "(l1426<=0)")
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-c002"
export BK_EXAMINATION="LTLCardinality"
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-c002, examination is LTLCardinality"
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-165472282300475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c002.tgz
mv FunctionPointer-PT-c002 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;