About the Execution of ITS-Tools for DES-PT-50b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4881.256 | 1659439.00 | 5669095.00 | 1427.20 | FTFFFTTTFFFFFFFF | 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.r042-smll-165252095800524.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 DES-PT-50b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095800524
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 15:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 15:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 15:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 127K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-50b-LTLFireability-00
FORMULA_NAME DES-PT-50b-LTLFireability-01
FORMULA_NAME DES-PT-50b-LTLFireability-02
FORMULA_NAME DES-PT-50b-LTLFireability-03
FORMULA_NAME DES-PT-50b-LTLFireability-04
FORMULA_NAME DES-PT-50b-LTLFireability-05
FORMULA_NAME DES-PT-50b-LTLFireability-06
FORMULA_NAME DES-PT-50b-LTLFireability-07
FORMULA_NAME DES-PT-50b-LTLFireability-08
FORMULA_NAME DES-PT-50b-LTLFireability-09
FORMULA_NAME DES-PT-50b-LTLFireability-10
FORMULA_NAME DES-PT-50b-LTLFireability-11
FORMULA_NAME DES-PT-50b-LTLFireability-12
FORMULA_NAME DES-PT-50b-LTLFireability-13
FORMULA_NAME DES-PT-50b-LTLFireability-14
FORMULA_NAME DES-PT-50b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652781963022
Running Version 202205111006
[2022-05-17 10:06:04] [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-17 10:06:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 10:06:05] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2022-05-17 10:06:05] [INFO ] Transformed 479 places.
[2022-05-17 10:06:05] [INFO ] Transformed 430 transitions.
[2022-05-17 10:06:05] [INFO ] Found NUPN structural information;
[2022-05-17 10:06:05] [INFO ] Parsed PT model containing 479 places and 430 transitions in 357 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-50b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 430/430 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 476 transition count 430
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 459 transition count 413
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 459 transition count 413
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 47 place count 449 transition count 403
Iterating global reduction 1 with 10 rules applied. Total rules applied 57 place count 449 transition count 403
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 64 place count 449 transition count 396
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 448 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 448 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 448 transition count 394
Applied a total of 67 rules in 180 ms. Remains 448 /479 variables (removed 31) and now considering 394/430 (removed 36) transitions.
// Phase 1: matrix 394 rows 448 cols
[2022-05-17 10:06:05] [INFO ] Computed 62 place invariants in 55 ms
[2022-05-17 10:06:06] [INFO ] Implicit Places using invariants in 662 ms returned []
// Phase 1: matrix 394 rows 448 cols
[2022-05-17 10:06:06] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-17 10:06:07] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 448 cols
[2022-05-17 10:06:07] [INFO ] Computed 62 place invariants in 21 ms
[2022-05-17 10:06:07] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 448/479 places, 394/430 transitions.
Finished structural reductions, in 1 iterations. Remains : 448/479 places, 394/430 transitions.
Support contains 45 out of 448 places after structural reductions.
[2022-05-17 10:06:07] [INFO ] Flatten gal took : 99 ms
[2022-05-17 10:06:07] [INFO ] Flatten gal took : 47 ms
[2022-05-17 10:06:08] [INFO ] Input system was already deterministic with 394 transitions.
Support contains 40 out of 448 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 735 ms. (steps per millisecond=13 ) properties (out of 28) seen :18
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 394 rows 448 cols
[2022-05-17 10:06:09] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-17 10:06:09] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2022-05-17 10:06:09] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 46 ms returned sat
[2022-05-17 10:06:09] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-17 10:06:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 25 ms returned sat
[2022-05-17 10:06:10] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 41 ms returned sat
[2022-05-17 10:06:11] [INFO ] After 1015ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-17 10:06:11] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 6 ms to minimize.
[2022-05-17 10:06:11] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 2 ms to minimize.
[2022-05-17 10:06:12] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2022-05-17 10:06:12] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2022-05-17 10:06:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 800 ms
[2022-05-17 10:06:12] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2022-05-17 10:06:12] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2022-05-17 10:06:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2022-05-17 10:06:13] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 0 ms to minimize.
[2022-05-17 10:06:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2022-05-17 10:06:13] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 1 ms to minimize.
[2022-05-17 10:06:13] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 1 ms to minimize.
[2022-05-17 10:06:13] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2022-05-17 10:06:13] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 0 ms to minimize.
[2022-05-17 10:06:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 671 ms
[2022-05-17 10:06:14] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 1 ms to minimize.
[2022-05-17 10:06:14] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2022-05-17 10:06:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 407 ms
[2022-05-17 10:06:14] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2022-05-17 10:06:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2022-05-17 10:06:14] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2022-05-17 10:06:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-17 10:06:14] [INFO ] After 4499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 903 ms.
[2022-05-17 10:06:15] [INFO ] After 5800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 2612 ms.
Support contains 16 out of 448 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 448/448 places, 394/394 transitions.
Graph (complete) has 1040 edges and 448 vertex of which 446 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 446 transition count 373
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 429 transition count 373
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 429 transition count 363
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 419 transition count 363
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 412 transition count 356
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 412 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 412 transition count 355
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 406 transition count 349
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 406 transition count 349
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 89 place count 406 transition count 344
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 89 place count 406 transition count 342
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 93 place count 404 transition count 342
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 241 place count 330 transition count 268
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 245 place count 328 transition count 270
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 328 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 247 place count 327 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 326 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 249 place count 325 transition count 268
Applied a total of 249 rules in 233 ms. Remains 325 /448 variables (removed 123) and now considering 268/394 (removed 126) transitions.
Finished structural reductions, in 1 iterations. Remains : 325/448 places, 268/394 transitions.
Incomplete random walk after 10000 steps, including 414 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 275991 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{7=1}
Probabilistic random walk after 275991 steps, saw 62438 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :1
Running SMT prover for 8 properties.
// Phase 1: matrix 268 rows 325 cols
[2022-05-17 10:06:22] [INFO ] Computed 63 place invariants in 7 ms
[2022-05-17 10:06:23] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2022-05-17 10:06:23] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 39 ms returned sat
[2022-05-17 10:06:23] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-17 10:06:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 10:06:23] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 38 ms returned sat
[2022-05-17 10:06:24] [INFO ] After 691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-17 10:06:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:06:24] [INFO ] After 489ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-17 10:06:24] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2022-05-17 10:06:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 10:06:25] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2022-05-17 10:06:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2022-05-17 10:06:25] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2022-05-17 10:06:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2022-05-17 10:06:25] [INFO ] After 1368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 413 ms.
[2022-05-17 10:06:26] [INFO ] After 2844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 654 ms.
Support contains 15 out of 325 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 325/325 places, 268/268 transitions.
Applied a total of 0 rules in 16 ms. Remains 325 /325 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 325/325 places, 268/268 transitions.
Incomplete random walk after 10000 steps, including 413 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 267597 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267597 steps, saw 60520 distinct states, run finished after 3002 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 268 rows 325 cols
[2022-05-17 10:06:30] [INFO ] Computed 63 place invariants in 6 ms
[2022-05-17 10:06:30] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-17 10:06:30] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 38 ms returned sat
[2022-05-17 10:06:30] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-17 10:06:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2022-05-17 10:06:30] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 34 ms returned sat
[2022-05-17 10:06:31] [INFO ] After 640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-17 10:06:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:06:32] [INFO ] After 442ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-17 10:06:32] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2022-05-17 10:06:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-17 10:06:32] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2022-05-17 10:06:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-05-17 10:06:32] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:06:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-17 10:06:33] [INFO ] After 1280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 414 ms.
[2022-05-17 10:06:33] [INFO ] After 2667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 882 ms.
Support contains 15 out of 325 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 325/325 places, 268/268 transitions.
Applied a total of 0 rules in 16 ms. Remains 325 /325 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 325/325 places, 268/268 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 325/325 places, 268/268 transitions.
Applied a total of 0 rules in 18 ms. Remains 325 /325 variables (removed 0) and now considering 268/268 (removed 0) transitions.
// Phase 1: matrix 268 rows 325 cols
[2022-05-17 10:06:34] [INFO ] Computed 63 place invariants in 6 ms
[2022-05-17 10:06:34] [INFO ] Implicit Places using invariants in 350 ms returned []
// Phase 1: matrix 268 rows 325 cols
[2022-05-17 10:06:34] [INFO ] Computed 63 place invariants in 7 ms
[2022-05-17 10:06:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:06:35] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2022-05-17 10:06:35] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 268 rows 325 cols
[2022-05-17 10:06:35] [INFO ] Computed 63 place invariants in 8 ms
[2022-05-17 10:06:35] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 325/325 places, 268/268 transitions.
Applied a total of 0 rules in 14 ms. Remains 325 /325 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 268 rows 325 cols
[2022-05-17 10:06:35] [INFO ] Computed 63 place invariants in 6 ms
[2022-05-17 10:06:35] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-17 10:06:35] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 36 ms returned sat
[2022-05-17 10:06:35] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-17 10:06:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-17 10:06:36] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 37 ms returned sat
[2022-05-17 10:06:36] [INFO ] After 640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-17 10:06:37] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2022-05-17 10:06:37] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2022-05-17 10:06:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 335 ms
[2022-05-17 10:06:37] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2022-05-17 10:06:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 10:06:37] [INFO ] After 1689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 364 ms.
[2022-05-17 10:06:38] [INFO ] After 2378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-05-17 10:06:38] [INFO ] Flatten gal took : 36 ms
[2022-05-17 10:06:38] [INFO ] Flatten gal took : 34 ms
[2022-05-17 10:06:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17176211144885630274.gal : 10 ms
[2022-05-17 10:06:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17406376435290206627.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10244308532633339496;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17176211144885630274.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17406376435290206627.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17406376435290206627.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :13 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 114
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :114 after 126
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :126 after 362
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :362 after 2228
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :2228 after 9562
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :9562 after 230318
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :230318 after 446678
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :446678 after 1.67093e+06
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :3.49121e+06 after 3.85239e+09
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :5.38229e+09 after 5.3841e+09
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :5.52762e+09 after 5.22655e+10
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :6.25145e+10 after 2.1817e+11
Detected timeout of ITS tools.
[2022-05-17 10:06:53] [INFO ] Flatten gal took : 30 ms
[2022-05-17 10:06:53] [INFO ] Applying decomposition
[2022-05-17 10:06:53] [INFO ] Flatten gal took : 31 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/graph5565282142773853271.txt' '-o' '/tmp/graph5565282142773853271.bin' '-w' '/tmp/graph5565282142773853271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5565282142773853271.bin' '-l' '-1' '-v' '-w' '/tmp/graph5565282142773853271.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:06:53] [INFO ] Decomposing Gal with order
[2022-05-17 10:06:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:06:53] [INFO ] Removed a total of 36 redundant transitions.
[2022-05-17 10:06:53] [INFO ] Flatten gal took : 93 ms
[2022-05-17 10:06:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 17 ms.
[2022-05-17 10:06:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8704797239144258307.gal : 9 ms
[2022-05-17 10:06:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality450930553775266565.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10244308532633339496;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8704797239144258307.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality450930553775266565.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/ReachabilityCardinality450930553775266565.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :3 after 9
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :9 after 2953
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :89932 after 4.6839e+08
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :4.6839e+08 after 1.81008e+09
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1.81008e+09 after 3.08431e+09
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3.08431e+09 after 4.71236e+09
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :4.71236e+09 after 7.31724e+09
Reachability property AtomicPropp22 is true.
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :7.31724e+09 after 1.15785e+10
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :1.02668e+13 after 1.06103e+13
Reachability property AtomicPropp27 is true.
Reachability property AtomicPropp21 is true.
Reachability property AtomicPropp17 is true.
Reachability property AtomicPropp13 is true.
Reachability property AtomicPropp1 is true.
Reachability property AtomicPropp0 is true.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.4855e+14 after 1.49211e+14
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.73132e+14,8.14135,157960,10899,8749,358483,36651,308,272620,465,223489,0
Total reachable state count : 173132164795144
Verifying 8 reachability properties.
Reachability property AtomicPropp0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp0,7.76163e+09,8.16696,157960,347,533,358483,36651,316,272620,472,223489,0
Reachability property AtomicPropp1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp1,7.76163e+09,8.17208,157960,347,533,358483,36651,334,272620,479,223489,0
Reachability property AtomicPropp13 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp13,5.0357e+09,8.17453,157960,92,492,358483,36651,340,272620,484,223489,0
Reachability property AtomicPropp17 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp17,1.85177e+06,8.17665,157960,100,469,358483,36651,346,272620,488,223489,0
Reachability property AtomicPropp18 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp18,59392,8.18016,157960,74,213,358483,36651,352,272620,489,223489,168
Reachability property AtomicPropp21 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp21,1.28165e+08,8.1819,157960,341,567,358483,36651,358,272620,493,223489,168
Reachability property AtomicPropp22 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp22,7056,8.18254,157960,77,214,358483,36651,364,272620,497,223489,168
Reachability property AtomicPropp27 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp27,102336,8.18478,157960,84,360,358483,36651,370,272620,501,223489,168
Computed a total of 259 stabilizing places and 251 stable transitions
Graph (complete) has 1040 edges and 448 vertex of which 442 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.19 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !F(p1)))'
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Graph (complete) has 1040 edges and 448 vertex of which 442 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 441 transition count 375
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 426 transition count 375
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 426 transition count 365
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 416 transition count 365
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 409 transition count 358
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 409 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 409 transition count 357
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 72 place count 403 transition count 351
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 403 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 83 place count 403 transition count 346
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 83 place count 403 transition count 344
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 87 place count 401 transition count 344
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 235 place count 327 transition count 270
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 239 place count 325 transition count 272
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 323 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 242 place count 322 transition count 270
Applied a total of 242 rules in 136 ms. Remains 322 /448 variables (removed 126) and now considering 270/394 (removed 124) transitions.
// Phase 1: matrix 270 rows 322 cols
[2022-05-17 10:07:02] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 10:07:02] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 270 rows 322 cols
[2022-05-17 10:07:02] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 10:07:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:07:03] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
[2022-05-17 10:07:03] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 270 rows 322 cols
[2022-05-17 10:07:03] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-17 10:07:04] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/448 places, 270/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 322/448 places, 270/394 transitions.
Stuttering acceptance computed with spot in 289 ms :[p1, (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s112 1) (EQ s232 1) (EQ s177 1) (EQ s204 1))) (NOT (AND (EQ s36 1) (EQ s235 1)))), p0:(AND (EQ s36 1) (EQ s235 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 4 ms.
FORMULA DES-PT-50b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-00 finished in 2027 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Graph (complete) has 1040 edges and 448 vertex of which 442 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 441 transition count 376
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 427 transition count 374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 425 transition count 374
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 33 place count 425 transition count 363
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 55 place count 414 transition count 363
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 62 place count 407 transition count 356
Iterating global reduction 3 with 7 rules applied. Total rules applied 69 place count 407 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 407 transition count 355
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 76 place count 401 transition count 349
Iterating global reduction 4 with 6 rules applied. Total rules applied 82 place count 401 transition count 349
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 87 place count 401 transition count 344
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 87 place count 401 transition count 342
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 91 place count 399 transition count 342
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 245 place count 322 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 247 place count 321 transition count 265
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 249 place count 319 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 250 place count 318 transition count 263
Applied a total of 250 rules in 119 ms. Remains 318 /448 variables (removed 130) and now considering 263/394 (removed 131) transitions.
// Phase 1: matrix 263 rows 318 cols
[2022-05-17 10:07:04] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 10:07:04] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 263 rows 318 cols
[2022-05-17 10:07:04] [INFO ] Computed 58 place invariants in 6 ms
[2022-05-17 10:07:05] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
[2022-05-17 10:07:05] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 263 rows 318 cols
[2022-05-17 10:07:05] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:07:05] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 318/448 places, 263/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 318/448 places, 263/394 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s206 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 23848 reset in 646 ms.
Product exploration explored 100000 steps with 23810 reset in 544 ms.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 263 rows 318 cols
[2022-05-17 10:07:07] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:07:07] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2022-05-17 10:07:07] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 42 ms returned sat
[2022-05-17 10:07:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:07:09] [INFO ] [Real]Absence check using state equation in 1697 ms returned sat
[2022-05-17 10:07:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:07:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned sat
[2022-05-17 10:07:10] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 108 ms returned sat
[2022-05-17 10:07:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:07:11] [INFO ] [Nat]Absence check using state equation in 1242 ms returned sat
[2022-05-17 10:07:11] [INFO ] Computed and/alt/rep : 253/418/253 causal constraints (skipped 7 transitions) in 25 ms.
[2022-05-17 10:07:12] [INFO ] Added : 99 causal constraints over 20 iterations in 988 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 263/263 transitions.
Applied a total of 0 rules in 13 ms. Remains 318 /318 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 318 cols
[2022-05-17 10:07:12] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 10:07:12] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 263 rows 318 cols
[2022-05-17 10:07:12] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 10:07:13] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2022-05-17 10:07:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 263 rows 318 cols
[2022-05-17 10:07:13] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:07:13] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 318/318 places, 263/263 transitions.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 263 rows 318 cols
[2022-05-17 10:07:14] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:07:14] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-05-17 10:07:14] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 40 ms returned sat
[2022-05-17 10:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:07:16] [INFO ] [Real]Absence check using state equation in 1675 ms returned sat
[2022-05-17 10:07:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:07:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned sat
[2022-05-17 10:07:16] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 103 ms returned sat
[2022-05-17 10:07:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:07:17] [INFO ] [Nat]Absence check using state equation in 1213 ms returned sat
[2022-05-17 10:07:17] [INFO ] Computed and/alt/rep : 253/418/253 causal constraints (skipped 7 transitions) in 23 ms.
[2022-05-17 10:07:18] [INFO ] Added : 99 causal constraints over 20 iterations in 979 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23815 reset in 382 ms.
Product exploration explored 100000 steps with 23787 reset in 496 ms.
Built C files in :
/tmp/ltsmin12337258804531358039
[2022-05-17 10:07:19] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2022-05-17 10:07:19] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:07:19] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2022-05-17 10:07:19] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:07:19] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2022-05-17 10:07:19] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:07:19] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12337258804531358039
Running compilation step : cd /tmp/ltsmin12337258804531358039;'/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 1066 ms.
Running link step : cd /tmp/ltsmin12337258804531358039;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12337258804531358039;'/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/stateBased9360354199181403213.hoa' '--buchi-type=spotba'
LTSmin run took 363 ms.
FORMULA DES-PT-50b-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50b-LTLFireability-01 finished in 16876 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(X(G(F(X(X(p1)))))))))'
Support contains 4 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 439 transition count 385
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 439 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 439 transition count 384
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 434 transition count 379
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 434 transition count 379
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 33 place count 434 transition count 375
Applied a total of 33 rules in 36 ms. Remains 434 /448 variables (removed 14) and now considering 375/394 (removed 19) transitions.
// Phase 1: matrix 375 rows 434 cols
[2022-05-17 10:07:21] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:07:21] [INFO ] Implicit Places using invariants in 437 ms returned []
// Phase 1: matrix 375 rows 434 cols
[2022-05-17 10:07:21] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-17 10:07:22] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
// Phase 1: matrix 375 rows 434 cols
[2022-05-17 10:07:22] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-17 10:07:23] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434/448 places, 375/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 434/448 places, 375/394 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-50b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s268 1) (EQ s275 1)), p1:(AND (EQ s242 1) (EQ s266 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-02 finished in 2224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 440 transition count 386
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 440 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 440 transition count 385
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 435 transition count 380
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 435 transition count 380
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 435 transition count 376
Applied a total of 31 rules in 36 ms. Remains 435 /448 variables (removed 13) and now considering 376/394 (removed 18) transitions.
// Phase 1: matrix 376 rows 435 cols
[2022-05-17 10:07:23] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:07:23] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 376 rows 435 cols
[2022-05-17 10:07:23] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:07:24] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 435 cols
[2022-05-17 10:07:24] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-17 10:07:25] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 435/448 places, 376/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 435/448 places, 376/394 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s234 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 222 steps with 1 reset in 2 ms.
FORMULA DES-PT-50b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-03 finished in 1874 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((!X(F(p0)) U p1) U ((p0 U p2)||p2))))'
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 440 transition count 386
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 440 transition count 386
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 434 transition count 380
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 434 transition count 380
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 434 transition count 375
Applied a total of 33 rules in 33 ms. Remains 434 /448 variables (removed 14) and now considering 375/394 (removed 19) transitions.
// Phase 1: matrix 375 rows 434 cols
[2022-05-17 10:07:25] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-17 10:07:25] [INFO ] Implicit Places using invariants in 401 ms returned []
// Phase 1: matrix 375 rows 434 cols
[2022-05-17 10:07:25] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:07:26] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
// Phase 1: matrix 375 rows 434 cols
[2022-05-17 10:07:26] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-17 10:07:27] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434/448 places, 375/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 434/448 places, 375/394 transitions.
Stuttering acceptance computed with spot in 374 ms :[(NOT p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p2)), false, p0, (OR (NOT p1) p0), true, (NOT p2), (AND (NOT p2) p0), (NOT p2)]
Running random walk in product with property : DES-PT-50b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(NOT p2), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p2:(AND (EQ s256 1) (EQ s285 1)), p0:(AND (EQ s221 1) (EQ s271 1)), p1:(AND (EQ s104 1) (EQ s426 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 99 steps with 1 reset in 1 ms.
FORMULA DES-PT-50b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-04 finished in 2245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||!(!(X(p1)||p2) U X(X(p3)))))'
Support contains 4 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 439 transition count 385
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 439 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 439 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 433 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 433 transition count 378
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 36 place count 433 transition count 373
Applied a total of 36 rules in 36 ms. Remains 433 /448 variables (removed 15) and now considering 373/394 (removed 21) transitions.
// Phase 1: matrix 373 rows 433 cols
[2022-05-17 10:07:27] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-17 10:07:28] [INFO ] Implicit Places using invariants in 430 ms returned []
// Phase 1: matrix 373 rows 433 cols
[2022-05-17 10:07:28] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-17 10:07:28] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1371 ms to find 0 implicit places.
// Phase 1: matrix 373 rows 433 cols
[2022-05-17 10:07:28] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:07:29] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/448 places, 373/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 433/448 places, 373/394 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) p3), p3, (AND (NOT p0) p3), (AND (NOT p0) p3), p3, true, p3]
Running random walk in product with property : DES-PT-50b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p3, acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=p3, acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 1}, { cond=p3, acceptance={} source=6 dest: 5}]], initial=2, aps=[p0:(OR (EQ s1 0) (EQ s306 0)), p3:(EQ s1 1), p2:(EQ s358 1), p1:(EQ s275 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 588 ms.
Product exploration explored 100000 steps with 50000 reset in 535 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/433 stabilizing places and 248/373 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 245 ms. Reduced automaton from 7 states, 14 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-50b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50b-LTLFireability-05 finished in 3394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(!(X(p0) U p0))))||F(p1)))'
Support contains 3 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 440 transition count 386
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 440 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 440 transition count 385
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 434 transition count 379
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 434 transition count 379
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 434 transition count 374
Applied a total of 34 rules in 35 ms. Remains 434 /448 variables (removed 14) and now considering 374/394 (removed 20) transitions.
// Phase 1: matrix 374 rows 434 cols
[2022-05-17 10:07:30] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:07:31] [INFO ] Implicit Places using invariants in 423 ms returned []
// Phase 1: matrix 374 rows 434 cols
[2022-05-17 10:07:31] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-17 10:07:32] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
// Phase 1: matrix 374 rows 434 cols
[2022-05-17 10:07:32] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-17 10:07:32] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434/448 places, 374/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 434/448 places, 374/394 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s402 1), p0:(AND (EQ s172 1) (EQ s222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1008 reset in 399 ms.
Product exploration explored 100000 steps with 1002 reset in 253 ms.
Computed a total of 257 stabilizing places and 249 stable transitions
Graph (complete) has 1007 edges and 434 vertex of which 428 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 257 stabilizing places and 249 stable transitions
Detected a total of 257/434 stabilizing places and 249/374 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 85 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 434 cols
[2022-05-17 10:07:33] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-17 10:07:34] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-05-17 10:07:34] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 44 ms returned sat
[2022-05-17 10:07:34] [INFO ] After 491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:07:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-05-17 10:07:34] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 40 ms returned sat
[2022-05-17 10:07:34] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:07:34] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:07:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2022-05-17 10:07:35] [INFO ] After 452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2022-05-17 10:07:35] [INFO ] After 652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 434/434 places, 374/374 transitions.
Graph (complete) has 1007 edges and 434 vertex of which 428 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 428 transition count 353
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 412 transition count 353
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 412 transition count 341
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 400 transition count 341
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 211 place count 324 transition count 265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 322 transition count 267
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 322 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 321 transition count 266
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 321 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 320 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 319 transition count 265
Applied a total of 220 rules in 79 ms. Remains 319 /434 variables (removed 115) and now considering 265/374 (removed 109) transitions.
Finished structural reductions, in 1 iterations. Remains : 319/434 places, 265/374 transitions.
Incomplete random walk after 10000 steps, including 430 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1136680 steps, run timeout after 3001 ms. (steps per millisecond=378 ) properties seen :{}
Probabilistic random walk after 1136680 steps, saw 155874 distinct states, run finished after 3001 ms. (steps per millisecond=378 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 265 rows 319 cols
[2022-05-17 10:07:38] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 10:07:38] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-17 10:07:38] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 25 ms returned sat
[2022-05-17 10:07:38] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:07:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-17 10:07:38] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 228 ms returned sat
[2022-05-17 10:07:39] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:07:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:07:39] [INFO ] After 36ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:07:39] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-17 10:07:39] [INFO ] After 831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 319 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 319/319 places, 265/265 transitions.
Applied a total of 0 rules in 9 ms. Remains 319 /319 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 319/319 places, 265/265 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 319/319 places, 265/265 transitions.
Applied a total of 0 rules in 9 ms. Remains 319 /319 variables (removed 0) and now considering 265/265 (removed 0) transitions.
// Phase 1: matrix 265 rows 319 cols
[2022-05-17 10:07:39] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 10:07:39] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 265 rows 319 cols
[2022-05-17 10:07:39] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 10:07:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:07:40] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
[2022-05-17 10:07:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 265 rows 319 cols
[2022-05-17 10:07:40] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 10:07:40] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 319/319 places, 265/265 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 319 transition count 265
Applied a total of 1 rules in 17 ms. Remains 319 /319 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 265 rows 319 cols
[2022-05-17 10:07:40] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 10:07:40] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-17 10:07:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 25 ms returned sat
[2022-05-17 10:07:40] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:07:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-17 10:07:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 233 ms returned sat
[2022-05-17 10:07:41] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:07:41] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2022-05-17 10:07:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2022-05-17 10:07:41] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-17 10:07:41] [INFO ] After 829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:07:41] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:07:41] [INFO ] Flatten gal took : 27 ms
[2022-05-17 10:07:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11478972369894189286.gal : 5 ms
[2022-05-17 10:07:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9986669502163092631.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15127693017191788440;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11478972369894189286.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9986669502163092631.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality9986669502163092631.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 48
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :48 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 1438
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1438 after 2622
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2622 after 35820
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :35820 after 255388
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :255388 after 459740
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :459740 after 2.54694e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.35954e+09 after 3.53985e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.69584e+09 after 3.71338e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.46004e+10 after 3.48575e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.03355e+11 after 1.35485e+11
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :3.44793e+11 after 3.46073e+11
Detected timeout of ITS tools.
[2022-05-17 10:07:56] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:07:56] [INFO ] Applying decomposition
[2022-05-17 10:07:56] [INFO ] Flatten gal took : 26 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/graph6412390295655062223.txt' '-o' '/tmp/graph6412390295655062223.bin' '-w' '/tmp/graph6412390295655062223.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6412390295655062223.bin' '-l' '-1' '-v' '-w' '/tmp/graph6412390295655062223.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:07:56] [INFO ] Decomposing Gal with order
[2022-05-17 10:07:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:07:56] [INFO ] Removed a total of 37 redundant transitions.
[2022-05-17 10:07:56] [INFO ] Flatten gal took : 39 ms
[2022-05-17 10:07:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2022-05-17 10:07:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality713375563971934450.gal : 5 ms
[2022-05-17 10:07:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14748000016081661908.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15127693017191788440;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality713375563971934450.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14748000016081661908.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality14748000016081661908.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 291
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :291 after 2313
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2313 after 7014
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :64384 after 168016
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :168016 after 4.75847e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.75847e+09 after 7.88297e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7.88297e+09 after 1.21792e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.79831e+12 after 3.79913e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1139864796885392290
[2022-05-17 10:08:11] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1139864796885392290
Running compilation step : cd /tmp/ltsmin1139864796885392290;'/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 714 ms.
Running link step : cd /tmp/ltsmin1139864796885392290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1139864796885392290;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 374/374 transitions.
Applied a total of 0 rules in 10 ms. Remains 434 /434 variables (removed 0) and now considering 374/374 (removed 0) transitions.
// Phase 1: matrix 374 rows 434 cols
[2022-05-17 10:08:27] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-17 10:08:27] [INFO ] Implicit Places using invariants in 410 ms returned []
// Phase 1: matrix 374 rows 434 cols
[2022-05-17 10:08:27] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-17 10:08:28] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
// Phase 1: matrix 374 rows 434 cols
[2022-05-17 10:08:28] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-17 10:08:29] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 434/434 places, 374/374 transitions.
Computed a total of 257 stabilizing places and 249 stable transitions
Graph (complete) has 1007 edges and 434 vertex of which 428 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 257 stabilizing places and 249 stable transitions
Detected a total of 257/434 stabilizing places and 249/374 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 90 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 434 cols
[2022-05-17 10:08:29] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:08:29] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-05-17 10:08:29] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 48 ms returned sat
[2022-05-17 10:08:30] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:08:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2022-05-17 10:08:30] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 45 ms returned sat
[2022-05-17 10:08:30] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:08:30] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:08:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-05-17 10:08:30] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-05-17 10:08:30] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 434/434 places, 374/374 transitions.
Graph (complete) has 1007 edges and 434 vertex of which 428 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 428 transition count 353
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 412 transition count 353
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 412 transition count 341
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 400 transition count 341
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 211 place count 324 transition count 265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 322 transition count 267
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 322 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 321 transition count 266
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 321 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 320 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 319 transition count 265
Applied a total of 220 rules in 75 ms. Remains 319 /434 variables (removed 115) and now considering 265/374 (removed 109) transitions.
Finished structural reductions, in 1 iterations. Remains : 319/434 places, 265/374 transitions.
Incomplete random walk after 10000 steps, including 412 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1127051 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :{}
Probabilistic random walk after 1127051 steps, saw 154623 distinct states, run finished after 3001 ms. (steps per millisecond=375 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 265 rows 319 cols
[2022-05-17 10:08:33] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 10:08:33] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-17 10:08:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 25 ms returned sat
[2022-05-17 10:08:33] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:08:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-17 10:08:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 228 ms returned sat
[2022-05-17 10:08:34] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:08:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:08:34] [INFO ] After 28ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:08:34] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-17 10:08:34] [INFO ] After 826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 319 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 319/319 places, 265/265 transitions.
Applied a total of 0 rules in 8 ms. Remains 319 /319 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 319/319 places, 265/265 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 319/319 places, 265/265 transitions.
Applied a total of 0 rules in 8 ms. Remains 319 /319 variables (removed 0) and now considering 265/265 (removed 0) transitions.
// Phase 1: matrix 265 rows 319 cols
[2022-05-17 10:08:34] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 10:08:35] [INFO ] Implicit Places using invariants in 401 ms returned []
// Phase 1: matrix 265 rows 319 cols
[2022-05-17 10:08:35] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 10:08:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:08:35] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
[2022-05-17 10:08:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 265 rows 319 cols
[2022-05-17 10:08:35] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 10:08:36] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 319/319 places, 265/265 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 319 transition count 265
Applied a total of 1 rules in 23 ms. Remains 319 /319 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 265 rows 319 cols
[2022-05-17 10:08:36] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-17 10:08:36] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-05-17 10:08:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2022-05-17 10:08:36] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:08:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-17 10:08:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 234 ms returned sat
[2022-05-17 10:08:37] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:08:37] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2022-05-17 10:08:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2022-05-17 10:08:37] [INFO ] After 448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-17 10:08:37] [INFO ] After 812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:08:37] [INFO ] Flatten gal took : 18 ms
[2022-05-17 10:08:37] [INFO ] Flatten gal took : 19 ms
[2022-05-17 10:08:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5763295617109623889.gal : 3 ms
[2022-05-17 10:08:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3839719886839649663.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13311599632000564215;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5763295617109623889.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3839719886839649663.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3839719886839649663.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 48
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :48 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 1438
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1438 after 2622
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2622 after 35820
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :35820 after 255388
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :255388 after 459740
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :459740 after 2.54694e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.35954e+09 after 3.53985e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.69584e+09 after 3.71338e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.46004e+10 after 3.48575e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.03355e+11 after 1.35485e+11
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :3.44793e+11 after 3.46073e+11
Detected timeout of ITS tools.
[2022-05-17 10:08:52] [INFO ] Flatten gal took : 17 ms
[2022-05-17 10:08:52] [INFO ] Applying decomposition
[2022-05-17 10:08:52] [INFO ] Flatten gal took : 16 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/graph3574867403519737579.txt' '-o' '/tmp/graph3574867403519737579.bin' '-w' '/tmp/graph3574867403519737579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3574867403519737579.bin' '-l' '-1' '-v' '-w' '/tmp/graph3574867403519737579.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:08:52] [INFO ] Decomposing Gal with order
[2022-05-17 10:08:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:08:52] [INFO ] Removed a total of 36 redundant transitions.
[2022-05-17 10:08:52] [INFO ] Flatten gal took : 28 ms
[2022-05-17 10:08:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2022-05-17 10:08:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10695920181639362908.gal : 4 ms
[2022-05-17 10:08:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8453681537230724460.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13311599632000564215;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10695920181639362908.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8453681537230724460.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality8453681537230724460.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 1158
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1158 after 9694
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :64384 after 612556
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :612556 after 2.21262e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.21262e+09 after 4.16543e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.16543e+09 after 7.28991e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7.28991e+09 after 1.19767e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.8196e+13 after 2.02596e+13
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7624524985761959236
[2022-05-17 10:09:07] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7624524985761959236
Running compilation step : cd /tmp/ltsmin7624524985761959236;'/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 711 ms.
Running link step : cd /tmp/ltsmin7624524985761959236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7624524985761959236;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 1002 reset in 199 ms.
Product exploration explored 100000 steps with 1003 reset in 240 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 374/374 transitions.
Graph (complete) has 1007 edges and 434 vertex of which 428 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 428 transition count 371
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 15 place count 428 transition count 373
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 428 transition count 373
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 423 transition count 368
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 423 transition count 368
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 1 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 110 place count 423 transition count 371
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 120 place count 413 transition count 361
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 130 place count 413 transition count 361
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 413 transition count 389
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 411 transition count 383
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 411 transition count 383
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 140 rules in 126 ms. Remains 411 /434 variables (removed 23) and now considering 383/374 (removed -9) transitions.
[2022-05-17 10:09:24] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 383 rows 411 cols
[2022-05-17 10:09:24] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 10:09:24] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/434 places, 383/374 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/434 places, 383/374 transitions.
Product exploration explored 100000 steps with 4525 reset in 576 ms.
Product exploration explored 100000 steps with 4553 reset in 591 ms.
Built C files in :
/tmp/ltsmin16739387941492882780
[2022-05-17 10:09:25] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16739387941492882780
Running compilation step : cd /tmp/ltsmin16739387941492882780;'/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 900 ms.
Running link step : cd /tmp/ltsmin16739387941492882780;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16739387941492882780;'/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/stateBased276157205956891415.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 374/374 transitions.
Applied a total of 0 rules in 27 ms. Remains 434 /434 variables (removed 0) and now considering 374/374 (removed 0) transitions.
// Phase 1: matrix 374 rows 434 cols
[2022-05-17 10:09:40] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:09:41] [INFO ] Implicit Places using invariants in 408 ms returned []
// Phase 1: matrix 374 rows 434 cols
[2022-05-17 10:09:41] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:09:42] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
// Phase 1: matrix 374 rows 434 cols
[2022-05-17 10:09:42] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-17 10:09:42] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 434/434 places, 374/374 transitions.
Built C files in :
/tmp/ltsmin322513017959776643
[2022-05-17 10:09:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin322513017959776643
Running compilation step : cd /tmp/ltsmin322513017959776643;'/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 893 ms.
Running link step : cd /tmp/ltsmin322513017959776643;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin322513017959776643;'/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/stateBased12039647634144197892.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 10:09:57] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:09:57] [INFO ] Flatten gal took : 16 ms
[2022-05-17 10:09:57] [INFO ] Time to serialize gal into /tmp/LTL9388555426620941301.gal : 3 ms
[2022-05-17 10:09:57] [INFO ] Time to serialize properties into /tmp/LTL2725591747796095850.ltl : 6 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/LTL9388555426620941301.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2725591747796095850.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/LTL9388555...266
Read 1 LTL properties
Checking formula 0 : !(((X(X(G(!((X("((p173==1)&&(p229==1))"))U("((p173==1)&&(p229==1))"))))))||(F("(p444==1)"))))
Formula 0 simplified : !(XXG!(X"((p173==1)&&(p229==1))" U "((p173==1)&&(p229==1))") | F"(p444==1)")
Detected timeout of ITS tools.
[2022-05-17 10:10:12] [INFO ] Flatten gal took : 15 ms
[2022-05-17 10:10:12] [INFO ] Applying decomposition
[2022-05-17 10:10:12] [INFO ] Flatten gal took : 17 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/graph828419061456018657.txt' '-o' '/tmp/graph828419061456018657.bin' '-w' '/tmp/graph828419061456018657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph828419061456018657.bin' '-l' '-1' '-v' '-w' '/tmp/graph828419061456018657.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:10:12] [INFO ] Decomposing Gal with order
[2022-05-17 10:10:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:10:12] [INFO ] Removed a total of 10 redundant transitions.
[2022-05-17 10:10:12] [INFO ] Flatten gal took : 32 ms
[2022-05-17 10:10:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2022-05-17 10:10:12] [INFO ] Time to serialize gal into /tmp/LTL4262444293248168668.gal : 7 ms
[2022-05-17 10:10:12] [INFO ] Time to serialize properties into /tmp/LTL167084809815092507.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/LTL4262444293248168668.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL167084809815092507.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/LTL4262444...244
Read 1 LTL properties
Checking formula 0 : !(((X(X(G(!((X("((i3.u8.p173==1)&&(i3.u8.p229==1))"))U("((i3.u8.p173==1)&&(i3.u8.p229==1))"))))))||(F("(i7.i1.i0.u62.p444==1)"))))
Formula 0 simplified : !(XXG!(X"((i3.u8.p173==1)&&(i3.u8.p229==1))" U "((i3.u8.p173==1)&&(i3.u8.p229==1))") | F"(i7.i1.i0.u62.p444==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8508183589172239674
[2022-05-17 10:10:28] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8508183589172239674
Running compilation step : cd /tmp/ltsmin8508183589172239674;'/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 937 ms.
Running link step : cd /tmp/ltsmin8508183589172239674;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8508183589172239674;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X([](!(X((LTLAPp0==true)) U (LTLAPp0==true)))))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50b-LTLFireability-06 finished in 192164 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(!G(((G(p1)&&p1) U p0)))))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 441 transition count 387
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 441 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 441 transition count 386
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 436 transition count 381
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 436 transition count 381
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 29 place count 436 transition count 377
Applied a total of 29 rules in 46 ms. Remains 436 /448 variables (removed 12) and now considering 377/394 (removed 17) transitions.
// Phase 1: matrix 377 rows 436 cols
[2022-05-17 10:10:43] [INFO ] Computed 62 place invariants in 6 ms
[2022-05-17 10:10:43] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 377 rows 436 cols
[2022-05-17 10:10:43] [INFO ] Computed 62 place invariants in 6 ms
[2022-05-17 10:10:44] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
// Phase 1: matrix 377 rows 436 cols
[2022-05-17 10:10:44] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-17 10:10:45] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 436/448 places, 377/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 436/448 places, 377/394 transitions.
Stuttering acceptance computed with spot in 138 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : DES-PT-50b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s215 1), p1:(EQ s276 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 625 ms.
Product exploration explored 100000 steps with 50000 reset in 510 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1012 edges and 436 vertex of which 430 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 6 factoid took 169 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-50b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50b-LTLFireability-07 finished in 3399 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((F((X(p1)||F(p2)))&&p0)))))'
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Graph (complete) has 1040 edges and 448 vertex of which 446 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 445 transition count 377
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 431 transition count 377
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 431 transition count 365
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 419 transition count 365
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 412 transition count 358
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 412 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 412 transition count 357
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 74 place count 406 transition count 351
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 406 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 85 place count 406 transition count 346
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 85 place count 406 transition count 344
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 89 place count 404 transition count 344
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 237 place count 330 transition count 270
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 328 transition count 272
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 326 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 244 place count 325 transition count 270
Applied a total of 244 rules in 76 ms. Remains 325 /448 variables (removed 123) and now considering 270/394 (removed 124) transitions.
// Phase 1: matrix 270 rows 325 cols
[2022-05-17 10:10:46] [INFO ] Computed 61 place invariants in 5 ms
[2022-05-17 10:10:46] [INFO ] Implicit Places using invariants in 375 ms returned []
// Phase 1: matrix 270 rows 325 cols
[2022-05-17 10:10:46] [INFO ] Computed 61 place invariants in 6 ms
[2022-05-17 10:10:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:10:47] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1110 ms to find 0 implicit places.
[2022-05-17 10:10:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 270 rows 325 cols
[2022-05-17 10:10:47] [INFO ] Computed 61 place invariants in 6 ms
[2022-05-17 10:10:47] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 325/448 places, 270/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 325/448 places, 270/394 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-50b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s161 1) (EQ s209 1)), p2:(AND (EQ s51 1) (EQ s320 1)), p1:(OR (EQ s2 0) (EQ s52 0) (EQ s103 0) (EQ s154 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-08 finished in 1621 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p1))'
Support contains 3 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 440 transition count 386
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 440 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 440 transition count 385
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 435 transition count 380
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 435 transition count 380
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 435 transition count 376
Applied a total of 31 rules in 28 ms. Remains 435 /448 variables (removed 13) and now considering 376/394 (removed 18) transitions.
// Phase 1: matrix 376 rows 435 cols
[2022-05-17 10:10:48] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:10:48] [INFO ] Implicit Places using invariants in 432 ms returned []
// Phase 1: matrix 376 rows 435 cols
[2022-05-17 10:10:48] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:10:49] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 435 cols
[2022-05-17 10:10:49] [INFO ] Computed 62 place invariants in 6 ms
[2022-05-17 10:10:49] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 435/448 places, 376/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 435/448 places, 376/394 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s42 1) (EQ s291 1)), p0:(EQ s236 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-09 finished in 1860 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 3 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Graph (complete) has 1040 edges and 448 vertex of which 442 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 441 transition count 374
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 425 transition count 374
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 425 transition count 363
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 414 transition count 363
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 61 place count 408 transition count 357
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 408 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 408 transition count 356
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 73 place count 403 transition count 351
Iterating global reduction 3 with 5 rules applied. Total rules applied 78 place count 403 transition count 351
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 82 place count 403 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 82 place count 403 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 402 transition count 346
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 234 place count 327 transition count 271
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 238 place count 325 transition count 273
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 240 place count 323 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 241 place count 322 transition count 271
Applied a total of 241 rules in 64 ms. Remains 322 /448 variables (removed 126) and now considering 271/394 (removed 123) transitions.
// Phase 1: matrix 271 rows 322 cols
[2022-05-17 10:10:50] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:10:50] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 271 rows 322 cols
[2022-05-17 10:10:50] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:10:50] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2022-05-17 10:10:50] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 271 rows 322 cols
[2022-05-17 10:10:50] [INFO ] Computed 58 place invariants in 8 ms
[2022-05-17 10:10:51] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/448 places, 271/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 322/448 places, 271/394 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-50b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s122 1) (EQ s233 1)), p1:(NEQ s226 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4965 reset in 256 ms.
Product exploration explored 100000 steps with 5044 reset in 289 ms.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Detected a total of 216/322 stabilizing places and 211/271 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 209 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Finished random walk after 63 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Support contains 1 out of 322 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 : 322/322 places, 271/271 transitions.
Applied a total of 0 rules in 8 ms. Remains 322 /322 variables (removed 0) and now considering 271/271 (removed 0) transitions.
// Phase 1: matrix 271 rows 322 cols
[2022-05-17 10:10:52] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:10:52] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 271 rows 322 cols
[2022-05-17 10:10:52] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:10:53] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
[2022-05-17 10:10:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 271 rows 322 cols
[2022-05-17 10:10:53] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 10:10:53] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 322/322 places, 271/271 transitions.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Finished random walk after 173 steps, including 10 resets, run visited all 1 properties in 1 ms. (steps per millisecond=173 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 5001 reset in 254 ms.
Product exploration explored 100000 steps with 5069 reset in 286 ms.
Built C files in :
/tmp/ltsmin4119412764254162776
[2022-05-17 10:10:54] [INFO ] Computing symmetric may disable matrix : 271 transitions.
[2022-05-17 10:10:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:10:54] [INFO ] Computing symmetric may enable matrix : 271 transitions.
[2022-05-17 10:10:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:10:54] [INFO ] Computing Do-Not-Accords matrix : 271 transitions.
[2022-05-17 10:10:54] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:10:54] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4119412764254162776
Running compilation step : cd /tmp/ltsmin4119412764254162776;'/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 910 ms.
Running link step : cd /tmp/ltsmin4119412764254162776;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4119412764254162776;'/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/stateBased6609500451849921367.hoa' '--buchi-type=spotba'
LTSmin run took 2859 ms.
FORMULA DES-PT-50b-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50b-LTLFireability-11 finished in 8445 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 439 transition count 385
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 439 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 439 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 433 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 433 transition count 378
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 36 place count 433 transition count 373
Applied a total of 36 rules in 25 ms. Remains 433 /448 variables (removed 15) and now considering 373/394 (removed 21) transitions.
// Phase 1: matrix 373 rows 433 cols
[2022-05-17 10:10:58] [INFO ] Computed 62 place invariants in 6 ms
[2022-05-17 10:10:58] [INFO ] Implicit Places using invariants in 392 ms returned []
// Phase 1: matrix 373 rows 433 cols
[2022-05-17 10:10:58] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:10:59] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
// Phase 1: matrix 373 rows 433 cols
[2022-05-17 10:10:59] [INFO ] Computed 62 place invariants in 6 ms
[2022-05-17 10:11:00] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/448 places, 373/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 433/448 places, 373/394 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s50 1) (EQ s289 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-13 finished in 1777 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(X(p0))||X((G(X(X(p1)))&&p0))))))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Graph (complete) has 1040 edges and 448 vertex of which 442 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 441 transition count 375
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 426 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 425 transition count 374
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 33 place count 425 transition count 363
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 55 place count 414 transition count 363
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 61 place count 408 transition count 357
Iterating global reduction 3 with 6 rules applied. Total rules applied 67 place count 408 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 408 transition count 356
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 73 place count 403 transition count 351
Iterating global reduction 4 with 5 rules applied. Total rules applied 78 place count 403 transition count 351
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 82 place count 403 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 82 place count 403 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 84 place count 402 transition count 346
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 236 place count 326 transition count 270
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 240 place count 324 transition count 272
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 242 place count 322 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 243 place count 321 transition count 270
Applied a total of 243 rules in 74 ms. Remains 321 /448 variables (removed 127) and now considering 270/394 (removed 124) transitions.
// Phase 1: matrix 270 rows 321 cols
[2022-05-17 10:11:00] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:11:00] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 270 rows 321 cols
[2022-05-17 10:11:00] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:11:01] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
[2022-05-17 10:11:01] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 270 rows 321 cols
[2022-05-17 10:11:01] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 10:11:01] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/448 places, 270/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 321/448 places, 270/394 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s226 1), p1:(EQ s316 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-14 finished in 1602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 439 transition count 385
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 439 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 439 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 433 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 433 transition count 378
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 36 place count 433 transition count 373
Applied a total of 36 rules in 27 ms. Remains 433 /448 variables (removed 15) and now considering 373/394 (removed 21) transitions.
// Phase 1: matrix 373 rows 433 cols
[2022-05-17 10:11:01] [INFO ] Computed 62 place invariants in 6 ms
[2022-05-17 10:11:02] [INFO ] Implicit Places using invariants in 407 ms returned []
// Phase 1: matrix 373 rows 433 cols
[2022-05-17 10:11:02] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:11:03] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
// Phase 1: matrix 373 rows 433 cols
[2022-05-17 10:11:03] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 10:11:03] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/448 places, 373/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 433/448 places, 373/394 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s196 1) (EQ s222 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 102 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-15 finished in 1878 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(!(X(p0) U p0))))||F(p1)))'
Found a SL insensitive property : DES-PT-50b-LTLFireability-06
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 448 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 448/448 places, 394/394 transitions.
Graph (complete) has 1040 edges and 448 vertex of which 442 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 441 transition count 376
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 427 transition count 376
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 427 transition count 365
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 416 transition count 365
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 409 transition count 358
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 409 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 409 transition count 357
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 72 place count 403 transition count 351
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 403 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 83 place count 403 transition count 346
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 83 place count 403 transition count 344
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 87 place count 401 transition count 344
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 239 place count 325 transition count 268
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 243 place count 323 transition count 270
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 245 place count 321 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 246 place count 320 transition count 268
Applied a total of 246 rules in 70 ms. Remains 320 /448 variables (removed 128) and now considering 268/394 (removed 126) transitions.
// Phase 1: matrix 268 rows 320 cols
[2022-05-17 10:11:04] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:11:04] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 268 rows 320 cols
[2022-05-17 10:11:04] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:11:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:11:05] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
// Phase 1: matrix 268 rows 320 cols
[2022-05-17 10:11:05] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-17 10:11:05] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 320/448 places, 268/394 transitions.
Finished structural reductions, in 1 iterations. Remains : 320/448 places, 268/394 transitions.
Running random walk in product with property : DES-PT-50b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s299 1), p0:(AND (EQ s164 1) (EQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5713 reset in 299 ms.
Product exploration explored 100000 steps with 5721 reset in 318 ms.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Detected a total of 216/320 stabilizing places and 211/268 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 492 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 268 rows 320 cols
[2022-05-17 10:11:06] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 10:11:06] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-05-17 10:11:06] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 25 ms returned sat
[2022-05-17 10:11:06] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:11:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2022-05-17 10:11:06] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 85 ms returned sat
[2022-05-17 10:11:07] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:11:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:11:07] [INFO ] After 34ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:11:07] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-17 10:11:07] [INFO ] After 475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 320/320 places, 268/268 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 320 transition count 267
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 320 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 319 transition count 266
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 319 transition count 266
Applied a total of 4 rules in 25 ms. Remains 319 /320 variables (removed 1) and now considering 266/268 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 319/320 places, 266/268 transitions.
Incomplete random walk after 10000 steps, including 477 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1154883 steps, run timeout after 3001 ms. (steps per millisecond=384 ) properties seen :{}
Probabilistic random walk after 1154883 steps, saw 158070 distinct states, run finished after 3001 ms. (steps per millisecond=384 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 266 rows 319 cols
[2022-05-17 10:11:10] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-17 10:11:10] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 10:11:10] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 23 ms returned sat
[2022-05-17 10:11:10] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:11:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-17 10:11:10] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 108 ms returned sat
[2022-05-17 10:11:11] [INFO ] After 712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:11:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:11:11] [INFO ] After 39ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:11:11] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-17 10:11:11] [INFO ] After 1041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 319 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 319/319 places, 266/266 transitions.
Applied a total of 0 rules in 7 ms. Remains 319 /319 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 319/319 places, 266/266 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 319/319 places, 266/266 transitions.
Applied a total of 0 rules in 10 ms. Remains 319 /319 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 319 cols
[2022-05-17 10:11:11] [INFO ] Computed 59 place invariants in 5 ms
[2022-05-17 10:11:11] [INFO ] Implicit Places using invariants in 352 ms returned []
// Phase 1: matrix 266 rows 319 cols
[2022-05-17 10:11:11] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-17 10:11:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:11:12] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
[2022-05-17 10:11:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 266 rows 319 cols
[2022-05-17 10:11:12] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 10:11:12] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 319/319 places, 266/266 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 319 transition count 266
Applied a total of 1 rules in 19 ms. Remains 319 /319 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 266 rows 319 cols
[2022-05-17 10:11:13] [INFO ] Computed 59 place invariants in 7 ms
[2022-05-17 10:11:13] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 10:11:13] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 26 ms returned sat
[2022-05-17 10:11:13] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:11:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 10:11:13] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 115 ms returned sat
[2022-05-17 10:11:14] [INFO ] After 641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:11:14] [INFO ] After 676ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-17 10:11:14] [INFO ] After 915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:11:14] [INFO ] Flatten gal took : 18 ms
[2022-05-17 10:11:14] [INFO ] Flatten gal took : 13 ms
[2022-05-17 10:11:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14322994132602052304.gal : 3 ms
[2022-05-17 10:11:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10565057566657726476.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10580040091922059704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14322994132602052304.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10565057566657726476.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality10565057566657726476.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 54
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :54 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 1258
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1258 after 2042
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2042 after 42216
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :42216 after 299362
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :299362 after 535442
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :535442 after 3.01929e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.76169e+09 after 4.14261e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.3264e+09 after 4.33742e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.93453e+10 after 4.16284e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.24794e+11 after 1.63846e+11
SDD proceeding with computation,1 properties remain. new max is 131072
Detected timeout of ITS tools.
[2022-05-17 10:11:29] [INFO ] Flatten gal took : 13 ms
[2022-05-17 10:11:29] [INFO ] Applying decomposition
[2022-05-17 10:11:29] [INFO ] Flatten gal took : 13 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/graph16743593910960314903.txt' '-o' '/tmp/graph16743593910960314903.bin' '-w' '/tmp/graph16743593910960314903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16743593910960314903.bin' '-l' '-1' '-v' '-w' '/tmp/graph16743593910960314903.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:11:29] [INFO ] Decomposing Gal with order
[2022-05-17 10:11:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:11:29] [INFO ] Removed a total of 36 redundant transitions.
[2022-05-17 10:11:29] [INFO ] Flatten gal took : 25 ms
[2022-05-17 10:11:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-05-17 10:11:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10528018139540977118.gal : 4 ms
[2022-05-17 10:11:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13266867580871509384.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10580040091922059704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10528018139540977118.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13266867580871509384.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality13266867580871509384.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 870
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :870 after 11858
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :75178 after 598880
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :598880 after 2.59151e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.59151e+09 after 4.89213e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.89213e+09 after 8.57053e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.57053e+09 after 1.4092e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.50995e+13 after 2.51474e+13
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.7419e+13,12.7302,272696,36171,7390,643495,22539,305,911215,461,144773,0
Total reachable state count : 97419042633140
Verifying 1 reachability properties.
Reachability property apf1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,142128,13.0982,272696,83,314,643495,22539,318,911215,470,144773,0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 268/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 320 /320 variables (removed 0) and now considering 268/268 (removed 0) transitions.
// Phase 1: matrix 268 rows 320 cols
[2022-05-17 10:11:42] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:11:43] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 268 rows 320 cols
[2022-05-17 10:11:43] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 10:11:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:11:43] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
// Phase 1: matrix 268 rows 320 cols
[2022-05-17 10:11:44] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:11:44] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 320/320 places, 268/268 transitions.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Detected a total of 216/320 stabilizing places and 211/268 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 490 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 268 rows 320 cols
[2022-05-17 10:11:44] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:11:44] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2022-05-17 10:11:44] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 27 ms returned sat
[2022-05-17 10:11:44] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:11:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2022-05-17 10:11:45] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 84 ms returned sat
[2022-05-17 10:11:45] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:11:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:11:45] [INFO ] After 34ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:11:45] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 10:11:45] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 320/320 places, 268/268 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 320 transition count 267
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 320 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 319 transition count 266
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 319 transition count 266
Applied a total of 4 rules in 19 ms. Remains 319 /320 variables (removed 1) and now considering 266/268 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 319/320 places, 266/268 transitions.
Incomplete random walk after 10000 steps, including 457 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1159422 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :{}
Probabilistic random walk after 1159422 steps, saw 158629 distinct states, run finished after 3001 ms. (steps per millisecond=386 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 266 rows 319 cols
[2022-05-17 10:11:48] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 10:11:48] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-17 10:11:48] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 25 ms returned sat
[2022-05-17 10:11:48] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:11:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-17 10:11:48] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 107 ms returned sat
[2022-05-17 10:11:49] [INFO ] After 711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:11:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:11:49] [INFO ] After 40ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:11:49] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-17 10:11:49] [INFO ] After 1039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 319 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 319/319 places, 266/266 transitions.
Applied a total of 0 rules in 6 ms. Remains 319 /319 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 319/319 places, 266/266 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 319/319 places, 266/266 transitions.
Applied a total of 0 rules in 6 ms. Remains 319 /319 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 319 cols
[2022-05-17 10:11:49] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 10:11:49] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 266 rows 319 cols
[2022-05-17 10:11:49] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 10:11:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:11:50] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
[2022-05-17 10:11:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 266 rows 319 cols
[2022-05-17 10:11:50] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-17 10:11:51] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 319/319 places, 266/266 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 319 transition count 266
Applied a total of 1 rules in 12 ms. Remains 319 /319 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 266 rows 319 cols
[2022-05-17 10:11:51] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 10:11:51] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-17 10:11:51] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 24 ms returned sat
[2022-05-17 10:11:51] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 10:11:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-17 10:11:51] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 109 ms returned sat
[2022-05-17 10:11:52] [INFO ] After 636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 10:11:52] [INFO ] After 669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-17 10:11:52] [INFO ] After 911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 10:11:52] [INFO ] Flatten gal took : 14 ms
[2022-05-17 10:11:52] [INFO ] Flatten gal took : 13 ms
[2022-05-17 10:11:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1767071372435068867.gal : 3 ms
[2022-05-17 10:11:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality300866183244484829.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10457940703351886256;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1767071372435068867.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality300866183244484829.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality300866183244484829.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 54
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :54 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 1258
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1258 after 2042
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2042 after 42216
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :42216 after 299362
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :299362 after 535442
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :535442 after 3.01929e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.76169e+09 after 4.14261e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.3264e+09 after 4.33742e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.93453e+10 after 4.16284e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.24794e+11 after 1.63846e+11
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :4.2055e+11 after 4.21508e+11
Detected timeout of ITS tools.
[2022-05-17 10:12:07] [INFO ] Flatten gal took : 13 ms
[2022-05-17 10:12:07] [INFO ] Applying decomposition
[2022-05-17 10:12:07] [INFO ] Flatten gal took : 13 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/graph1748461317455764078.txt' '-o' '/tmp/graph1748461317455764078.bin' '-w' '/tmp/graph1748461317455764078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1748461317455764078.bin' '-l' '-1' '-v' '-w' '/tmp/graph1748461317455764078.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:12:07] [INFO ] Decomposing Gal with order
[2022-05-17 10:12:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:12:07] [INFO ] Removed a total of 76 redundant transitions.
[2022-05-17 10:12:07] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:12:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 2 ms.
[2022-05-17 10:12:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18322924670355048993.gal : 3 ms
[2022-05-17 10:12:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1793521269427893244.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10457940703351886256;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18322924670355048993.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1793521269427893244.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality1793521269427893244.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 259
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :259 after 2931
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2931 after 8646
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :75178 after 370018
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :370018 after 5.27733e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.27733e+09 after 9.06839e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9.06839e+09 after 1.42811e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7.15507e+12 after 7.15833e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6.86883e+13 after 7.12523e+13
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5965320763209366811
[2022-05-17 10:12:22] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5965320763209366811
Running compilation step : cd /tmp/ltsmin5965320763209366811;'/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 716 ms.
Running link step : cd /tmp/ltsmin5965320763209366811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5965320763209366811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 211 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 5719 reset in 275 ms.
Product exploration explored 100000 steps with 5708 reset in 311 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 268/268 transitions.
Applied a total of 0 rules in 10 ms. Remains 320 /320 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2022-05-17 10:12:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 268 rows 320 cols
[2022-05-17 10:12:39] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:12:39] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 320/320 places, 268/268 transitions.
Product exploration explored 100000 steps with 5742 reset in 487 ms.
Product exploration explored 100000 steps with 5733 reset in 531 ms.
Built C files in :
/tmp/ltsmin11409695818153275106
[2022-05-17 10:12:40] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11409695818153275106
Running compilation step : cd /tmp/ltsmin11409695818153275106;'/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 710 ms.
Running link step : cd /tmp/ltsmin11409695818153275106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11409695818153275106;'/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/stateBased13597508750908673225.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 268/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 320 /320 variables (removed 0) and now considering 268/268 (removed 0) transitions.
// Phase 1: matrix 268 rows 320 cols
[2022-05-17 10:12:55] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:12:55] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 268 rows 320 cols
[2022-05-17 10:12:55] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:12:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 10:12:56] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
// Phase 1: matrix 268 rows 320 cols
[2022-05-17 10:12:56] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 10:12:56] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 320/320 places, 268/268 transitions.
Built C files in :
/tmp/ltsmin14103576742714795499
[2022-05-17 10:12:56] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14103576742714795499
Running compilation step : cd /tmp/ltsmin14103576742714795499;'/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 727 ms.
Running link step : cd /tmp/ltsmin14103576742714795499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14103576742714795499;'/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/stateBased10628155448969217196.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 10:13:11] [INFO ] Flatten gal took : 20 ms
[2022-05-17 10:13:12] [INFO ] Flatten gal took : 15 ms
[2022-05-17 10:13:12] [INFO ] Time to serialize gal into /tmp/LTL9594659588017434627.gal : 2 ms
[2022-05-17 10:13:12] [INFO ] Time to serialize properties into /tmp/LTL16000585298584515050.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/LTL9594659588017434627.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16000585298584515050.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/LTL9594659...267
Read 1 LTL properties
Checking formula 0 : !(((X(X(G(!((X("((p173==1)&&(p229==1))"))U("((p173==1)&&(p229==1))"))))))||(F("(p444==1)"))))
Formula 0 simplified : !(XXG!(X"((p173==1)&&(p229==1))" U "((p173==1)&&(p229==1))") | F"(p444==1)")
Detected timeout of ITS tools.
[2022-05-17 10:13:27] [INFO ] Flatten gal took : 13 ms
[2022-05-17 10:13:27] [INFO ] Applying decomposition
[2022-05-17 10:13:27] [INFO ] Flatten gal took : 14 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/graph1879011688421671774.txt' '-o' '/tmp/graph1879011688421671774.bin' '-w' '/tmp/graph1879011688421671774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1879011688421671774.bin' '-l' '-1' '-v' '-w' '/tmp/graph1879011688421671774.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:13:27] [INFO ] Decomposing Gal with order
[2022-05-17 10:13:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:13:27] [INFO ] Removed a total of 83 redundant transitions.
[2022-05-17 10:13:27] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:13:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 4 ms.
[2022-05-17 10:13:27] [INFO ] Time to serialize gal into /tmp/LTL1667128237272741815.gal : 3 ms
[2022-05-17 10:13:27] [INFO ] Time to serialize properties into /tmp/LTL7506074081862138678.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/LTL1667128237272741815.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7506074081862138678.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/LTL1667128...245
Read 1 LTL properties
Checking formula 0 : !(((X(X(G(!((X("((u2.p173==1)&&(u2.p229==1))"))U("((u2.p173==1)&&(u2.p229==1))"))))))||(F("(i12.i0.u41.p444==1)"))))
Formula 0 simplified : !(XXG!(X"((u2.p173==1)&&(u2.p229==1))" U "((u2.p173==1)&&(u2.p229==1))") | F"(i12.i0.u41.p444==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6343060798724229581
[2022-05-17 10:13:42] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6343060798724229581
Running compilation step : cd /tmp/ltsmin6343060798724229581;'/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 729 ms.
Running link step : cd /tmp/ltsmin6343060798724229581;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6343060798724229581;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X([](!(X((LTLAPp0==true)) U (LTLAPp0==true)))))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50b-LTLFireability-06 finished in 173621 ms.
[2022-05-17 10:13:57] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4278399010399920534
[2022-05-17 10:13:57] [INFO ] Computing symmetric may disable matrix : 394 transitions.
[2022-05-17 10:13:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:13:57] [INFO ] Computing symmetric may enable matrix : 394 transitions.
[2022-05-17 10:13:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:13:57] [INFO ] Applying decomposition
[2022-05-17 10:13:57] [INFO ] Flatten gal took : 14 ms
[2022-05-17 10:13:57] [INFO ] Computing Do-Not-Accords matrix : 394 transitions.
[2022-05-17 10:13:57] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:13:57] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4278399010399920534
Running compilation step : cd /tmp/ltsmin4278399010399920534;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
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/graph13917660989169346671.txt' '-o' '/tmp/graph13917660989169346671.bin' '-w' '/tmp/graph13917660989169346671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13917660989169346671.bin' '-l' '-1' '-v' '-w' '/tmp/graph13917660989169346671.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:13:57] [INFO ] Decomposing Gal with order
[2022-05-17 10:13:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:13:57] [INFO ] Removed a total of 19 redundant transitions.
[2022-05-17 10:13:57] [INFO ] Flatten gal took : 29 ms
[2022-05-17 10:13:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2022-05-17 10:13:57] [INFO ] Time to serialize gal into /tmp/LTLFireability6646499379992124791.gal : 4 ms
[2022-05-17 10:13:57] [INFO ] Time to serialize properties into /tmp/LTLFireability3816910969126523208.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/LTLFireability6646499379992124791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3816910969126523208.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 1 LTL properties
Checking formula 0 : !(((X(X(G(!((X("((i2.u9.p173==1)&&(i2.u9.p229==1))"))U("((i2.u9.p173==1)&&(i2.u9.p229==1))"))))))||(F("(i7.u67.p444==1)"))))
Formula 0 simplified : !(XXG!(X"((i2.u9.p173==1)&&(i2.u9.p229==1))" U "((i2.u9.p173==1)&&(i2.u9.p229==1))") | F"(i7.u67.p444==1)")
Compilation finished in 1313 ms.
Running link step : cd /tmp/ltsmin4278399010399920534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4278399010399920534;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X([](!(X((LTLAPp0==true)) U (LTLAPp0==true)))))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t131, t291, t351, t352, t385, u32.t81, u34.t78, i1.u7.t137, i1.u7.t139, i1.u12.t124, i1.u...1414
Computing Next relation with stutter on 1.08303e+09 deadlock states
207 unique states visited
0 strongly connected components in search stack
207 transitions explored
207 items max in DFS search stack
51006 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,510.132,2711488,1,0,4.07707e+06,158420,4868,1.25517e+07,4425,1.38484e+06,6039305
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-50b-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1657564 ms.
BK_STOP 1652783622461
--------------------
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="DES-PT-50b"
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 DES-PT-50b, 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 r042-smll-165252095800524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b 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 ;