About the Execution of ITS-Tools for PolyORBLF-COL-S04J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.012 | 3600000.00 | 6464989.00 | 164809.60 | FTFFFF??FTT?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.r168-tall-165277016800492.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 PolyORBLF-COL-S04J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016800492
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 7.8K Apr 29 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 14:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 14:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 154K May 10 09:34 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 PolyORBLF-COL-S04J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652861573764
Running Version 202205111006
[2022-05-18 08:12:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 08:12:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 08:12:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-18 08:12:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 08:12:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 682 ms
[2022-05-18 08:12:55] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 554 PT places and 3040.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-18 08:12:55] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 9 ms.
[2022-05-18 08:12:55] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 4027 steps, including 1 resets, run visited all 31 properties in 138 ms. (steps per millisecond=29 )
[2022-05-18 08:12:56] [INFO ] Flatten gal took : 29 ms
[2022-05-18 08:12:56] [INFO ] Flatten gal took : 10 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2022-05-18 08:12:56] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 67 ms.
[2022-05-18 08:12:56] [INFO ] Unfolded 15 HLPN properties in 0 ms.
[2022-05-18 08:12:56] [INFO ] Reduced 36 identical enabling conditions.
[2022-05-18 08:12:56] [INFO ] Reduced 36 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 252 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Applied a total of 4 rules in 55 ms. Remains 550 /554 variables (removed 4) and now considering 1372/1372 (removed 0) transitions.
[2022-05-18 08:12:56] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2022-05-18 08:12:56] [INFO ] Computed 46 place invariants in 59 ms
[2022-05-18 08:12:57] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 324 transitions.
Found 324 dead transitions using SMT.
Drop transitions removed 324 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 324 transitions.
[2022-05-18 08:12:57] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
// Phase 1: matrix 1024 rows 550 cols
[2022-05-18 08:12:57] [INFO ] Computed 46 place invariants in 35 ms
[2022-05-18 08:12:57] [INFO ] Implicit Places using invariants in 252 ms returned []
[2022-05-18 08:12:57] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
// Phase 1: matrix 1024 rows 550 cols
[2022-05-18 08:12:57] [INFO ] Computed 46 place invariants in 28 ms
[2022-05-18 08:12:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:13:00] [INFO ] Implicit Places using invariants and state equation in 3431 ms returned []
Implicit Place search using SMT with State Equation took 3695 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 550/554 places, 1048/1372 transitions.
Applied a total of 0 rules in 18 ms. Remains 550 /550 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 550/554 places, 1048/1372 transitions.
Support contains 252 out of 550 places after structural reductions.
[2022-05-18 08:13:01] [INFO ] Flatten gal took : 96 ms
[2022-05-18 08:13:01] [INFO ] Flatten gal took : 94 ms
[2022-05-18 08:13:01] [INFO ] Input system was already deterministic with 1048 transitions.
Support contains 251 out of 550 places (down from 252) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 29) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 08:13:01] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
// Phase 1: matrix 1024 rows 550 cols
[2022-05-18 08:13:01] [INFO ] Computed 46 place invariants in 23 ms
[2022-05-18 08:13:01] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 08:13:01] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 56 ms returned sat
[2022-05-18 08:13:01] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 2 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(X((X(p0)||X(X(p1)))))))))'
Support contains 25 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 50 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 08:13:02] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:13:02] [INFO ] Computed 46 place invariants in 19 ms
[2022-05-18 08:13:02] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
[2022-05-18 08:13:02] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:13:02] [INFO ] Computed 46 place invariants in 29 ms
[2022-05-18 08:13:03] [INFO ] Implicit Places using invariants in 360 ms returned []
[2022-05-18 08:13:03] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:13:03] [INFO ] Computed 46 place invariants in 25 ms
[2022-05-18 08:13:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:13:08] [INFO ] Implicit Places using invariants and state equation in 5139 ms returned []
Implicit Place search using SMT with State Equation took 5502 ms to find 0 implicit places.
[2022-05-18 08:13:08] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:13:08] [INFO ] Computed 46 place invariants in 21 ms
[2022-05-18 08:13:08] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/550 places, 1036/1048 transitions.
Finished structural reductions, in 1 iterations. Remains : 538/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 380 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(OR (AND (GEQ s6 1) (GEQ s432 1) (GEQ s473 1)) (AND (GEQ s7 1) (GEQ s433 1) (GEQ s473 1)) (AND (GEQ s4 1) (GEQ s430 1) (GEQ s473 1)) (AND (GEQ s2 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-00 finished in 6905 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)&&p1) U p2)||X(!p2)))'
Support contains 99 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 90 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 08:13:09] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:13:09] [INFO ] Computed 46 place invariants in 28 ms
[2022-05-18 08:13:09] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
[2022-05-18 08:13:09] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:13:09] [INFO ] Computed 46 place invariants in 19 ms
[2022-05-18 08:13:09] [INFO ] Implicit Places using invariants in 293 ms returned [428, 429, 430, 431, 432, 433]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 301 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 7 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), false, p2, (AND (NOT p0) p2)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 1}]], initial=2, aps=[p0:(OR (NOT (OR (AND (GEQ s85 1) (GEQ s176 1)) (AND (GEQ s75 1) (GEQ s176 1)) (AND (GEQ s70 1) (GEQ s176 1)) (AND (GEQ s56 1) (GEQ s176 1)) (AND (GEQ s60 ...], 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 1218 ms.
Product exploration explored 100000 steps with 50000 reset in 1130 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-01 finished in 3486 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!F(G(p0))) U G((G(p1)&&!p2))))'
Support contains 37 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 550 transition count 1012
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 514 transition count 1006
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 508 transition count 1006
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 84 place count 508 transition count 970
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 156 place count 472 transition count 970
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 264 place count 418 transition count 916
Applied a total of 264 rules in 93 ms. Remains 418 /550 variables (removed 132) and now considering 916/1048 (removed 132) transitions.
[2022-05-18 08:13:12] [INFO ] Flow matrix only has 892 transitions (discarded 24 similar events)
// Phase 1: matrix 892 rows 418 cols
[2022-05-18 08:13:12] [INFO ] Computed 46 place invariants in 17 ms
[2022-05-18 08:13:12] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
[2022-05-18 08:13:12] [INFO ] Flow matrix only has 892 transitions (discarded 24 similar events)
// Phase 1: matrix 892 rows 418 cols
[2022-05-18 08:13:13] [INFO ] Computed 46 place invariants in 13 ms
[2022-05-18 08:13:13] [INFO ] Implicit Places using invariants in 331 ms returned [362, 363, 364, 365, 366, 367]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 333 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/550 places, 916/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 406 transition count 910
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 406 transition count 910
Applied a total of 12 rules in 29 ms. Remains 406 /412 variables (removed 6) and now considering 910/916 (removed 6) transitions.
[2022-05-18 08:13:13] [INFO ] Flow matrix only has 886 transitions (discarded 24 similar events)
// Phase 1: matrix 886 rows 406 cols
[2022-05-18 08:13:13] [INFO ] Computed 40 place invariants in 23 ms
[2022-05-18 08:13:13] [INFO ] Implicit Places using invariants in 327 ms returned []
[2022-05-18 08:13:13] [INFO ] Flow matrix only has 886 transitions (discarded 24 similar events)
// Phase 1: matrix 886 rows 406 cols
[2022-05-18 08:13:13] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 08:13:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:13:21] [INFO ] Implicit Places using invariants and state equation in 7458 ms returned []
Implicit Place search using SMT with State Equation took 7800 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 406/550 places, 910/1048 transitions.
Finished structural reductions, in 2 iterations. Remains : 406/550 places, 910/1048 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) p2), p0, (AND p0 p1 (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s367 1) (GEQ s366 1) (GEQ s365 1) (GEQ s364 1) (GEQ s363 1) (GEQ s362 1)), p2:(OR (GEQ s246 1) (GEQ s247 1) (GEQ s248 1) (GEQ s249 1) (GEQ s24...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 33232 reset in 507 ms.
Product exploration explored 100000 steps with 33338 reset in 534 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 707 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) p2), p0, (AND p0 p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 08:13:23] [INFO ] Flow matrix only has 886 transitions (discarded 24 similar events)
// Phase 1: matrix 886 rows 406 cols
[2022-05-18 08:13:23] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 08:13:23] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-18 08:13:23] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 22 ms returned sat
[2022-05-18 08:13:23] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F p0), (F (AND p1 (NOT p2))), (F (OR (AND (NOT p1) p0) (AND p2 p0))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 12 factoid took 580 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 37 ms :[(OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 50 ms :[(OR (NOT p1) p2)]
[2022-05-18 08:13:24] [INFO ] Flow matrix only has 886 transitions (discarded 24 similar events)
// Phase 1: matrix 886 rows 406 cols
[2022-05-18 08:13:24] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 08:13:24] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-18 08:13:24] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 86 ms returned sat
[2022-05-18 08:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:13:25] [INFO ] [Real]Absence check using state equation in 1106 ms returned sat
[2022-05-18 08:13:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:13:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-18 08:13:26] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 45 ms returned sat
[2022-05-18 08:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:13:28] [INFO ] [Nat]Absence check using state equation in 2284 ms returned sat
[2022-05-18 08:13:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:13:29] [INFO ] [Nat]Added 120 Read/Feed constraints in 597 ms returned sat
[2022-05-18 08:13:29] [INFO ] Deduced a trap composed of 174 places in 187 ms of which 3 ms to minimize.
[2022-05-18 08:13:29] [INFO ] Deduced a trap composed of 214 places in 200 ms of which 1 ms to minimize.
[2022-05-18 08:13:29] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 3 ms to minimize.
[2022-05-18 08:13:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1438 ms
[2022-05-18 08:13:30] [INFO ] Computed and/alt/rep : 636/3541/618 causal constraints (skipped 264 transitions) in 64 ms.
[2022-05-18 08:13:37] [INFO ] Added : 306 causal constraints over 62 iterations in 6791 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 30 out of 406 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 406/406 places, 910/910 transitions.
Applied a total of 0 rules in 19 ms. Remains 406 /406 variables (removed 0) and now considering 910/910 (removed 0) transitions.
[2022-05-18 08:13:37] [INFO ] Flow matrix only has 886 transitions (discarded 24 similar events)
// Phase 1: matrix 886 rows 406 cols
[2022-05-18 08:13:37] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-18 08:13:37] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
[2022-05-18 08:13:37] [INFO ] Flow matrix only has 886 transitions (discarded 24 similar events)
// Phase 1: matrix 886 rows 406 cols
[2022-05-18 08:13:37] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 08:13:38] [INFO ] Implicit Places using invariants in 348 ms returned []
[2022-05-18 08:13:38] [INFO ] Flow matrix only has 886 transitions (discarded 24 similar events)
// Phase 1: matrix 886 rows 406 cols
[2022-05-18 08:13:38] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 08:13:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:13:43] [INFO ] Implicit Places using invariants and state equation in 5575 ms returned []
Implicit Place search using SMT with State Equation took 5925 ms to find 0 implicit places.
[2022-05-18 08:13:43] [INFO ] Redundant transitions in 60 ms returned []
[2022-05-18 08:13:43] [INFO ] Flow matrix only has 886 transitions (discarded 24 similar events)
// Phase 1: matrix 886 rows 406 cols
[2022-05-18 08:13:43] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-18 08:13:44] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 406/406 places, 910/910 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 40 ms :[(OR (NOT p1) p2)]
Finished random walk after 15 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 31 ms :[(OR (NOT p1) p2)]
[2022-05-18 08:13:44] [INFO ] Flow matrix only has 886 transitions (discarded 24 similar events)
// Phase 1: matrix 886 rows 406 cols
[2022-05-18 08:13:44] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 08:13:45] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-18 08:13:45] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 79 ms returned sat
[2022-05-18 08:13:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:13:46] [INFO ] [Real]Absence check using state equation in 1108 ms returned sat
[2022-05-18 08:13:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:13:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-05-18 08:13:46] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 53 ms returned sat
[2022-05-18 08:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:13:48] [INFO ] [Nat]Absence check using state equation in 2198 ms returned sat
[2022-05-18 08:13:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:13:49] [INFO ] [Nat]Added 120 Read/Feed constraints in 584 ms returned sat
[2022-05-18 08:13:49] [INFO ] Deduced a trap composed of 174 places in 226 ms of which 3 ms to minimize.
[2022-05-18 08:13:49] [INFO ] Deduced a trap composed of 214 places in 182 ms of which 1 ms to minimize.
[2022-05-18 08:13:50] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 0 ms to minimize.
[2022-05-18 08:13:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1420 ms
[2022-05-18 08:13:51] [INFO ] Computed and/alt/rep : 636/3541/618 causal constraints (skipped 264 transitions) in 139 ms.
[2022-05-18 08:13:57] [INFO ] Added : 306 causal constraints over 62 iterations in 6666 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 43 ms :[(OR (NOT p1) p2)]
Stuttering criterion allowed to conclude after 722 steps with 0 reset in 4 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-02 finished in 45081 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 17 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 550 transition count 1000
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 502 transition count 1000
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 502 transition count 940
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 442 transition count 940
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 336 place count 382 transition count 880
Applied a total of 336 rules in 121 ms. Remains 382 /550 variables (removed 168) and now considering 880/1048 (removed 168) transitions.
[2022-05-18 08:13:57] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 382 cols
[2022-05-18 08:13:57] [INFO ] Computed 46 place invariants in 19 ms
[2022-05-18 08:13:58] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
[2022-05-18 08:13:58] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 382 cols
[2022-05-18 08:13:58] [INFO ] Computed 46 place invariants in 11 ms
[2022-05-18 08:13:58] [INFO ] Implicit Places using invariants in 344 ms returned [332, 333, 334, 335, 336, 337]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 346 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 376/550 places, 880/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 370 transition count 874
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 370 transition count 874
Applied a total of 12 rules in 56 ms. Remains 370 /376 variables (removed 6) and now considering 874/880 (removed 6) transitions.
[2022-05-18 08:13:58] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 08:13:58] [INFO ] Computed 40 place invariants in 72 ms
[2022-05-18 08:13:59] [INFO ] Implicit Places using invariants in 494 ms returned []
[2022-05-18 08:13:59] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 08:13:59] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 08:13:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:14:03] [INFO ] Implicit Places using invariants and state equation in 4640 ms returned []
Implicit Place search using SMT with State Equation took 5145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 370/550 places, 874/1048 transitions.
Finished structural reductions, in 2 iterations. Remains : 370/550 places, 874/1048 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s279 9) (GEQ s284 1) (GEQ s329 1)) (AND (GEQ s279 9) (GEQ s281 1) (GEQ s330 1)) (AND (GEQ s279 9) (GEQ s284 1) (GEQ s330 1)) (AND (GEQ s2...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 27070 steps with 31 reset in 101 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-03 finished in 6412 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X((X(p1)||p2))||p0))&&F(p3)))'
Support contains 51 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 37 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 08:14:04] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:14:04] [INFO ] Computed 46 place invariants in 15 ms
[2022-05-18 08:14:04] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
[2022-05-18 08:14:04] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:14:04] [INFO ] Computed 46 place invariants in 24 ms
[2022-05-18 08:14:04] [INFO ] Implicit Places using invariants in 329 ms returned [428, 429, 430, 431, 432, 433]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 335 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 12 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p3), (NOT p1), true]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s312 1) (GEQ s318 1)) (AND (GEQ s312 1) (GEQ s317 1)) (AND (GEQ s312 1) (GEQ s316 1)) (AND (GEQ s312 1) (GEQ s314 1)) (AND (GEQ s312 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33445 reset in 580 ms.
Product exploration explored 100000 steps with 33383 reset in 624 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p2 (NOT p1)), (X (NOT p0)), (X p2), (X p3), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X p2)), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 378 ms. Reduced automaton from 6 states, 9 edges and 4 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Finished random walk after 201 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) p3 p2 (NOT p1)), (X (NOT p0)), (X p2), (X p3), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X p2)), (X (X p3))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F p0)]
Knowledge based reduction with 9 factoid took 408 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 20 out of 532 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Applied a total of 0 rules in 5 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
[2022-05-18 08:14:07] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 08:14:07] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-18 08:14:08] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
[2022-05-18 08:14:08] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 08:14:08] [INFO ] Computed 40 place invariants in 35 ms
[2022-05-18 08:14:08] [INFO ] Implicit Places using invariants in 359 ms returned []
[2022-05-18 08:14:08] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 08:14:08] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 08:14:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:14:16] [INFO ] Implicit Places using invariants and state equation in 7751 ms returned []
Implicit Place search using SMT with State Equation took 8132 ms to find 0 implicit places.
[2022-05-18 08:14:16] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 08:14:16] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 08:14:16] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/532 places, 1036/1036 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Finished random walk after 212 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 235 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 24964 reset in 456 ms.
Product exploration explored 100000 steps with 25023 reset in 454 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 20 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 532 transition count 1036
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 24 place count 532 transition count 1084
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 60 place count 532 transition count 1084
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 520 transition count 1072
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 520 transition count 1072
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 168 place count 520 transition count 1072
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 192 place count 496 transition count 1048
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 216 place count 496 transition count 1048
Deduced a syphon composed of 114 places in 1 ms
Applied a total of 216 rules in 86 ms. Remains 496 /532 variables (removed 36) and now considering 1048/1036 (removed -12) transitions.
[2022-05-18 08:14:19] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
// Phase 1: matrix 1024 rows 496 cols
[2022-05-18 08:14:19] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 08:14:19] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
[2022-05-18 08:14:19] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-18 08:14:19] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
// Phase 1: matrix 1024 rows 496 cols
[2022-05-18 08:14:19] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 08:14:20] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/532 places, 1048/1036 transitions.
Finished structural reductions, in 1 iterations. Remains : 496/532 places, 1048/1036 transitions.
Product exploration explored 100000 steps with 25066 reset in 516 ms.
Product exploration explored 100000 steps with 25030 reset in 463 ms.
Built C files in :
/tmp/ltsmin17553097086979282879
[2022-05-18 08:14:21] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17553097086979282879
Running compilation step : cd /tmp/ltsmin17553097086979282879;'/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 1826 ms.
Running link step : cd /tmp/ltsmin17553097086979282879;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17553097086979282879;'/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/stateBased14048982454255385050.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Applied a total of 0 rules in 8 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
[2022-05-18 08:14:36] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 08:14:36] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 08:14:36] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
[2022-05-18 08:14:36] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 08:14:36] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 08:14:37] [INFO ] Implicit Places using invariants in 340 ms returned []
[2022-05-18 08:14:37] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 08:14:37] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 08:14:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:14:46] [INFO ] Implicit Places using invariants and state equation in 8679 ms returned []
Implicit Place search using SMT with State Equation took 9046 ms to find 0 implicit places.
[2022-05-18 08:14:46] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 08:14:46] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 08:14:46] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/532 places, 1036/1036 transitions.
Built C files in :
/tmp/ltsmin8219269214307920959
[2022-05-18 08:14:46] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8219269214307920959
Running compilation step : cd /tmp/ltsmin8219269214307920959;'/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 1782 ms.
Running link step : cd /tmp/ltsmin8219269214307920959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8219269214307920959;'/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/stateBased3304955024930953206.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 08:15:01] [INFO ] Flatten gal took : 95 ms
[2022-05-18 08:15:01] [INFO ] Flatten gal took : 71 ms
[2022-05-18 08:15:01] [INFO ] Time to serialize gal into /tmp/LTL5857395122476923316.gal : 28 ms
[2022-05-18 08:15:01] [INFO ] Time to serialize properties into /tmp/LTL11104254527220560599.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/LTL5857395122476923316.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11104254527220560599.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/LTL5857395...267
Read 1 LTL properties
Checking formula 0 : !(((G((((X((X("((((P_1155_1>=1)||(P_1155_0>=1))||((P_1155_3>=1)||(P_1155_4>=1)))||((P_1155_2>=1)||(P_1155_5>=1)))"))||("(((((Abort_Che...1726
Formula 0 simplified : !(G("((((P_1099_0>=1)&&(P_1113_1>=1))||((P_1099_0>=1)&&(P_1113_2>=1)))||((P_1099_0>=1)&&(P_1113_0>=1)))" | "(((P_1099_0>=1)&&(P_1113...1707
Detected timeout of ITS tools.
[2022-05-18 08:15:16] [INFO ] Flatten gal took : 51 ms
[2022-05-18 08:15:16] [INFO ] Applying decomposition
[2022-05-18 08:15:17] [INFO ] Flatten gal took : 47 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/graph9684533995883674855.txt' '-o' '/tmp/graph9684533995883674855.bin' '-w' '/tmp/graph9684533995883674855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9684533995883674855.bin' '-l' '-1' '-v' '-w' '/tmp/graph9684533995883674855.weights' '-q' '0' '-e' '0.001'
[2022-05-18 08:15:17] [INFO ] Decomposing Gal with order
[2022-05-18 08:15:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 08:15:17] [INFO ] Removed a total of 824 redundant transitions.
[2022-05-18 08:15:17] [INFO ] Flatten gal took : 183 ms
[2022-05-18 08:15:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 184 labels/synchronizations in 27 ms.
[2022-05-18 08:15:17] [INFO ] Time to serialize gal into /tmp/LTL5059227231759304534.gal : 11 ms
[2022-05-18 08:15:17] [INFO ] Time to serialize properties into /tmp/LTL1111521671271127580.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/LTL5059227231759304534.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1111521671271127580.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5059227...245
Read 1 LTL properties
Checking formula 0 : !(((G((((X((X("((((i10.u63.P_1155_1>=1)||(i10.u63.P_1155_0>=1))||((i10.u63.P_1155_3>=1)||(i10.u64.P_1155_4>=1)))||((i10.u63.P_1155_2>=...2410
Formula 0 simplified : !(G("((((i10.u63.P_1099_0>=1)&&(i10.u63.P_1113_1>=1))||((i10.u63.P_1099_0>=1)&&(i10.u63.P_1113_2>=1)))||((i10.u63.P_1099_0>=1)&&(i10...2391
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1508262553340667901
[2022-05-18 08:15:32] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1508262553340667901
Running compilation step : cd /tmp/ltsmin1508262553340667901;'/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 1763 ms.
Running link step : cd /tmp/ltsmin1508262553340667901;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1508262553340667901;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((X((X((LTLAPp1==true))||(LTLAPp2==true)))||(LTLAPp0==true)))&&<>((LTLAPp3==true)))' '--buchi-type=spotba'
LTSmin run took 1307 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-04 finished in 91782 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||!(F(p2) U (F(p3)&&p3))))'
Support contains 68 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 24 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 08:15:35] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:15:35] [INFO ] Computed 46 place invariants in 17 ms
[2022-05-18 08:15:36] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
[2022-05-18 08:15:36] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:15:36] [INFO ] Computed 46 place invariants in 16 ms
[2022-05-18 08:15:37] [INFO ] Implicit Places using invariants in 444 ms returned [428, 429, 430, 431, 432, 433]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 459 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 5 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 543 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) p3), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), p2, p3, (AND p2 p3), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p3 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) (NOT p2) p3 p0), acceptance={} source=3 dest: 8}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p3 p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=p3, acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND p2 p3), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=8 dest: 8}]], initial=2, aps=[p0:(OR (GEQ s288 1) (GEQ s289 1) (GEQ s290 1) (GEQ s291 1) (GEQ s284 1) (GEQ s285 1) (GEQ s286 1) (GEQ s287 1) (GEQ s272 1) (GEQ s273 1) (GEQ s274 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 102 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-05 finished in 1880 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(X(X(p0))))||G(F(p1)))))'
Support contains 13 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 550 transition count 1024
Reduce places removed 24 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 54 place count 526 transition count 1018
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 520 transition count 1018
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 60 place count 520 transition count 946
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 204 place count 448 transition count 946
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 210 place count 442 transition count 940
Iterating global reduction 3 with 6 rules applied. Total rules applied 216 place count 442 transition count 940
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 312 place count 394 transition count 892
Applied a total of 312 rules in 73 ms. Remains 394 /550 variables (removed 156) and now considering 892/1048 (removed 156) transitions.
[2022-05-18 08:15:37] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 394 cols
[2022-05-18 08:15:37] [INFO ] Computed 46 place invariants in 11 ms
[2022-05-18 08:15:38] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
[2022-05-18 08:15:38] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 394 cols
[2022-05-18 08:15:38] [INFO ] Computed 46 place invariants in 12 ms
[2022-05-18 08:15:38] [INFO ] Implicit Places using invariants in 317 ms returned [344, 345, 346, 347, 348, 349]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 337 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 388/550 places, 892/1048 transitions.
Applied a total of 0 rules in 14 ms. Remains 388 /388 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 388/550 places, 892/1048 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s228 1) (GEQ s229 1) (GEQ s230 1) (GEQ s231 1) (GEQ s226 1) (GEQ s227 1)), p1:(AND (OR (LT s111 1) (LT s181 1)) (OR (LT s111 1) (LT s182 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1569 reset in 394 ms.
Product exploration explored 100000 steps with 1570 reset in 371 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 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 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 08:15:39] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 388 cols
[2022-05-18 08:15:39] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 08:15:39] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-05-18 08:15:39] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 15 ms returned sat
[2022-05-18 08:15:39] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Support contains 7 out of 388 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 388/388 places, 892/892 transitions.
Applied a total of 0 rules in 12 ms. Remains 388 /388 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2022-05-18 08:15:40] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 388 cols
[2022-05-18 08:15:40] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 08:15:41] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
[2022-05-18 08:15:41] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 388 cols
[2022-05-18 08:15:41] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 08:15:41] [INFO ] Implicit Places using invariants in 343 ms returned []
[2022-05-18 08:15:41] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 388 cols
[2022-05-18 08:15:41] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 08:15:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:15:47] [INFO ] Implicit Places using invariants and state equation in 6513 ms returned []
Implicit Place search using SMT with State Equation took 6883 ms to find 0 implicit places.
[2022-05-18 08:15:47] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-18 08:15:47] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 388 cols
[2022-05-18 08:15:47] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 08:15:48] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 388/388 places, 892/892 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1573 reset in 363 ms.
Product exploration explored 100000 steps with 1612 reset in 364 ms.
Built C files in :
/tmp/ltsmin5214308762043966765
[2022-05-18 08:15:49] [INFO ] Computing symmetric may disable matrix : 892 transitions.
[2022-05-18 08:15:49] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:15:49] [INFO ] Computing symmetric may enable matrix : 892 transitions.
[2022-05-18 08:15:49] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:15:49] [INFO ] Computing Do-Not-Accords matrix : 892 transitions.
[2022-05-18 08:15:49] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:15:49] [INFO ] Built C files in 155ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5214308762043966765
Running compilation step : cd /tmp/ltsmin5214308762043966765;'/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 2807 ms.
Running link step : cd /tmp/ltsmin5214308762043966765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5214308762043966765;'/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/stateBased8844254126479178369.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 388 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 388/388 places, 892/892 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 388 transition count 886
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 382 transition count 886
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 376 transition count 880
Applied a total of 24 rules in 20 ms. Remains 376 /388 variables (removed 12) and now considering 880/892 (removed 12) transitions.
[2022-05-18 08:16:04] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 376 cols
[2022-05-18 08:16:04] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 08:16:05] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
[2022-05-18 08:16:05] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 376 cols
[2022-05-18 08:16:05] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 08:16:05] [INFO ] Implicit Places using invariants in 308 ms returned []
[2022-05-18 08:16:05] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 376 cols
[2022-05-18 08:16:05] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 08:16:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:16:09] [INFO ] Implicit Places using invariants and state equation in 3958 ms returned []
Implicit Place search using SMT with State Equation took 4296 ms to find 0 implicit places.
[2022-05-18 08:16:09] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-18 08:16:09] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 376 cols
[2022-05-18 08:16:09] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 08:16:09] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 376/388 places, 880/892 transitions.
Finished structural reductions, in 1 iterations. Remains : 376/388 places, 880/892 transitions.
Built C files in :
/tmp/ltsmin8870815779510660491
[2022-05-18 08:16:09] [INFO ] Computing symmetric may disable matrix : 880 transitions.
[2022-05-18 08:16:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:16:09] [INFO ] Computing symmetric may enable matrix : 880 transitions.
[2022-05-18 08:16:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:16:10] [INFO ] Computing Do-Not-Accords matrix : 880 transitions.
[2022-05-18 08:16:10] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:16:10] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8870815779510660491
Running compilation step : cd /tmp/ltsmin8870815779510660491;'/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 2440 ms.
Running link step : cd /tmp/ltsmin8870815779510660491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8870815779510660491;'/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/stateBased9732307247309962483.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 08:16:25] [INFO ] Flatten gal took : 104 ms
[2022-05-18 08:16:25] [INFO ] Flatten gal took : 71 ms
[2022-05-18 08:16:25] [INFO ] Time to serialize gal into /tmp/LTL6743486053235101930.gal : 5 ms
[2022-05-18 08:16:25] [INFO ] Time to serialize properties into /tmp/LTL14151876216245984831.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/LTL6743486053235101930.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14151876216245984831.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/LTL6743486...267
Read 1 LTL properties
Checking formula 0 : !((F((F(G(X(X("((((NotifyEventSourceAddedE_2>=1)||(NotifyEventSourceAddedE_3>=1))||((NotifyEventSourceAddedE_4>=1)||(NotifyEventSource...523
Formula 0 simplified : !F(FGXX"((((NotifyEventSourceAddedE_2>=1)||(NotifyEventSourceAddedE_3>=1))||((NotifyEventSourceAddedE_4>=1)||(NotifyEventSourceAdded...506
Detected timeout of ITS tools.
[2022-05-18 08:16:40] [INFO ] Flatten gal took : 54 ms
[2022-05-18 08:16:40] [INFO ] Applying decomposition
[2022-05-18 08:16:40] [INFO ] Flatten gal took : 54 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/graph7897514512382428797.txt' '-o' '/tmp/graph7897514512382428797.bin' '-w' '/tmp/graph7897514512382428797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7897514512382428797.bin' '-l' '-1' '-v' '-w' '/tmp/graph7897514512382428797.weights' '-q' '0' '-e' '0.001'
[2022-05-18 08:16:40] [INFO ] Decomposing Gal with order
[2022-05-18 08:16:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 08:16:40] [INFO ] Removed a total of 662 redundant transitions.
[2022-05-18 08:16:40] [INFO ] Flatten gal took : 116 ms
[2022-05-18 08:16:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 213 labels/synchronizations in 16 ms.
[2022-05-18 08:16:40] [INFO ] Time to serialize gal into /tmp/LTL14258135469145910857.gal : 6 ms
[2022-05-18 08:16:40] [INFO ] Time to serialize properties into /tmp/LTL12324103254330394258.ltl : 14 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/LTL14258135469145910857.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12324103254330394258.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1425813...247
Read 1 LTL properties
Checking formula 0 : !((F((F(G(X(X("((((i1.u13.NotifyEventSourceAddedE_2>=1)||(i1.u14.NotifyEventSourceAddedE_3>=1))||((i1.u15.NotifyEventSourceAddedE_4>=1...638
Formula 0 simplified : !F(FGXX"((((i1.u13.NotifyEventSourceAddedE_2>=1)||(i1.u14.NotifyEventSourceAddedE_3>=1))||((i1.u15.NotifyEventSourceAddedE_4>=1)||(i...621
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12093558020716210805
[2022-05-18 08:16:55] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12093558020716210805
Running compilation step : cd /tmp/ltsmin12093558020716210805;'/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 1550 ms.
Running link step : cd /tmp/ltsmin12093558020716210805;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12093558020716210805;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>([](X(X((LTLAPp0==true)))))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-06 finished in 93267 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1 U p2)||p0))))'
Support contains 12 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 24 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 08:17:10] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:17:10] [INFO ] Computed 46 place invariants in 21 ms
[2022-05-18 08:17:11] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
[2022-05-18 08:17:11] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:17:11] [INFO ] Computed 46 place invariants in 22 ms
[2022-05-18 08:17:11] [INFO ] Implicit Places using invariants in 371 ms returned [428, 429, 430, 431, 432, 433]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 373 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 8 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s433 1) (GEQ s432 1) (GEQ s431 1) (GEQ s430 1) (GEQ s428 1) (GEQ s429 1)), p2:(OR (GEQ s380 1) (GEQ s381 1) (GEQ s378 1) (GEQ s379 1) (GEQ s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1363 reset in 339 ms.
Product exploration explored 100000 steps with 1364 reset in 385 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 123 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p2))]
[2022-05-18 08:17:12] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 08:17:12] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 08:17:13] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2022-05-18 08:17:13] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 102 ms returned sat
[2022-05-18 08:17:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:17:14] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2022-05-18 08:17:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:17:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-18 08:17:15] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 272 ms returned sat
[2022-05-18 08:17:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:17:15] [INFO ] [Nat]Absence check using state equation in 827 ms returned sat
[2022-05-18 08:17:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:17:15] [INFO ] [Nat]Added 120 Read/Feed constraints in 147 ms returned sat
[2022-05-18 08:17:16] [INFO ] Deduced a trap composed of 306 places in 211 ms of which 1 ms to minimize.
[2022-05-18 08:17:16] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 1 ms to minimize.
[2022-05-18 08:17:17] [INFO ] Deduced a trap composed of 288 places in 214 ms of which 1 ms to minimize.
[2022-05-18 08:17:18] [INFO ] Deduced a trap composed of 176 places in 187 ms of which 0 ms to minimize.
[2022-05-18 08:17:19] [INFO ] Deduced a trap composed of 176 places in 188 ms of which 1 ms to minimize.
[2022-05-18 08:17:20] [INFO ] Deduced a trap composed of 176 places in 191 ms of which 1 ms to minimize.
[2022-05-18 08:17:21] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 0 ms to minimize.
[2022-05-18 08:17:22] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 4 ms to minimize.
[2022-05-18 08:17:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6885 ms
[2022-05-18 08:17:22] [INFO ] Computed and/alt/rep : 804/3679/786 causal constraints (skipped 222 transitions) in 71 ms.
[2022-05-18 08:17:28] [INFO ] Added : 248 causal constraints over 50 iterations in 5969 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 12 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 532 transition count 1006
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 502 transition count 1006
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 60 place count 502 transition count 946
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 180 place count 442 transition count 946
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 300 place count 382 transition count 886
Applied a total of 300 rules in 34 ms. Remains 382 /532 variables (removed 150) and now considering 886/1036 (removed 150) transitions.
[2022-05-18 08:17:28] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:17:28] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 08:17:29] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
[2022-05-18 08:17:29] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:17:29] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 08:17:29] [INFO ] Implicit Places using invariants in 325 ms returned []
[2022-05-18 08:17:29] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:17:29] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 08:17:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:17:34] [INFO ] Implicit Places using invariants and state equation in 5224 ms returned []
Implicit Place search using SMT with State Equation took 5549 ms to find 0 implicit places.
[2022-05-18 08:17:34] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-18 08:17:34] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:17:34] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 08:17:35] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 382/532 places, 886/1036 transitions.
Finished structural reductions, in 1 iterations. Remains : 382/532 places, 886/1036 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p2))]
[2022-05-18 08:17:35] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:17:35] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 08:17:35] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2022-05-18 08:17:35] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 61 ms returned sat
[2022-05-18 08:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:17:36] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2022-05-18 08:17:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:17:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-18 08:17:36] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 28 ms returned sat
[2022-05-18 08:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:17:37] [INFO ] [Nat]Absence check using state equation in 1137 ms returned sat
[2022-05-18 08:17:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:17:38] [INFO ] [Nat]Added 120 Read/Feed constraints in 309 ms returned sat
[2022-05-18 08:17:38] [INFO ] Computed and/alt/rep : 588/3349/570 causal constraints (skipped 288 transitions) in 63 ms.
[2022-05-18 08:17:41] [INFO ] Added : 192 causal constraints over 39 iterations in 3106 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2119 reset in 348 ms.
Product exploration explored 100000 steps with 2083 reset in 344 ms.
Built C files in :
/tmp/ltsmin2142451159910997139
[2022-05-18 08:17:42] [INFO ] Computing symmetric may disable matrix : 886 transitions.
[2022-05-18 08:17:42] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:17:42] [INFO ] Computing symmetric may enable matrix : 886 transitions.
[2022-05-18 08:17:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:17:42] [INFO ] Computing Do-Not-Accords matrix : 886 transitions.
[2022-05-18 08:17:42] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:17:42] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2142451159910997139
Running compilation step : cd /tmp/ltsmin2142451159910997139;'/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 2473 ms.
Running link step : cd /tmp/ltsmin2142451159910997139;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin2142451159910997139;'/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/stateBased10508794552157041449.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 886/886 transitions.
Applied a total of 0 rules in 14 ms. Remains 382 /382 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2022-05-18 08:17:57] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:17:57] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 08:17:57] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
[2022-05-18 08:17:57] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:17:57] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 08:17:57] [INFO ] Implicit Places using invariants in 318 ms returned []
[2022-05-18 08:17:57] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:17:57] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 08:17:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:18:02] [INFO ] Implicit Places using invariants and state equation in 5038 ms returned []
Implicit Place search using SMT with State Equation took 5369 ms to find 0 implicit places.
[2022-05-18 08:18:02] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-18 08:18:02] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:18:02] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 08:18:03] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 382/382 places, 886/886 transitions.
Built C files in :
/tmp/ltsmin3767844627483513144
[2022-05-18 08:18:03] [INFO ] Computing symmetric may disable matrix : 886 transitions.
[2022-05-18 08:18:03] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:18:03] [INFO ] Computing symmetric may enable matrix : 886 transitions.
[2022-05-18 08:18:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:18:03] [INFO ] Computing Do-Not-Accords matrix : 886 transitions.
[2022-05-18 08:18:03] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:18:03] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3767844627483513144
Running compilation step : cd /tmp/ltsmin3767844627483513144;'/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 2473 ms.
Running link step : cd /tmp/ltsmin3767844627483513144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3767844627483513144;'/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/stateBased13447587181863630937.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 08:18:18] [INFO ] Flatten gal took : 77 ms
[2022-05-18 08:18:18] [INFO ] Flatten gal took : 51 ms
[2022-05-18 08:18:18] [INFO ] Time to serialize gal into /tmp/LTL5992504805597915789.gal : 11 ms
[2022-05-18 08:18:18] [INFO ] Time to serialize properties into /tmp/LTL2654484031174849349.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/LTL5992504805597915789.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2654484031174849349.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/LTL5992504...266
Read 1 LTL properties
Checking formula 0 : !((X(F((((("((((NotifyEventJobCompletedB_5>=1)||(NotifyEventJobCompletedB_4>=1))||((NotifyEventJobCompletedB_3>=1)||(NotifyEventJobCom...549
Formula 0 simplified : !XF("(((NotifyEventJobCompletedB_2>=1)||(NotifyEventJobCompletedB_0>=1))||(NotifyEventJobCompletedB_1>=1))" | "((NotifyEventJobCompl...536
Detected timeout of ITS tools.
[2022-05-18 08:18:33] [INFO ] Flatten gal took : 37 ms
[2022-05-18 08:18:33] [INFO ] Applying decomposition
[2022-05-18 08:18:33] [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/graph14338205145862132038.txt' '-o' '/tmp/graph14338205145862132038.bin' '-w' '/tmp/graph14338205145862132038.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14338205145862132038.bin' '-l' '-1' '-v' '-w' '/tmp/graph14338205145862132038.weights' '-q' '0' '-e' '0.001'
[2022-05-18 08:18:33] [INFO ] Decomposing Gal with order
[2022-05-18 08:18:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 08:18:34] [INFO ] Removed a total of 701 redundant transitions.
[2022-05-18 08:18:34] [INFO ] Flatten gal took : 217 ms
[2022-05-18 08:18:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 123 labels/synchronizations in 40 ms.
[2022-05-18 08:18:34] [INFO ] Time to serialize gal into /tmp/LTL18396926321238292180.gal : 22 ms
[2022-05-18 08:18:34] [INFO ] Time to serialize properties into /tmp/LTL3677601757341395597.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/LTL18396926321238292180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3677601757341395597.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1839692...246
Read 1 LTL properties
Checking formula 0 : !((X(F((((("((((i0.u17.NotifyEventJobCompletedB_5>=1)||(i0.u7.NotifyEventJobCompletedB_4>=1))||((i0.u19.NotifyEventJobCompletedB_3>=1)...669
Formula 0 simplified : !XF("(((i0.u16.NotifyEventJobCompletedB_2>=1)||(i0.u5.NotifyEventJobCompletedB_0>=1))||(i0.u6.NotifyEventJobCompletedB_1>=1))" | "((...656
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4337254197940161518
[2022-05-18 08:18:49] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4337254197940161518
Running compilation step : cd /tmp/ltsmin4337254197940161518;'/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 1477 ms.
Running link step : cd /tmp/ltsmin4337254197940161518;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4337254197940161518;'/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(<>((((LTLAPp1==true) U (LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-07 finished in 113479 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 7 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 34 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 08:19:04] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:19:04] [INFO ] Computed 46 place invariants in 23 ms
[2022-05-18 08:19:04] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
[2022-05-18 08:19:04] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:19:04] [INFO ] Computed 46 place invariants in 15 ms
[2022-05-18 08:19:05] [INFO ] Implicit Places using invariants in 377 ms returned [428, 429, 430, 431, 432, 433]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 379 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 9 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s251 1) (GEQ s256 1)) (AND (GEQ s252 1) (GEQ s256 1)) (AND (GEQ s250 1) (GEQ s256 1)) (AND (GEQ s254 1) (GEQ s256 1)) (AND (GEQ s253 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-08 finished in 942 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((X(p1)||G(!p2)||X(p3)||p0) U p4))'
Support contains 26 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Applied a total of 0 rules in 9 ms. Remains 550 /550 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2022-05-18 08:19:05] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
// Phase 1: matrix 1024 rows 550 cols
[2022-05-18 08:19:05] [INFO ] Computed 46 place invariants in 21 ms
[2022-05-18 08:19:05] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
[2022-05-18 08:19:05] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
// Phase 1: matrix 1024 rows 550 cols
[2022-05-18 08:19:05] [INFO ] Computed 46 place invariants in 26 ms
[2022-05-18 08:19:06] [INFO ] Implicit Places using invariants in 357 ms returned [428, 429, 430, 431, 432, 433]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 359 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 544/550 places, 1048/1048 transitions.
Applied a total of 0 rules in 6 ms. Remains 544 /544 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 544/550 places, 1048/1048 transitions.
Stuttering acceptance computed with spot in 209 ms :[p4, true, (OR (AND p1 p4) (AND p3 p4)), (AND (NOT p2) p4), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p4)), acceptance={} source=0 dest: 0}, { cond=p4, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p4)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p4) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p0 (NOT p4) p1) (AND p0 (NOT p4) p3)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p4 p1) (AND p4 p3)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p4) p1) (AND (NOT p0) (NOT p4) p3)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p4) p1 (NOT p2)) (AND (NOT p0) (NOT p4) p3 (NOT p2))), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p4) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p4 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s469 1) (GEQ s468 1) (GEQ s467 1) (GEQ s466 1) (GEQ s465 1) (GEQ s464 1)), p4:(OR (GEQ s410 1) (GEQ s411 1) (GEQ s408 1) (GEQ s409 1) (GEQ s40...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 839 ms.
Product exploration explored 100000 steps with 50000 reset in 839 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p4) p2 (NOT p1) (NOT p3)), (X (NOT (AND p0 (NOT p4)))), (X (NOT (OR (AND (NOT p0) (NOT p4) p1 (NOT p2)) (AND (NOT p0) (NOT p4) p3 (NOT p2))))), (X (NOT p4)), (X (NOT (OR (AND (NOT p0) (NOT p4) p1) (AND (NOT p0) (NOT p4) p3)))), (X (NOT (AND (NOT p4) (NOT p2)))), (X (AND (NOT p0) (NOT p4))), (X (NOT (OR (AND p0 (NOT p4) p1) (AND p0 (NOT p4) p3)))), (X (NOT (AND (NOT p0) (NOT p4) (NOT p2)))), (X (NOT (OR (AND p4 p1) (AND p4 p3)))), (X (NOT (AND p4 (NOT p2)))), (X (X (NOT (AND p0 (NOT p4))))), true, (X (X (NOT (OR (AND (NOT p0) (NOT p4) p1 (NOT p2)) (AND (NOT p0) (NOT p4) p3 (NOT p2)))))), (X (X (NOT p4))), (X (X (NOT (OR (AND (NOT p0) (NOT p4) p1) (AND (NOT p0) (NOT p4) p3))))), (X (X (NOT (AND (NOT p4) (NOT p2))))), (X (X (AND (NOT p0) (NOT p4)))), (X (X (NOT (OR (AND p0 (NOT p4) p1) (AND p0 (NOT p4) p3))))), (X (X (NOT (AND (NOT p0) (NOT p4) (NOT p2))))), (X (X (NOT (OR (AND p4 p1) (AND p4 p3))))), (X (X p2)), (X (X (NOT (AND p4 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p4) p2 (NOT p1) (NOT p3))
Knowledge based reduction with 23 factoid took 697 ms. Reduced automaton from 5 states, 12 edges and 5 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-09 finished in 3495 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 6 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 550 transition count 994
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 496 transition count 994
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 496 transition count 934
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 436 transition count 934
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 336 place count 382 transition count 880
Applied a total of 336 rules in 36 ms. Remains 382 /550 variables (removed 168) and now considering 880/1048 (removed 168) transitions.
[2022-05-18 08:19:08] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 382 cols
[2022-05-18 08:19:08] [INFO ] Computed 46 place invariants in 20 ms
[2022-05-18 08:19:09] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
[2022-05-18 08:19:09] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 382 cols
[2022-05-18 08:19:09] [INFO ] Computed 46 place invariants in 20 ms
[2022-05-18 08:19:09] [INFO ] Implicit Places using invariants in 340 ms returned [326, 327, 328, 329, 330, 331]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 358 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 376/550 places, 880/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 370 transition count 874
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 370 transition count 874
Applied a total of 12 rules in 21 ms. Remains 370 /376 variables (removed 6) and now considering 874/880 (removed 6) transitions.
[2022-05-18 08:19:09] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 08:19:09] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 08:19:10] [INFO ] Implicit Places using invariants in 323 ms returned []
[2022-05-18 08:19:10] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 08:19:10] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 08:19:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:19:16] [INFO ] Implicit Places using invariants and state equation in 6953 ms returned []
Implicit Place search using SMT with State Equation took 7278 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 370/550 places, 874/1048 transitions.
Finished structural reductions, in 2 iterations. Remains : 370/550 places, 874/1048 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s366 1) (LT s367 1) (LT s368 1) (LT s369 1) (LT s364 1) (LT s365 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1001 reset in 329 ms.
Product exploration explored 100000 steps with 990 reset in 355 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Finished random walk after 75 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 874/874 transitions.
Applied a total of 0 rules in 16 ms. Remains 370 /370 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2022-05-18 08:19:18] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 08:19:18] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-18 08:19:18] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
[2022-05-18 08:19:18] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 08:19:18] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 08:19:18] [INFO ] Implicit Places using invariants in 336 ms returned []
[2022-05-18 08:19:18] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 08:19:18] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 08:19:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:19:25] [INFO ] Implicit Places using invariants and state equation in 6185 ms returned []
Implicit Place search using SMT with State Equation took 6523 ms to find 0 implicit places.
[2022-05-18 08:19:25] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-18 08:19:25] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 08:19:25] [INFO ] Computed 40 place invariants in 21 ms
[2022-05-18 08:19:25] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 370/370 places, 874/874 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 75 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 964 reset in 316 ms.
Product exploration explored 100000 steps with 983 reset in 322 ms.
Built C files in :
/tmp/ltsmin4416718499215820735
[2022-05-18 08:19:26] [INFO ] Computing symmetric may disable matrix : 874 transitions.
[2022-05-18 08:19:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:19:26] [INFO ] Computing symmetric may enable matrix : 874 transitions.
[2022-05-18 08:19:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:19:26] [INFO ] Computing Do-Not-Accords matrix : 874 transitions.
[2022-05-18 08:19:26] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:19:26] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4416718499215820735
Running compilation step : cd /tmp/ltsmin4416718499215820735;'/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 2446 ms.
Running link step : cd /tmp/ltsmin4416718499215820735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin4416718499215820735;'/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/stateBased11833381880747432177.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 874/874 transitions.
Applied a total of 0 rules in 20 ms. Remains 370 /370 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2022-05-18 08:19:41] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 08:19:41] [INFO ] Computed 40 place invariants in 24 ms
[2022-05-18 08:19:42] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
[2022-05-18 08:19:42] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 08:19:42] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 08:19:42] [INFO ] Implicit Places using invariants in 317 ms returned []
[2022-05-18 08:19:42] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 08:19:42] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 08:19:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:19:47] [INFO ] Implicit Places using invariants and state equation in 5287 ms returned []
Implicit Place search using SMT with State Equation took 5605 ms to find 0 implicit places.
[2022-05-18 08:19:47] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-18 08:19:47] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 08:19:47] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 08:19:48] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 370/370 places, 874/874 transitions.
Built C files in :
/tmp/ltsmin7013599390564032396
[2022-05-18 08:19:48] [INFO ] Computing symmetric may disable matrix : 874 transitions.
[2022-05-18 08:19:48] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:19:48] [INFO ] Computing symmetric may enable matrix : 874 transitions.
[2022-05-18 08:19:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:19:48] [INFO ] Computing Do-Not-Accords matrix : 874 transitions.
[2022-05-18 08:19:48] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:19:48] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7013599390564032396
Running compilation step : cd /tmp/ltsmin7013599390564032396;'/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 2395 ms.
Running link step : cd /tmp/ltsmin7013599390564032396;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin7013599390564032396;'/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/stateBased13159348384300431473.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 08:20:03] [INFO ] Flatten gal took : 41 ms
[2022-05-18 08:20:03] [INFO ] Flatten gal took : 36 ms
[2022-05-18 08:20:03] [INFO ] Time to serialize gal into /tmp/LTL9465494304932738612.gal : 5 ms
[2022-05-18 08:20:03] [INFO ] Time to serialize properties into /tmp/LTL15068705335834106081.ltl : 2 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/LTL9465494304932738612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15068705335834106081.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/LTL9465494...267
Read 1 LTL properties
Checking formula 0 : !((F(G(F("((((ScheduleTaskE_Idle_2<1)&&(ScheduleTaskE_Idle_3<1))&&((ScheduleTaskE_Idle_4<1)&&(ScheduleTaskE_Idle_5<1)))&&((ScheduleTas...201
Formula 0 simplified : !FGF"((((ScheduleTaskE_Idle_2<1)&&(ScheduleTaskE_Idle_3<1))&&((ScheduleTaskE_Idle_4<1)&&(ScheduleTaskE_Idle_5<1)))&&((ScheduleTaskE_...193
Detected timeout of ITS tools.
[2022-05-18 08:20:18] [INFO ] Flatten gal took : 33 ms
[2022-05-18 08:20:18] [INFO ] Applying decomposition
[2022-05-18 08:20:18] [INFO ] Flatten gal took : 33 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/graph5400103927232384580.txt' '-o' '/tmp/graph5400103927232384580.bin' '-w' '/tmp/graph5400103927232384580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5400103927232384580.bin' '-l' '-1' '-v' '-w' '/tmp/graph5400103927232384580.weights' '-q' '0' '-e' '0.001'
[2022-05-18 08:20:18] [INFO ] Decomposing Gal with order
[2022-05-18 08:20:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 08:20:19] [INFO ] Removed a total of 766 redundant transitions.
[2022-05-18 08:20:19] [INFO ] Flatten gal took : 165 ms
[2022-05-18 08:20:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 27 ms.
[2022-05-18 08:20:19] [INFO ] Time to serialize gal into /tmp/LTL5687281218571739987.gal : 5 ms
[2022-05-18 08:20:19] [INFO ] Time to serialize properties into /tmp/LTL18387753277483674153.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/LTL5687281218571739987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18387753277483674153.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5687281...246
Read 1 LTL properties
Checking formula 0 : !((F(G(F("((((i0.u4.ScheduleTaskE_Idle_2<1)&&(i0.u5.ScheduleTaskE_Idle_3<1))&&((i0.u6.ScheduleTaskE_Idle_4<1)&&(i0.u2.ScheduleTaskE_Id...237
Formula 0 simplified : !FGF"((((i0.u4.ScheduleTaskE_Idle_2<1)&&(i0.u5.ScheduleTaskE_Idle_3<1))&&((i0.u6.ScheduleTaskE_Idle_4<1)&&(i0.u2.ScheduleTaskE_Idle_...229
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16531618495427115499
[2022-05-18 08:20:34] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16531618495427115499
Running compilation step : cd /tmp/ltsmin16531618495427115499;'/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 1466 ms.
Running link step : cd /tmp/ltsmin16531618495427115499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16531618495427115499;'/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 PolyORBLF-COL-S04J04T06-LTLFireability-11 finished in 100566 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(X(G(p0)) U p1))))'
Support contains 24 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 23 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 08:20:49] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:20:49] [INFO ] Computed 46 place invariants in 21 ms
[2022-05-18 08:20:49] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
[2022-05-18 08:20:49] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:20:49] [INFO ] Computed 46 place invariants in 24 ms
[2022-05-18 08:20:50] [INFO ] Implicit Places using invariants in 365 ms returned [428, 429, 430, 431, 432, 433]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 368 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 8 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 159 ms :[p1, p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s86 1) (GEQ s92 1)) (AND (GEQ s90 1) (GEQ s96 1)) (AND (GEQ s87 1) (GEQ s93 1)) (AND (GEQ s89 1) (GEQ s95 1)) (AND (GEQ s91 1) (GEQ s97 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 544 ms.
Product exploration explored 100000 steps with 33333 reset in 549 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0))
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-12 finished in 2302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(G(p1)&&X(p0))))))'
Support contains 15 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 25 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 08:20:51] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:20:51] [INFO ] Computed 46 place invariants in 21 ms
[2022-05-18 08:20:52] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
[2022-05-18 08:20:52] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 08:20:52] [INFO ] Computed 46 place invariants in 20 ms
[2022-05-18 08:20:52] [INFO ] Implicit Places using invariants in 371 ms returned [428, 429, 430, 431, 432, 433]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 372 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 8 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (OR (LT s0 10) (LT s460 1) (LT s466 1)) (OR (LT s0 10) (LT s465 1) (LT s466 1)) (OR (LT s0 10) (LT s464 1) (LT s466 1)) (OR (LT s0 10) (LT s461 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 901 reset in 444 ms.
Stack based approach found an accepted trace after 78106 steps with 717 reset with depth 564 and stack size 564 in 361 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-15 finished in 1831 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(X(X(p0))))||G(F(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1 U p2)||p0))))'
Found a CL insensitive property : PolyORBLF-COL-S04J04T06-LTLFireability-07
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 12 out of 550 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 550 transition count 1012
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 514 transition count 1006
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 508 transition count 1006
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 84 place count 508 transition count 946
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 204 place count 448 transition count 946
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 324 place count 388 transition count 886
Applied a total of 324 rules in 33 ms. Remains 388 /550 variables (removed 162) and now considering 886/1048 (removed 162) transitions.
[2022-05-18 08:20:53] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 388 cols
[2022-05-18 08:20:53] [INFO ] Computed 46 place invariants in 18 ms
[2022-05-18 08:20:54] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
[2022-05-18 08:20:54] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 388 cols
[2022-05-18 08:20:54] [INFO ] Computed 46 place invariants in 10 ms
[2022-05-18 08:20:54] [INFO ] Implicit Places using invariants in 310 ms returned [332, 333, 334, 335, 336, 337]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 311 ms to find 6 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 382/550 places, 886/1048 transitions.
Applied a total of 0 rules in 8 ms. Remains 382 /382 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 382/550 places, 886/1048 transitions.
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s337 1) (GEQ s336 1) (GEQ s335 1) (GEQ s334 1) (GEQ s332 1) (GEQ s333 1)), p2:(OR (GEQ s290 1) (GEQ s291 1) (GEQ s288 1) (GEQ s289 1) (GEQ s28...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2086 reset in 329 ms.
Product exploration explored 100000 steps with 2110 reset in 354 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 60 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p2))]
[2022-05-18 08:20:55] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:20:55] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 08:20:55] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-18 08:20:55] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 62 ms returned sat
[2022-05-18 08:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:20:56] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2022-05-18 08:20:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:20:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2022-05-18 08:20:56] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 28 ms returned sat
[2022-05-18 08:20:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:20:57] [INFO ] [Nat]Absence check using state equation in 1028 ms returned sat
[2022-05-18 08:20:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:20:58] [INFO ] [Nat]Added 120 Read/Feed constraints in 941 ms returned sat
[2022-05-18 08:20:58] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2022-05-18 08:20:59] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2022-05-18 08:20:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 675 ms
[2022-05-18 08:20:59] [INFO ] Computed and/alt/rep : 588/3349/570 causal constraints (skipped 288 transitions) in 59 ms.
[2022-05-18 08:21:01] [INFO ] Added : 129 causal constraints over 26 iterations in 2282 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 12 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 886/886 transitions.
Applied a total of 0 rules in 16 ms. Remains 382 /382 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2022-05-18 08:21:01] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:21:01] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 08:21:02] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
[2022-05-18 08:21:02] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:21:02] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 08:21:02] [INFO ] Implicit Places using invariants in 297 ms returned []
[2022-05-18 08:21:02] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:21:02] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 08:21:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:21:07] [INFO ] Implicit Places using invariants and state equation in 5158 ms returned []
Implicit Place search using SMT with State Equation took 5456 ms to find 0 implicit places.
[2022-05-18 08:21:07] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-18 08:21:07] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:21:07] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 08:21:08] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 382/382 places, 886/886 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 78 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p2))]
[2022-05-18 08:21:08] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:21:08] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 08:21:08] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-18 08:21:08] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 63 ms returned sat
[2022-05-18 08:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 08:21:09] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2022-05-18 08:21:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 08:21:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2022-05-18 08:21:09] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 27 ms returned sat
[2022-05-18 08:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 08:21:10] [INFO ] [Nat]Absence check using state equation in 1037 ms returned sat
[2022-05-18 08:21:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:21:11] [INFO ] [Nat]Added 120 Read/Feed constraints in 956 ms returned sat
[2022-05-18 08:21:11] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2022-05-18 08:21:12] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 0 ms to minimize.
[2022-05-18 08:21:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 688 ms
[2022-05-18 08:21:12] [INFO ] Computed and/alt/rep : 588/3349/570 causal constraints (skipped 288 transitions) in 45 ms.
[2022-05-18 08:21:14] [INFO ] Added : 129 causal constraints over 26 iterations in 2344 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2098 reset in 365 ms.
Product exploration explored 100000 steps with 2079 reset in 390 ms.
Built C files in :
/tmp/ltsmin5612494408873869276
[2022-05-18 08:21:15] [INFO ] Computing symmetric may disable matrix : 886 transitions.
[2022-05-18 08:21:15] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:21:15] [INFO ] Computing symmetric may enable matrix : 886 transitions.
[2022-05-18 08:21:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:21:15] [INFO ] Computing Do-Not-Accords matrix : 886 transitions.
[2022-05-18 08:21:15] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:21:15] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5612494408873869276
Running compilation step : cd /tmp/ltsmin5612494408873869276;'/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 2498 ms.
Running link step : cd /tmp/ltsmin5612494408873869276;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin5612494408873869276;'/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/stateBased6054132969387160030.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 886/886 transitions.
Applied a total of 0 rules in 20 ms. Remains 382 /382 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2022-05-18 08:21:30] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:21:30] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 08:21:31] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
[2022-05-18 08:21:31] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:21:31] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 08:21:31] [INFO ] Implicit Places using invariants in 297 ms returned []
[2022-05-18 08:21:31] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:21:31] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 08:21:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 08:21:37] [INFO ] Implicit Places using invariants and state equation in 5713 ms returned []
Implicit Place search using SMT with State Equation took 6023 ms to find 0 implicit places.
[2022-05-18 08:21:37] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-18 08:21:37] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 08:21:37] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-18 08:21:37] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 382/382 places, 886/886 transitions.
Built C files in :
/tmp/ltsmin6028704117666330543
[2022-05-18 08:21:37] [INFO ] Computing symmetric may disable matrix : 886 transitions.
[2022-05-18 08:21:37] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:21:37] [INFO ] Computing symmetric may enable matrix : 886 transitions.
[2022-05-18 08:21:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:21:37] [INFO ] Computing Do-Not-Accords matrix : 886 transitions.
[2022-05-18 08:21:37] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:21:37] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6028704117666330543
Running compilation step : cd /tmp/ltsmin6028704117666330543;'/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 2492 ms.
Running link step : cd /tmp/ltsmin6028704117666330543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin6028704117666330543;'/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/stateBased8044028590881489695.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 08:21:52] [INFO ] Flatten gal took : 34 ms
[2022-05-18 08:21:52] [INFO ] Flatten gal took : 34 ms
[2022-05-18 08:21:52] [INFO ] Time to serialize gal into /tmp/LTL4517832675146628485.gal : 4 ms
[2022-05-18 08:21:52] [INFO ] Time to serialize properties into /tmp/LTL14930485469029803295.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/LTL4517832675146628485.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14930485469029803295.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/LTL4517832...267
Read 1 LTL properties
Checking formula 0 : !((X(F((((("((((NotifyEventJobCompletedB_5>=1)||(NotifyEventJobCompletedB_4>=1))||((NotifyEventJobCompletedB_3>=1)||(NotifyEventJobCom...549
Formula 0 simplified : !XF("(((NotifyEventJobCompletedB_2>=1)||(NotifyEventJobCompletedB_0>=1))||(NotifyEventJobCompletedB_1>=1))" | "((NotifyEventJobCompl...536
Detected timeout of ITS tools.
[2022-05-18 08:22:07] [INFO ] Flatten gal took : 36 ms
[2022-05-18 08:22:07] [INFO ] Applying decomposition
[2022-05-18 08:22:07] [INFO ] Flatten gal took : 32 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/graph17813752801240427120.txt' '-o' '/tmp/graph17813752801240427120.bin' '-w' '/tmp/graph17813752801240427120.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17813752801240427120.bin' '-l' '-1' '-v' '-w' '/tmp/graph17813752801240427120.weights' '-q' '0' '-e' '0.001'
[2022-05-18 08:22:07] [INFO ] Decomposing Gal with order
[2022-05-18 08:22:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 08:22:08] [INFO ] Removed a total of 713 redundant transitions.
[2022-05-18 08:22:08] [INFO ] Flatten gal took : 76 ms
[2022-05-18 08:22:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 9 ms.
[2022-05-18 08:22:08] [INFO ] Time to serialize gal into /tmp/LTL554326211112498105.gal : 6 ms
[2022-05-18 08:22:08] [INFO ] Time to serialize properties into /tmp/LTL12958920654196926167.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/LTL554326211112498105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12958920654196926167.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5543262...245
Read 1 LTL properties
Checking formula 0 : !((X(F((((("((((i1.u26.NotifyEventJobCompletedB_5>=1)||(i1.u25.NotifyEventJobCompletedB_4>=1))||((i1.u5.NotifyEventJobCompletedB_3>=1)...671
Formula 0 simplified : !XF("(((i1.u24.NotifyEventJobCompletedB_2>=1)||(i1.u23.NotifyEventJobCompletedB_0>=1))||(i1.u4.NotifyEventJobCompletedB_1>=1))" | "(...658
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2488938148240154027
[2022-05-18 08:22:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2488938148240154027
Running compilation step : cd /tmp/ltsmin2488938148240154027;'/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 1473 ms.
Running link step : cd /tmp/ltsmin2488938148240154027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2488938148240154027;'/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(<>((((LTLAPp1==true) U (LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-COL-S04J04T06-LTLFireability-07 finished in 104532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
[2022-05-18 08:22:38] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4423483718828464711
[2022-05-18 08:22:38] [INFO ] Computing symmetric may disable matrix : 1048 transitions.
[2022-05-18 08:22:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:22:38] [INFO ] Computing symmetric may enable matrix : 1048 transitions.
[2022-05-18 08:22:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:22:38] [INFO ] Applying decomposition
[2022-05-18 08:22:38] [INFO ] Flatten gal took : 38 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/graph4364870400596555389.txt' '-o' '/tmp/graph4364870400596555389.bin' '-w' '/tmp/graph4364870400596555389.weights'
[2022-05-18 08:22:38] [INFO ] Computing Do-Not-Accords matrix : 1048 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4364870400596555389.bin' '-l' '-1' '-v' '-w' '/tmp/graph4364870400596555389.weights' '-q' '0' '-e' '0.001'
[2022-05-18 08:22:38] [INFO ] Decomposing Gal with order
[2022-05-18 08:22:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 08:22:38] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 08:22:38] [INFO ] Built C files in 179ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4423483718828464711
Running compilation step : cd /tmp/ltsmin4423483718828464711;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 08:22:38] [INFO ] Removed a total of 725 redundant transitions.
[2022-05-18 08:22:38] [INFO ] Flatten gal took : 117 ms
[2022-05-18 08:22:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 5 ms.
[2022-05-18 08:22:38] [INFO ] Time to serialize gal into /tmp/LTLFireability13642627852073639525.gal : 5 ms
[2022-05-18 08:22:38] [INFO ] Time to serialize properties into /tmp/LTLFireability4683213558289060018.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/LTLFireability13642627852073639525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4683213558289060018.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((F((F(G(X(X("((((i3.i1.u30.NotifyEventSourceAddedE_2>=1)||(i4.i0.u48.NotifyEventSourceAddedE_3>=1))||((i13.i0.u50.NotifyEventSourceA...685
Formula 0 simplified : !F(FGXX"((((i3.i1.u30.NotifyEventSourceAddedE_2>=1)||(i4.i0.u48.NotifyEventSourceAddedE_3>=1))||((i13.i0.u50.NotifyEventSourceAddedE...668
Compilation finished in 3480 ms.
Running link step : cd /tmp/ltsmin4423483718828464711;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin4423483718828464711;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>([](X(X((LTLAPp0==true)))))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.041: loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.059: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.059: LTL layer: formula: <>((<>([](X(X((LTLAPp0==true)))))||[](<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 0/ 8), 1.059: "<>((<>([](X(X((LTLAPp0==true)))))||[](<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 1.060: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 1.069: buchi has 3 states
pins2lts-mc-linux64( 3/ 8), 1.105: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 1.153: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 1.156: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 1.184: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 1.248: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 1.288: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 1.296: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.539: There are 1055 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.539: State length is 551, there are 1054 groups
pins2lts-mc-linux64( 0/ 8), 1.539: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.539: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.539: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.539: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 1.724: [Blue] ~119 levels ~960 states ~2056 transitions
pins2lts-mc-linux64( 6/ 8), 1.947: [Blue] ~237 levels ~1920 states ~3384 transitions
pins2lts-mc-linux64( 6/ 8), 2.376: [Blue] ~474 levels ~3840 states ~6416 transitions
pins2lts-mc-linux64( 6/ 8), 3.116: [Blue] ~933 levels ~7680 states ~12344 transitions
pins2lts-mc-linux64( 6/ 8), 5.099: [Blue] ~1874 levels ~15360 states ~26072 transitions
pins2lts-mc-linux64( 7/ 8), 8.675: [Blue] ~2693 levels ~30720 states ~46184 transitions
pins2lts-mc-linux64( 0/ 8), 13.602: [Blue] ~7163 levels ~61440 states ~104936 transitions
pins2lts-mc-linux64( 0/ 8), 24.726: [Blue] ~13661 levels ~122880 states ~218544 transitions
pins2lts-mc-linux64( 4/ 8), 39.824: [Blue] ~27020 levels ~245760 states ~466352 transitions
pins2lts-mc-linux64( 4/ 8), 51.969: [Blue] ~54847 levels ~491520 states ~955864 transitions
pins2lts-mc-linux64( 3/ 8), 74.511: [Blue] ~114590 levels ~983040 states ~1993624 transitions
pins2lts-mc-linux64( 4/ 8), 104.888: [Blue] ~215791 levels ~1966080 states ~4024736 transitions
pins2lts-mc-linux64( 3/ 8), 158.137: [Blue] ~436937 levels ~3932160 states ~8257832 transitions
pins2lts-mc-linux64( 4/ 8), 272.156: [Blue] ~844529 levels ~7864320 states ~16394136 transitions
pins2lts-mc-linux64( 4/ 8), 481.295: [Blue] ~1648630 levels ~15728640 states ~33178168 transitions
pins2lts-mc-linux64( 3/ 8), 830.134: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 830.178:
pins2lts-mc-linux64( 0/ 8), 830.178: Explored 26370320 states 56675612 transitions, fanout: 2.149
pins2lts-mc-linux64( 0/ 8), 830.178: Total exploration time 828.620 sec (828.530 sec minimum, 828.583 sec on average)
pins2lts-mc-linux64( 0/ 8), 830.178: States per second: 31824, Transitions per second: 68398
pins2lts-mc-linux64( 0/ 8), 830.178:
pins2lts-mc-linux64( 0/ 8), 830.178: State space has 39941093 states, 738114 are accepting
pins2lts-mc-linux64( 0/ 8), 830.178: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 830.178: blue states: 26370320 (66.02%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 830.178: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 830.178: all-red states: 738114 (1.85%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 830.178:
pins2lts-mc-linux64( 0/ 8), 830.178: Total memory used for local state coloring: 318.9MB
pins2lts-mc-linux64( 0/ 8), 830.178:
pins2lts-mc-linux64( 0/ 8), 830.178: Queue width: 8B, total height: 20901675, memory: 159.47MB
pins2lts-mc-linux64( 0/ 8), 830.178: Tree memory: 560.7MB, 14.7 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 830.178: Tree fill ratio (roots/leafs): 29.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 830.178: Stored 1104 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 830.178: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 830.178: Est. total memory use: 720.2MB (~1183.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4423483718828464711;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>([](X(X((LTLAPp0==true)))))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4423483718828464711;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>([](X(X((LTLAPp0==true)))))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
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-05-18 08:45:53] [INFO ] Applying decomposition
[2022-05-18 08:45:53] [INFO ] Flatten gal took : 56 ms
[2022-05-18 08:45:53] [INFO ] Decomposing Gal with order
[2022-05-18 08:45:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 08:45:53] [INFO ] Removed a total of 3063 redundant transitions.
[2022-05-18 08:45:53] [INFO ] Flatten gal took : 108 ms
[2022-05-18 08:45:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 14 ms.
[2022-05-18 08:45:53] [INFO ] Time to serialize gal into /tmp/LTLFireability9681201966240624895.gal : 26 ms
[2022-05-18 08:45:53] [INFO ] Time to serialize properties into /tmp/LTLFireability4465058917827032153.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/LTLFireability9681201966240624895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4465058917827032153.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 3 LTL properties
Checking formula 0 : !((F((F(G(X(X("((((Threads2.NotifyEventSourceAddedE_2>=1)||(Threads3.NotifyEventSourceAddedE_3>=1))||((Threads4.NotifyEventSourceAdded...709
Formula 0 simplified : !F(FGXX"((((Threads2.NotifyEventSourceAddedE_2>=1)||(Threads3.NotifyEventSourceAddedE_3>=1))||((Threads4.NotifyEventSourceAddedE_4>=...692
Detected timeout of ITS tools.
[2022-05-18 09:09:26] [INFO ] Flatten gal took : 206 ms
[2022-05-18 09:09:27] [INFO ] Input system was already deterministic with 1048 transitions.
[2022-05-18 09:09:28] [INFO ] Transformed 550 places.
[2022-05-18 09:09:28] [INFO ] Transformed 1048 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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-05-18 09:09:58] [INFO ] Time to serialize gal into /tmp/LTLFireability3485133077308963279.gal : 32 ms
[2022-05-18 09:09:58] [INFO ] Time to serialize properties into /tmp/LTLFireability16678378366472356176.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3485133077308963279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16678378366472356176.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((F(G(X(X("((((NotifyEventSourceAddedE_2>=1)||(NotifyEventSourceAddedE_3>=1))||((NotifyEventSourceAddedE_4>=1)||(NotifyEventSource...523
Formula 0 simplified : !F(FGXX"((((NotifyEventSourceAddedE_2>=1)||(NotifyEventSourceAddedE_3>=1))||((NotifyEventSourceAddedE_4>=1)||(NotifyEventSourceAdded...506
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S04J04T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S04J04T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016800492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J04T06.tgz
mv PolyORBLF-COL-S04J04T06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;