About the Execution of ITS-Tools for MedleyA-PT-21
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12477.464 | 3600000.00 | 3776629.00 | 12017.00 | T?FFT???TFFTF?F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920100162.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-21, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 70K Jun 2 16: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 MedleyA-PT-21-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717390586929
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-03 04:56:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-03 04:56:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 04:56:29] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-06-03 04:56:29] [INFO ] Transformed 306 places.
[2024-06-03 04:56:29] [INFO ] Transformed 298 transitions.
[2024-06-03 04:56:29] [INFO ] Found NUPN structural information;
[2024-06-03 04:56:29] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Support contains 143 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 298/298 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 292 transition count 284
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 292 transition count 284
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 287 transition count 279
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 287 transition count 279
Applied a total of 38 rules in 126 ms. Remains 287 /306 variables (removed 19) and now considering 279/298 (removed 19) transitions.
// Phase 1: matrix 279 rows 287 cols
[2024-06-03 04:56:30] [INFO ] Computed 20 invariants in 33 ms
[2024-06-03 04:56:30] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-06-03 04:56:30] [INFO ] Invariant cache hit.
[2024-06-03 04:56:31] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-06-03 04:56:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-03 04:56:36] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 18 ms to minimize.
[2024-06-03 04:56:36] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 3 ms to minimize.
[2024-06-03 04:56:36] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 3 ms to minimize.
[2024-06-03 04:56:36] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 4 ms to minimize.
[2024-06-03 04:56:36] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 6 ms to minimize.
[2024-06-03 04:56:37] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 3 ms to minimize.
[2024-06-03 04:56:37] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-06-03 04:56:37] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 4 ms to minimize.
[2024-06-03 04:56:37] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 4 ms to minimize.
[2024-06-03 04:56:37] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 3 ms to minimize.
[2024-06-03 04:56:38] [INFO ] Deduced a trap composed of 8 places in 325 ms of which 4 ms to minimize.
[2024-06-03 04:56:38] [INFO ] Deduced a trap composed of 9 places in 619 ms of which 4 ms to minimize.
[2024-06-03 04:56:38] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 3 ms to minimize.
[2024-06-03 04:56:39] [INFO ] Deduced a trap composed of 78 places in 191 ms of which 4 ms to minimize.
[2024-06-03 04:56:39] [INFO ] Deduced a trap composed of 84 places in 165 ms of which 5 ms to minimize.
[2024-06-03 04:56:39] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-06-03 04:56:39] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 2 ms to minimize.
[2024-06-03 04:56:39] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-03 04:56:39] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-03 04:56:39] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-03 04:56:40] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-06-03 04:56:40] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 4 ms to minimize.
[2024-06-03 04:56:40] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-03 04:56:41] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-06-03 04:56:41] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-03 04:56:41] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-06-03 04:56:41] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-06-03 04:56:41] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 3 ms to minimize.
[2024-06-03 04:56:41] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-06-03 04:56:42] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-06-03 04:56:42] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 3 ms to minimize.
[2024-06-03 04:56:42] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 2 ms to minimize.
[2024-06-03 04:56:42] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-03 04:56:42] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 3 ms to minimize.
[2024-06-03 04:56:42] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 3 ms to minimize.
[2024-06-03 04:56:42] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 6 ms to minimize.
[2024-06-03 04:56:42] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 3 ms to minimize.
[2024-06-03 04:56:43] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-06-03 04:56:43] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 2 ms to minimize.
[2024-06-03 04:56:43] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-03 04:56:45] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-06-03 04:56:45] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-03 04:56:46] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-06-03 04:56:46] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-06-03 04:56:46] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-03 04:56:46] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-03 04:56:46] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
[2024-06-03 04:56:47] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 4 ms to minimize.
[2024-06-03 04:56:47] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 2 ms to minimize.
[2024-06-03 04:56:47] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-03 04:56:47] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 2 ms to minimize.
[2024-06-03 04:56:47] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
[2024-06-03 04:56:48] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 2 ms to minimize.
[2024-06-03 04:56:48] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-03 04:56:48] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 2 ms to minimize.
[2024-06-03 04:56:48] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-03 04:56:49] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 5 ms to minimize.
[2024-06-03 04:56:49] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2024-06-03 04:56:49] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 2 ms to minimize.
[2024-06-03 04:56:50] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-03 04:56:50] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-03 04:56:51] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 2 ms to minimize.
[2024-06-03 04:56:51] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-03 04:56:52] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-03 04:56:53] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 2 ms to minimize.
[2024-06-03 04:56:53] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-06-03 04:56:53] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-03 04:56:57] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-03 04:57:00] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-06-03 04:57:01] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 287/566 variables, and 90 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/287 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 70/90 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-03 04:57:05] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 2 ms to minimize.
[2024-06-03 04:57:06] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-03 04:57:09] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-06-03 04:57:09] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-06-03 04:57:10] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-03 04:57:11] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-06-03 04:57:12] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-03 04:57:14] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-03 04:57:18] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (OVERLAPS) 279/566 variables, 287/386 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 278/664 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-03 04:57:25] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 5 ms to minimize.
[2024-06-03 04:57:25] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 5 ms to minimize.
[2024-06-03 04:57:26] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 4 ms to minimize.
[2024-06-03 04:57:27] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 4 ms to minimize.
[2024-06-03 04:57:28] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 3 ms to minimize.
[2024-06-03 04:57:28] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 4 ms to minimize.
[2024-06-03 04:57:29] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 4 ms to minimize.
[2024-06-03 04:57:29] [INFO ] Deduced a trap composed of 74 places in 162 ms of which 3 ms to minimize.
[2024-06-03 04:57:29] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 4 ms to minimize.
[2024-06-03 04:57:29] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 3 ms to minimize.
[2024-06-03 04:57:29] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 4 ms to minimize.
[2024-06-03 04:57:29] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 3 ms to minimize.
[2024-06-03 04:57:31] [INFO ] Deduced a trap composed of 104 places in 179 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 677 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 92/92 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 287/306 places, 279/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61394 ms. Remains : 287/306 places, 279/298 transitions.
Support contains 143 out of 287 places after structural reductions.
[2024-06-03 04:57:31] [INFO ] Flatten gal took : 106 ms
[2024-06-03 04:57:32] [INFO ] Flatten gal took : 42 ms
[2024-06-03 04:57:32] [INFO ] Input system was already deterministic with 279 transitions.
Support contains 141 out of 287 places (down from 143) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 5123 ms. (7 steps per ms) remains 23/121 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
[2024-06-03 04:57:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 224/263 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 24/287 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 279/566 variables, 287/307 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/566 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 307 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 224/263 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-03 04:57:35] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 3 ms to minimize.
[2024-06-03 04:57:35] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-06-03 04:57:36] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
[2024-06-03 04:57:36] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 2 ms to minimize.
[2024-06-03 04:57:36] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-06-03 04:57:36] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
Problem AtomicPropp76 is UNSAT
[2024-06-03 04:57:36] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-03 04:57:36] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-03 04:57:36] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-03 04:57:36] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 10/27 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-03 04:57:36] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-06-03 04:57:36] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 2 ms to minimize.
[2024-06-03 04:57:37] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-06-03 04:57:37] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 4/31 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 24/287 variables, 3/34 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-03 04:57:37] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 3 ms to minimize.
[2024-06-03 04:57:37] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 279/566 variables, 287/323 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 22/345 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-03 04:57:38] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-03 04:57:38] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-03 04:57:38] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 3/348 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-03 04:57:39] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-03 04:57:39] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 2/350 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-03 04:57:39] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 2 ms to minimize.
[2024-06-03 04:57:40] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-03 04:57:40] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 3/353 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-03 04:57:40] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
SMT process timed out in 6386ms, After SMT, problems are : Problem set: 1 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 279/279 transitions.
Graph (trivial) has 166 edges and 287 vertex of which 6 / 287 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 282 transition count 218
Reduce places removed 55 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 61 rules applied. Total rules applied 117 place count 227 transition count 212
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 123 place count 221 transition count 212
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 123 place count 221 transition count 184
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 179 place count 193 transition count 184
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 199 place count 173 transition count 164
Iterating global reduction 3 with 20 rules applied. Total rules applied 219 place count 173 transition count 164
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 219 place count 173 transition count 161
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 225 place count 170 transition count 161
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 299 place count 133 transition count 124
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 313 place count 126 transition count 165
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 323 place count 126 transition count 155
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 334 place count 116 transition count 154
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 335 place count 116 transition count 154
Applied a total of 335 rules in 97 ms. Remains 116 /287 variables (removed 171) and now considering 154/279 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 116/287 places, 154/279 transitions.
RANDOM walk for 40000 steps (864 resets) in 795 ms. (50 steps per ms) remains 3/22 properties
BEST_FIRST walk for 40004 steps (103 resets) in 147 ms. (270 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (89 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (102 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
// Phase 1: matrix 154 rows 116 cols
[2024-06-03 04:57:40] [INFO ] Computed 20 invariants in 3 ms
[2024-06-03 04:57:40] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 71/116 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 154/270 variables, 116/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 21/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 116/116 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 04:57:41] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 71/116 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 04:57:41] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-03 04:57:41] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 154/270 variables, 116/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 21/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 116/116 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 629ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 92 ms.
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 154/154 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 116 transition count 148
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 110 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 12 place count 110 transition count 133
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 42 place count 95 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 94 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 94 transition count 130
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
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 68 place count 82 transition count 118
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 82 transition count 117
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 80 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 85 place count 80 transition count 109
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 93 place count 80 transition count 101
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 101 place count 72 transition count 101
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 72 transition count 101
Applied a total of 103 rules in 60 ms. Remains 72 /116 variables (removed 44) and now considering 101/154 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 72/116 places, 101/154 transitions.
RANDOM walk for 39855 steps (1240 resets) in 171 ms. (231 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-06-03 04:57:41] [INFO ] Flatten gal took : 30 ms
[2024-06-03 04:57:41] [INFO ] Flatten gal took : 35 ms
[2024-06-03 04:57:41] [INFO ] Input system was already deterministic with 279 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Graph (trivial) has 214 edges and 287 vertex of which 6 / 287 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 281 transition count 195
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 203 transition count 195
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 157 place count 203 transition count 162
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 223 place count 170 transition count 162
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 256 place count 137 transition count 129
Iterating global reduction 2 with 33 rules applied. Total rules applied 289 place count 137 transition count 129
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 289 place count 137 transition count 118
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 311 place count 126 transition count 118
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 357 place count 103 transition count 95
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 358 place count 103 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 359 place count 102 transition count 94
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 48 edges and 101 vertex of which 5 / 101 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 361 place count 98 transition count 94
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 365 place count 97 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 371 place count 94 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 373 place count 94 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 373 place count 94 transition count 85
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 375 place count 93 transition count 85
Applied a total of 375 rules in 78 ms. Remains 93 /287 variables (removed 194) and now considering 85/279 (removed 194) transitions.
// Phase 1: matrix 85 rows 93 cols
[2024-06-03 04:57:42] [INFO ] Computed 18 invariants in 3 ms
[2024-06-03 04:57:42] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-03 04:57:42] [INFO ] Invariant cache hit.
[2024-06-03 04:57:42] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-03 04:57:42] [INFO ] Redundant transitions in 2 ms returned []
Running 56 sub problems to find dead transitions.
[2024-06-03 04:57:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 13/93 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-03 04:57:42] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-03 04:57:42] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-03 04:57:42] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 5 ms to minimize.
[2024-06-03 04:57:42] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 84/177 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/178 variables, and 115 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1898 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 13/93 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 84/177 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 56/171 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/178 variables, and 171 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1595 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 4/4 constraints]
After SMT, in 3511ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 3513ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/287 places, 85/279 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3906 ms. Remains : 93/287 places, 85/279 transitions.
[2024-06-03 04:57:45] [INFO ] Flatten gal took : 8 ms
[2024-06-03 04:57:45] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:57:45] [INFO ] Input system was already deterministic with 85 transitions.
RANDOM walk for 181 steps (3 resets) in 4 ms. (36 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-21-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-03 04:57:45] [INFO ] Flatten gal took : 9 ms
[2024-06-03 04:57:45] [INFO ] Flatten gal took : 8 ms
[2024-06-03 04:57:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15592344808427382762.gal : 4 ms
[2024-06-03 04:57:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5475266462124737654.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15592344808427382762.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5475266462124737654.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 253 transition count 245
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 253 transition count 245
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 94 place count 227 transition count 219
Iterating global reduction 0 with 26 rules applied. Total rules applied 120 place count 227 transition count 219
Applied a total of 120 rules in 16 ms. Remains 227 /287 variables (removed 60) and now considering 219/279 (removed 60) transitions.
// Phase 1: matrix 219 rows 227 cols
[2024-06-03 04:57:46] [INFO ] Computed 20 invariants in 3 ms
[2024-06-03 04:57:46] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-03 04:57:46] [INFO ] Invariant cache hit.
[2024-06-03 04:57:46] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-06-03 04:57:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-03 04:57:49] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-03 04:57:49] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-03 04:57:50] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-03 04:57:50] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 4 ms to minimize.
[2024-06-03 04:57:50] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 3 ms to minimize.
[2024-06-03 04:57:50] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 3 ms to minimize.
[2024-06-03 04:57:50] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-06-03 04:57:50] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-06-03 04:57:51] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
[2024-06-03 04:57:51] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-03 04:57:52] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-03 04:57:56] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 4 ms to minimize.
[2024-06-03 04:57:56] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-06-03 04:57:57] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-03 04:57:58] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 219/446 variables, 227/262 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/446 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 262 constraints, problems are : Problem set: 0 solved, 218 unsolved in 24327 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-03 04:58:13] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/446 variables, 227/263 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 218/481 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-03 04:58:18] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-06-03 04:58:18] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 4 ms to minimize.
[2024-06-03 04:58:19] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 6 ms to minimize.
[2024-06-03 04:58:19] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 2 ms to minimize.
[2024-06-03 04:58:19] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 3 ms to minimize.
[2024-06-03 04:58:19] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-03 04:58:20] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 7/488 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-03 04:58:24] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 3 ms to minimize.
[2024-06-03 04:58:24] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-06-03 04:58:24] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 3 ms to minimize.
[2024-06-03 04:58:24] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 3 ms to minimize.
[2024-06-03 04:58:25] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 5/493 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-03 04:58:27] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
[2024-06-03 04:58:28] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-03 04:58:33] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-06-03 04:58:34] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 497 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 32/32 constraints]
After SMT, in 54387ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 54392ms
Starting structural reductions in LTL mode, iteration 1 : 227/287 places, 219/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54799 ms. Remains : 227/287 places, 219/279 transitions.
[2024-06-03 04:58:40] [INFO ] Flatten gal took : 22 ms
[2024-06-03 04:58:40] [INFO ] Flatten gal took : 21 ms
[2024-06-03 04:58:40] [INFO ] Input system was already deterministic with 219 transitions.
[2024-06-03 04:58:40] [INFO ] Flatten gal took : 20 ms
[2024-06-03 04:58:40] [INFO ] Flatten gal took : 19 ms
[2024-06-03 04:58:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9386832092209028067.gal : 7 ms
[2024-06-03 04:58:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4223218187734880724.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9386832092209028067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4223218187734880724.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93285e+17,4.25755,101208,2,14270,5,396618,6,0,1129,591442,0
Converting to forward existential form...Done !
original formula: A(A(AX(((AF((p272==1)) + (p267==1)) + (p117==1))) U AG((!(E((p170==1) U (p174==1))) * (A((p26==1) U (p129==1)) + AX((p56==1)))))) U AF(((...212
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((p134==1) * E(EX((p48==1)) U E(TRUE U ((p65==1)&&(p300==1)))))))))))) * !(E(!(!(EG(!(((...835
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t71, t76, t83, t98, t108, t113, t119, t130...377
Detected timeout of ITS tools.
[2024-06-03 04:59:11] [INFO ] Flatten gal took : 22 ms
[2024-06-03 04:59:11] [INFO ] Applying decomposition
[2024-06-03 04:59:11] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1716945678735074416.txt' '-o' '/tmp/graph1716945678735074416.bin' '-w' '/tmp/graph1716945678735074416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1716945678735074416.bin' '-l' '-1' '-v' '-w' '/tmp/graph1716945678735074416.weights' '-q' '0' '-e' '0.001'
[2024-06-03 04:59:11] [INFO ] Decomposing Gal with order
[2024-06-03 04:59:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 04:59:11] [INFO ] Removed a total of 32 redundant transitions.
[2024-06-03 04:59:11] [INFO ] Flatten gal took : 140 ms
[2024-06-03 04:59:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-06-03 04:59:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14389261535232398308.gal : 22 ms
[2024-06-03 04:59:11] [INFO ] Time to serialize properties into /tmp/CTLFireability13160842819415235265.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14389261535232398308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13160842819415235265.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93285e+17,0.509878,16008,2006,26,27272,239,531,35674,46,545,0
Converting to forward existential form...Done !
original formula: A(A(AX(((AF((i14.u86.p272==1)) + (i14.u85.p267==1)) + (i7.u41.p117==1))) U AG((!(E((i9.i2.u58.p170==1) U (i10.u60.p174==1))) * (A((i2.u10...309
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((i6.i0.u46.p134==1) * E(EX((i3.u18.p48==1)) U E(TRUE U ((i2.u11.p65==1)&&(i15.u92.p300=...1140
Reverse transition relation is NOT exact ! Due to transitions t10, t28, t176, t177, t178, t180, t181, t182, t186, t187, t188, t198, t209, t214, t217, i0.u8...514
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 250 transition count 242
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 250 transition count 242
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 101 place count 223 transition count 215
Iterating global reduction 0 with 27 rules applied. Total rules applied 128 place count 223 transition count 215
Applied a total of 128 rules in 22 ms. Remains 223 /287 variables (removed 64) and now considering 215/279 (removed 64) transitions.
// Phase 1: matrix 215 rows 223 cols
[2024-06-03 04:59:41] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 04:59:41] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-03 04:59:41] [INFO ] Invariant cache hit.
[2024-06-03 04:59:42] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-03 04:59:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 04:59:44] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
[2024-06-03 04:59:44] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-03 04:59:44] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-03 04:59:44] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 4 ms to minimize.
[2024-06-03 04:59:45] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 3 ms to minimize.
[2024-06-03 04:59:45] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-06-03 04:59:45] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-06-03 04:59:45] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-06-03 04:59:45] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 2 ms to minimize.
[2024-06-03 04:59:45] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-03 04:59:46] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-03 04:59:46] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 2 ms to minimize.
[2024-06-03 04:59:46] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/438 variables, 223/256 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 256 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15545 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/438 variables, 223/256 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 214/470 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:00:02] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-03 05:00:02] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-06-03 05:00:03] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-06-03 05:00:03] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 3 ms to minimize.
[2024-06-03 05:00:03] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-06-03 05:00:04] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 6/476 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:00:08] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 4 ms to minimize.
[2024-06-03 05:00:08] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-06-03 05:00:08] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
[2024-06-03 05:00:08] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 2 ms to minimize.
[2024-06-03 05:00:09] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-06-03 05:00:09] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-06-03 05:00:09] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 3 ms to minimize.
[2024-06-03 05:00:10] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:00:13] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-06-03 05:00:14] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-03 05:00:14] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 3/487 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:00:17] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 488 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 31/31 constraints]
After SMT, in 45590ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 45594ms
Starting structural reductions in LTL mode, iteration 1 : 223/287 places, 215/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45998 ms. Remains : 223/287 places, 215/279 transitions.
[2024-06-03 05:00:27] [INFO ] Flatten gal took : 18 ms
[2024-06-03 05:00:27] [INFO ] Flatten gal took : 14 ms
[2024-06-03 05:00:27] [INFO ] Input system was already deterministic with 215 transitions.
[2024-06-03 05:00:27] [INFO ] Flatten gal took : 8 ms
[2024-06-03 05:00:27] [INFO ] Flatten gal took : 8 ms
[2024-06-03 05:00:27] [INFO ] Time to serialize gal into /tmp/CTLFireability15299889991448251087.gal : 3 ms
[2024-06-03 05:00:27] [INFO ] Time to serialize properties into /tmp/CTLFireability6521646219811692762.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15299889991448251087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6521646219811692762.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.51203e+17,2.30177,60424,2,10728,5,248025,6,0,1109,328598,0
Converting to forward existential form...Done !
original formula: A(E(EG(AG((p88==1))) U (p277==1)) U EF(AG(((p160==1) + (EX((p195==1)) * (p25!=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(E(TRUE U !(((p160==1) + (EX((p195==1)) * (p25!=1))))))))))) * !(E(!(E(TRUE U !(E(TRU...342
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t67, t70, t83, t88, t97, t100, t110, t130,...352
(forward)formula 0,0,19.1598,405116,1,0,410,2.09438e+06,463,209,6302,2.16742e+06,484
FORMULA MedleyA-PT-21-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 250 transition count 242
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 250 transition count 242
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 102 place count 222 transition count 214
Iterating global reduction 0 with 28 rules applied. Total rules applied 130 place count 222 transition count 214
Applied a total of 130 rules in 12 ms. Remains 222 /287 variables (removed 65) and now considering 214/279 (removed 65) transitions.
// Phase 1: matrix 214 rows 222 cols
[2024-06-03 05:00:47] [INFO ] Computed 20 invariants in 3 ms
[2024-06-03 05:00:47] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-03 05:00:47] [INFO ] Invariant cache hit.
[2024-06-03 05:00:47] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-06-03 05:00:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:00:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-03 05:00:51] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-03 05:00:51] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-03 05:00:51] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 4 ms to minimize.
[2024-06-03 05:00:51] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
[2024-06-03 05:00:51] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-06-03 05:00:51] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-06-03 05:00:52] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-03 05:00:52] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-03 05:00:52] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-06-03 05:00:52] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:00:54] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:00:57] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
[2024-06-03 05:00:57] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-03 05:00:58] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-06-03 05:00:58] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 214/436 variables, 222/258 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/436 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 258 constraints, problems are : Problem set: 0 solved, 213 unsolved in 20395 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:01:09] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-06-03 05:01:10] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/436 variables, 222/260 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 213/473 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:01:14] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 3 ms to minimize.
[2024-06-03 05:01:15] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 4 ms to minimize.
[2024-06-03 05:01:17] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:01:20] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 4 ms to minimize.
[2024-06-03 05:01:20] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:01:24] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 4 ms to minimize.
[2024-06-03 05:01:24] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 4 ms to minimize.
[2024-06-03 05:01:25] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 0/436 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 481 constraints, problems are : Problem set: 0 solved, 213 unsolved in 28628 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 26/26 constraints]
After SMT, in 49061ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 49067ms
Starting structural reductions in LTL mode, iteration 1 : 222/287 places, 214/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49599 ms. Remains : 222/287 places, 214/279 transitions.
[2024-06-03 05:01:36] [INFO ] Flatten gal took : 7 ms
[2024-06-03 05:01:36] [INFO ] Flatten gal took : 8 ms
[2024-06-03 05:01:36] [INFO ] Input system was already deterministic with 214 transitions.
[2024-06-03 05:01:36] [INFO ] Flatten gal took : 7 ms
[2024-06-03 05:01:36] [INFO ] Flatten gal took : 7 ms
[2024-06-03 05:01:36] [INFO ] Time to serialize gal into /tmp/CTLFireability1701787979451927360.gal : 2 ms
[2024-06-03 05:01:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13271847168160790049.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1701787979451927360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13271847168160790049.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.83662e+17,2.32851,55216,2,10326,5,227242,6,0,1104,296832,0
Converting to forward existential form...Done !
original formula: AG(A(E((EF((p303==1)) + (AX((p57==1)) * (p98!=1))) U (p253==1)) U (p246==1)))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!((p246==1))) * !((p246==1))) * !(E((E(TRUE U (p303==1)) + (!(EX(!((p57==1)))) * (p98!=...231
Hit Full ! (commute/partial/dont) 211/0/3
(forward)formula 0,0,20.7886,484920,1,0,21,2.3056e+06,20,1,5050,2.7072e+06,21
FORMULA MedleyA-PT-21-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 251 transition count 243
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 251 transition count 243
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 99 place count 224 transition count 216
Iterating global reduction 0 with 27 rules applied. Total rules applied 126 place count 224 transition count 216
Applied a total of 126 rules in 14 ms. Remains 224 /287 variables (removed 63) and now considering 216/279 (removed 63) transitions.
// Phase 1: matrix 216 rows 224 cols
[2024-06-03 05:01:57] [INFO ] Computed 20 invariants in 3 ms
[2024-06-03 05:01:57] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-03 05:01:57] [INFO ] Invariant cache hit.
[2024-06-03 05:01:58] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-03 05:01:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:02:01] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-06-03 05:02:01] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-03 05:02:01] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-03 05:02:02] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 4 ms to minimize.
[2024-06-03 05:02:02] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-06-03 05:02:02] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-06-03 05:02:02] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-03 05:02:02] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 4 ms to minimize.
[2024-06-03 05:02:02] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-06-03 05:02:03] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-06-03 05:02:03] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-03 05:02:03] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-03 05:02:03] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-03 05:02:03] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-06-03 05:02:03] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:02:04] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-03 05:02:04] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:02:08] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:02:10] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:02:11] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 216/440 variables, 224/264 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 0/440 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 264 constraints, problems are : Problem set: 0 solved, 215 unsolved in 25165 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/440 variables, 224/264 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 215/479 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:02:27] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-03 05:02:29] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 4 ms to minimize.
[2024-06-03 05:02:29] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
[2024-06-03 05:02:30] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-06-03 05:02:30] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 5/484 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:02:32] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:02:36] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:02:44] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/440 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 487 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 28/28 constraints]
After SMT, in 55244ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 55253ms
Starting structural reductions in LTL mode, iteration 1 : 224/287 places, 216/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55679 ms. Remains : 224/287 places, 216/279 transitions.
[2024-06-03 05:02:53] [INFO ] Flatten gal took : 13 ms
[2024-06-03 05:02:53] [INFO ] Flatten gal took : 11 ms
[2024-06-03 05:02:53] [INFO ] Input system was already deterministic with 216 transitions.
[2024-06-03 05:02:53] [INFO ] Flatten gal took : 11 ms
[2024-06-03 05:02:53] [INFO ] Flatten gal took : 11 ms
[2024-06-03 05:02:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1455156534730664674.gal : 3 ms
[2024-06-03 05:02:53] [INFO ] Time to serialize properties into /tmp/CTLFireability2859598947719721184.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1455156534730664674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2859598947719721184.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.73861e+17,4.17502,99448,2,17168,5,398989,6,0,1114,572493,0
Converting to forward existential form...Done !
original formula: (AX(EF((p286!=1))) * AG(EX(((p143==0)&&(p126==0)))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U (p286!=1))))] = FALSE * [(FwdU(Init,TRUE) * !(EX(((p143==0)&&(p126==0)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t15, t18, t21, t30, t31, t38, t53, t63, t84, t99, t106, t110, t111, t131...365
(forward)formula 0,1,28.5888,596332,1,0,386,3.11131e+06,454,198,6173,3.24626e+06,450
FORMULA MedleyA-PT-21-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 260 transition count 252
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 260 transition count 252
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 71 place count 243 transition count 235
Iterating global reduction 0 with 17 rules applied. Total rules applied 88 place count 243 transition count 235
Applied a total of 88 rules in 27 ms. Remains 243 /287 variables (removed 44) and now considering 235/279 (removed 44) transitions.
// Phase 1: matrix 235 rows 243 cols
[2024-06-03 05:03:22] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 05:03:22] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-03 05:03:22] [INFO ] Invariant cache hit.
[2024-06-03 05:03:22] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-06-03 05:03:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-03 05:03:26] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-03 05:03:26] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-03 05:03:26] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-03 05:03:27] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 4 ms to minimize.
[2024-06-03 05:03:27] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 4 ms to minimize.
[2024-06-03 05:03:27] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 4 ms to minimize.
[2024-06-03 05:03:27] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 4 ms to minimize.
[2024-06-03 05:03:27] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-06-03 05:03:28] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 4 ms to minimize.
[2024-06-03 05:03:28] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-06-03 05:03:28] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-06-03 05:03:28] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-06-03 05:03:28] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-03 05:03:29] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 4 ms to minimize.
[2024-06-03 05:03:29] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 10 ms to minimize.
[2024-06-03 05:03:29] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-06-03 05:03:29] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-06-03 05:03:30] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-03 05:03:31] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2024-06-03 05:03:31] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 4 ms to minimize.
[2024-06-03 05:03:32] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-06-03 05:03:32] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-03 05:03:36] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-06-03 05:03:36] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-06-03 05:03:37] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 235/478 variables, 243/288 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-03 05:03:44] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/478 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 289 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-03 05:03:56] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 235/478 variables, 243/290 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 234/524 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-03 05:04:00] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-06-03 05:04:00] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 2 ms to minimize.
[2024-06-03 05:04:01] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-06-03 05:04:02] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-06-03 05:04:03] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 4 ms to minimize.
[2024-06-03 05:04:03] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-06-03 05:04:03] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 3 ms to minimize.
[2024-06-03 05:04:04] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 8/532 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-03 05:04:09] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-06-03 05:04:10] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-03 05:04:18] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/478 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 535 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 38/38 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 243/287 places, 235/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60629 ms. Remains : 243/287 places, 235/279 transitions.
[2024-06-03 05:04:22] [INFO ] Flatten gal took : 10 ms
[2024-06-03 05:04:22] [INFO ] Flatten gal took : 12 ms
[2024-06-03 05:04:22] [INFO ] Input system was already deterministic with 235 transitions.
[2024-06-03 05:04:23] [INFO ] Flatten gal took : 12 ms
[2024-06-03 05:04:23] [INFO ] Flatten gal took : 12 ms
[2024-06-03 05:04:23] [INFO ] Time to serialize gal into /tmp/CTLFireability8872996739410082624.gal : 3 ms
[2024-06-03 05:04:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5304600745862956800.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8872996739410082624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5304600745862956800.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.08968e+17,26.687,556280,2,58547,5,1.87289e+06,6,0,1209,3.6609e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 05:04:53] [INFO ] Flatten gal took : 8 ms
[2024-06-03 05:04:53] [INFO ] Applying decomposition
[2024-06-03 05:04:53] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13250866590744243430.txt' '-o' '/tmp/graph13250866590744243430.bin' '-w' '/tmp/graph13250866590744243430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13250866590744243430.bin' '-l' '-1' '-v' '-w' '/tmp/graph13250866590744243430.weights' '-q' '0' '-e' '0.001'
[2024-06-03 05:04:53] [INFO ] Decomposing Gal with order
[2024-06-03 05:04:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:04:53] [INFO ] Removed a total of 33 redundant transitions.
[2024-06-03 05:04:53] [INFO ] Flatten gal took : 20 ms
[2024-06-03 05:04:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-03 05:04:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13549832903632459462.gal : 8 ms
[2024-06-03 05:04:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17429247052820776034.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13549832903632459462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17429247052820776034.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.08968e+17,3.66449,86396,4390,31,172498,275,567,249284,55,721,0
Converting to forward existential form...Done !
original formula: A((((!((AX(((i6.i0.u47.p125==1)&&(i4.u41.p123==1))) + A(((i2.u15.p44==1)||(i1.u10.p40==1)) U ((i15.u92.p279==1)||(i3.i0.u27.p78==1))))) *...805
=> equivalent forward existential formula: [((Init * !(EG(!(E(!(((!(((i13.i1.u75.p251==1)||(i4.u41.p107==1))&&((i14.u87.p265==1)||(i12.u72.p216==1))))&&(i5...1656
Reverse transition relation is NOT exact ! Due to transitions t10, t35, t193, t196, t197, t202, t203, t204, t217, t225, t231, t233, i0.t190, i0.t184, i0.u5...700
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 254 transition count 246
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 254 transition count 246
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 88 place count 232 transition count 224
Iterating global reduction 0 with 22 rules applied. Total rules applied 110 place count 232 transition count 224
Applied a total of 110 rules in 16 ms. Remains 232 /287 variables (removed 55) and now considering 224/279 (removed 55) transitions.
// Phase 1: matrix 224 rows 232 cols
[2024-06-03 05:05:23] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 05:05:23] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-03 05:05:23] [INFO ] Invariant cache hit.
[2024-06-03 05:05:23] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-06-03 05:05:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-03 05:05:27] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-03 05:05:27] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-03 05:05:27] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-03 05:05:28] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 4 ms to minimize.
[2024-06-03 05:05:28] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 2 ms to minimize.
[2024-06-03 05:05:28] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
[2024-06-03 05:05:28] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-06-03 05:05:28] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2024-06-03 05:05:28] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 4 ms to minimize.
[2024-06-03 05:05:29] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-06-03 05:05:29] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-06-03 05:05:29] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-06-03 05:05:29] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-06-03 05:05:30] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-06-03 05:05:30] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 2 ms to minimize.
[2024-06-03 05:05:30] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-03 05:05:30] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 2 ms to minimize.
[2024-06-03 05:05:31] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-03 05:05:35] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/456 variables, 232/271 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-03 05:05:39] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-03 05:05:43] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/456 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 273 constraints, problems are : Problem set: 0 solved, 223 unsolved in 27848 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-03 05:05:53] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-06-03 05:05:54] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-03 05:05:55] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-03 05:05:56] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-03 05:05:59] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 224/456 variables, 232/278 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 223/501 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-03 05:06:02] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-06-03 05:06:04] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-03 05:06:07] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 3 ms to minimize.
[2024-06-03 05:06:07] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 3 ms to minimize.
[2024-06-03 05:06:08] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 3 ms to minimize.
[2024-06-03 05:06:08] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-03 05:06:12] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-06-03 05:06:13] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-03 05:06:16] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 510 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 35/35 constraints]
After SMT, in 57894ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 57899ms
Starting structural reductions in LTL mode, iteration 1 : 232/287 places, 224/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58447 ms. Remains : 232/287 places, 224/279 transitions.
[2024-06-03 05:06:21] [INFO ] Flatten gal took : 8 ms
[2024-06-03 05:06:21] [INFO ] Flatten gal took : 6 ms
[2024-06-03 05:06:21] [INFO ] Input system was already deterministic with 224 transitions.
[2024-06-03 05:06:21] [INFO ] Flatten gal took : 6 ms
[2024-06-03 05:06:21] [INFO ] Flatten gal took : 7 ms
[2024-06-03 05:06:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17709985702711745715.gal : 2 ms
[2024-06-03 05:06:21] [INFO ] Time to serialize properties into /tmp/CTLFireability3170359846666283391.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17709985702711745715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3170359846666283391.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.19465e+17,7.29977,167764,2,20180,5,627291,6,0,1154,1.03135e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 05:06:51] [INFO ] Flatten gal took : 10 ms
[2024-06-03 05:06:51] [INFO ] Applying decomposition
[2024-06-03 05:06:51] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4589807131434720918.txt' '-o' '/tmp/graph4589807131434720918.bin' '-w' '/tmp/graph4589807131434720918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4589807131434720918.bin' '-l' '-1' '-v' '-w' '/tmp/graph4589807131434720918.weights' '-q' '0' '-e' '0.001'
[2024-06-03 05:06:51] [INFO ] Decomposing Gal with order
[2024-06-03 05:06:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:06:51] [INFO ] Removed a total of 29 redundant transitions.
[2024-06-03 05:06:52] [INFO ] Flatten gal took : 41 ms
[2024-06-03 05:06:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2024-06-03 05:06:52] [INFO ] Time to serialize gal into /tmp/CTLFireability13738175537266637207.gal : 15 ms
[2024-06-03 05:06:52] [INFO ] Time to serialize properties into /tmp/CTLFireability284430381758318980.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13738175537266637207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability284430381758318980.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.19465e+17,0.864162,23000,2539,27,43502,282,560,56270,46,807,0
Converting to forward existential form...Done !
original formula: (EG(((EG(EX(EX((i4.i1.u26.p78==1)))) + E(((AG((i7.u44.p138==1)) * (i7.u43.p134==1)) * (i9.u57.p176==1)) U !(((i6.u34.p104==1)&&(i6.u50.p1...514
=> equivalent forward existential formula: (([(((Init * !(EG(((EG(EX(EX((i4.i1.u26.p78==1)))) + E(((!(E(TRUE U !((i7.u44.p138==1)))) * (i7.u43.p134==1)) * ...1355
Reverse transition relation is NOT exact ! Due to transitions t10, t181, t182, t183, t185, t186, t191, t192, t193, t203, t206, t211, t222, i1.u4.t0, i2.i0....605
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 253 transition count 245
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 253 transition count 245
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 92 place count 229 transition count 221
Iterating global reduction 0 with 24 rules applied. Total rules applied 116 place count 229 transition count 221
Applied a total of 116 rules in 18 ms. Remains 229 /287 variables (removed 58) and now considering 221/279 (removed 58) transitions.
// Phase 1: matrix 221 rows 229 cols
[2024-06-03 05:07:22] [INFO ] Computed 20 invariants in 1 ms
[2024-06-03 05:07:22] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-03 05:07:22] [INFO ] Invariant cache hit.
[2024-06-03 05:07:22] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-03 05:07:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-03 05:07:25] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-03 05:07:25] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-03 05:07:25] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-03 05:07:26] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 2 ms to minimize.
[2024-06-03 05:07:26] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 3 ms to minimize.
[2024-06-03 05:07:26] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-06-03 05:07:26] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-06-03 05:07:26] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 3 ms to minimize.
[2024-06-03 05:07:26] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-03 05:07:26] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
[2024-06-03 05:07:26] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-03 05:07:26] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-03 05:07:27] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-03 05:07:27] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-06-03 05:07:27] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 2 ms to minimize.
[2024-06-03 05:07:27] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
[2024-06-03 05:07:27] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/450 variables, 229/266 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-03 05:07:32] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
[2024-06-03 05:07:32] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 2 ms to minimize.
[2024-06-03 05:07:32] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/450 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 269 constraints, problems are : Problem set: 0 solved, 220 unsolved in 17827 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/450 variables, 229/269 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 220/489 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-03 05:07:44] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
[2024-06-03 05:07:44] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-06-03 05:07:44] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-06-03 05:07:45] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 3 ms to minimize.
[2024-06-03 05:07:45] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-03 05:07:46] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 3 ms to minimize.
[2024-06-03 05:07:46] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 3 ms to minimize.
[2024-06-03 05:07:47] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 4 ms to minimize.
[2024-06-03 05:07:47] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 4 ms to minimize.
[2024-06-03 05:07:48] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 10/499 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-03 05:07:50] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 3 ms to minimize.
[2024-06-03 05:07:52] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 2/501 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-03 05:07:57] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 3 ms to minimize.
[2024-06-03 05:07:57] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (OVERLAPS) 0/450 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 503 constraints, problems are : Problem set: 0 solved, 220 unsolved in 28607 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 34/34 constraints]
After SMT, in 46469ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 46474ms
Starting structural reductions in LTL mode, iteration 1 : 229/287 places, 221/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46851 ms. Remains : 229/287 places, 221/279 transitions.
[2024-06-03 05:08:08] [INFO ] Flatten gal took : 6 ms
[2024-06-03 05:08:08] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:08:09] [INFO ] Input system was already deterministic with 221 transitions.
[2024-06-03 05:08:09] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:08:09] [INFO ] Flatten gal took : 4 ms
[2024-06-03 05:08:09] [INFO ] Time to serialize gal into /tmp/CTLFireability4555188946884362944.gal : 2 ms
[2024-06-03 05:08:09] [INFO ] Time to serialize properties into /tmp/CTLFireability5634523000629043923.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4555188946884362944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5634523000629043923.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.77985e+17,3.91287,88392,2,13965,5,360219,6,0,1139,502422,0
Converting to forward existential form...Done !
original formula: ((A((((p14==1) * !(AG((p293==1)))) + !(((p149==1) * EF((p34==1))))) U (p120==1)) + !(A(EF((E((p297==1) U (p218==1)) * EX((p90==1)))) U (p...398
=> equivalent forward existential formula: ([(EY(((Init * !((!((E(!((p120==1)) U (!((((p14==1) * !(!(E(TRUE U !((p293==1)))))) + !(((p149==1) * E(TRUE U (p...1217
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t6, t10, t19, t23, t29, t30, t37, t54, t58, t63, t64, t65, t87, t98, t102, t112, t122...389
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-06-03 05:08:39] [INFO ] Flatten gal took : 6 ms
[2024-06-03 05:08:39] [INFO ] Applying decomposition
[2024-06-03 05:08:39] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13515883351981182218.txt' '-o' '/tmp/graph13515883351981182218.bin' '-w' '/tmp/graph13515883351981182218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13515883351981182218.bin' '-l' '-1' '-v' '-w' '/tmp/graph13515883351981182218.weights' '-q' '0' '-e' '0.001'
[2024-06-03 05:08:39] [INFO ] Decomposing Gal with order
[2024-06-03 05:08:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:08:39] [INFO ] Removed a total of 32 redundant transitions.
[2024-06-03 05:08:39] [INFO ] Flatten gal took : 21 ms
[2024-06-03 05:08:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-03 05:08:39] [INFO ] Time to serialize gal into /tmp/CTLFireability7002648200549615568.gal : 4 ms
[2024-06-03 05:08:39] [INFO ] Time to serialize properties into /tmp/CTLFireability17799787698610082072.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7002648200549615568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17799787698610082072.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.77985e+17,0.313596,12372,1498,51,18362,380,545,25216,63,882,0
Converting to forward existential form...Done !
original formula: ((A((((i1.u5.p14==1) * !(AG((i0.u88.p293==1)))) + !(((i8.i0.u46.p149==1) * EF((i2.u12.p34==1))))) U (i7.u39.p120==1)) + !(A(EF((E((i15.i0...601
=> equivalent forward existential formula: ([(EY(((Init * !((!((E(!((i7.u39.p120==1)) U (!((((i1.u5.p14==1) * !(!(E(TRUE U !((i0.u88.p293==1)))))) + !(((i8...1693
Reverse transition relation is NOT exact ! Due to transitions t29, t178, t179, t180, t182, t183, t184, t188, t189, t190, t200, t203, t208, t216, t219, i0.t...582
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Graph (trivial) has 212 edges and 287 vertex of which 6 / 287 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 281 transition count 195
Reduce places removed 78 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 203 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 202 transition count 194
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 159 place count 202 transition count 162
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 223 place count 170 transition count 162
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 256 place count 137 transition count 129
Iterating global reduction 3 with 33 rules applied. Total rules applied 289 place count 137 transition count 129
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 289 place count 137 transition count 118
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 311 place count 126 transition count 118
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 357 place count 103 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 358 place count 102 transition count 94
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 46 edges and 101 vertex of which 5 / 101 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 360 place count 98 transition count 94
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 364 place count 97 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 370 place count 94 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 372 place count 94 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 372 place count 94 transition count 85
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 374 place count 93 transition count 85
Applied a total of 374 rules in 80 ms. Remains 93 /287 variables (removed 194) and now considering 85/279 (removed 194) transitions.
// Phase 1: matrix 85 rows 93 cols
[2024-06-03 05:09:09] [INFO ] Computed 18 invariants in 6 ms
[2024-06-03 05:09:09] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-03 05:09:09] [INFO ] Invariant cache hit.
[2024-06-03 05:09:09] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-06-03 05:09:09] [INFO ] Redundant transitions in 3 ms returned []
Running 57 sub problems to find dead transitions.
[2024-06-03 05:09:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 13/93 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-03 05:09:10] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-03 05:09:10] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-03 05:09:10] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-03 05:09:10] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 84/177 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/178 variables, and 115 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2350 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 13/93 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 84/177 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 57/172 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/178 variables, and 172 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1487 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints]
After SMT, in 3848ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3849ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/287 places, 85/279 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4252 ms. Remains : 93/287 places, 85/279 transitions.
[2024-06-03 05:09:13] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:09:13] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:09:13] [INFO ] Input system was already deterministic with 85 transitions.
[2024-06-03 05:09:13] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:09:13] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:09:13] [INFO ] Time to serialize gal into /tmp/CTLFireability1458413353112973309.gal : 2 ms
[2024-06-03 05:09:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6124100137902941824.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1458413353112973309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6124100137902941824.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.4886e+10,0.177708,7116,2,795,5,17152,5,0,458,19992,0
Converting to forward existential form...Done !
original formula: EF(AG((EF((p52==0)) + EG((p237==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U (p52==0)) + EG((p237==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t32, t36, t40, t45, t48, Intersection with reachable at each step enabled. (destroyed/re...188
(forward)formula 0,1,2.33651,61620,1,0,157,326050,195,69,2742,350074,187
FORMULA MedleyA-PT-21-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 250 transition count 242
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 250 transition count 242
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 100 place count 224 transition count 216
Iterating global reduction 0 with 26 rules applied. Total rules applied 126 place count 224 transition count 216
Applied a total of 126 rules in 9 ms. Remains 224 /287 variables (removed 63) and now considering 216/279 (removed 63) transitions.
// Phase 1: matrix 216 rows 224 cols
[2024-06-03 05:09:15] [INFO ] Computed 20 invariants in 1 ms
[2024-06-03 05:09:16] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-03 05:09:16] [INFO ] Invariant cache hit.
[2024-06-03 05:09:16] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-03 05:09:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:09:19] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-03 05:09:19] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-03 05:09:19] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-03 05:09:19] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 4 ms to minimize.
[2024-06-03 05:09:19] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-06-03 05:09:19] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-06-03 05:09:19] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-06-03 05:09:19] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-06-03 05:09:19] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 3 ms to minimize.
[2024-06-03 05:09:20] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
[2024-06-03 05:09:20] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-03 05:09:20] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-06-03 05:09:21] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-06-03 05:09:21] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-03 05:09:21] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/440 variables, 224/259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/440 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 259 constraints, problems are : Problem set: 0 solved, 215 unsolved in 15175 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/440 variables, 224/259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 215/474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:09:35] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-03 05:09:35] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 3 ms to minimize.
[2024-06-03 05:09:35] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 3 ms to minimize.
[2024-06-03 05:09:36] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-06-03 05:09:36] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 4 ms to minimize.
[2024-06-03 05:09:38] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 4 ms to minimize.
[2024-06-03 05:09:38] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 3 ms to minimize.
[2024-06-03 05:09:38] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 2 ms to minimize.
[2024-06-03 05:09:38] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 9/483 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:09:40] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-06-03 05:09:40] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-06-03 05:09:42] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
[2024-06-03 05:09:43] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 4 ms to minimize.
[2024-06-03 05:09:43] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 5/488 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:09:46] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 3 ms to minimize.
[2024-06-03 05:09:47] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 3 ms to minimize.
[2024-06-03 05:09:47] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:09:52] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:09:59] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 493 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 34/34 constraints]
After SMT, in 45210ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 45213ms
Starting structural reductions in LTL mode, iteration 1 : 224/287 places, 216/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45564 ms. Remains : 224/287 places, 216/279 transitions.
[2024-06-03 05:10:01] [INFO ] Flatten gal took : 7 ms
[2024-06-03 05:10:01] [INFO ] Flatten gal took : 7 ms
[2024-06-03 05:10:01] [INFO ] Input system was already deterministic with 216 transitions.
[2024-06-03 05:10:01] [INFO ] Flatten gal took : 10 ms
[2024-06-03 05:10:01] [INFO ] Flatten gal took : 13 ms
[2024-06-03 05:10:01] [INFO ] Time to serialize gal into /tmp/CTLFireability753950536376109891.gal : 3 ms
[2024-06-03 05:10:01] [INFO ] Time to serialize properties into /tmp/CTLFireability4764377635371259361.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability753950536376109891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4764377635371259361.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.74086e+17,3.10164,72008,2,12087,5,295064,6,0,1114,405018,0
Converting to forward existential form...Done !
original formula: AX((AX((A((p270==1) U (p261==1)) * EG(((p133==1)&&(p292==1))))) + (AG(A(((p144==1)||(p8==1)) U EF((p275==1)))) * E(AG(AF((p89==1))) U !(A...196
=> equivalent forward existential formula: (([((FwdU(FwdU((EY(Init) * !(!(EX(!((!((E(!((p261==1)) U (!((p270==1)) * !((p261==1)))) + EG(!((p261==1))))) * E...763
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t21, t25, t31, t32, t39, t54, t64, t85, t100, t110, t130, t145, t155, t1...355
(forward)formula 0,0,28.7603,589760,1,0,465,3.03313e+06,494,241,6660,3.55746e+06,589
FORMULA MedleyA-PT-21-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 251 transition count 243
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 251 transition count 243
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 97 place count 226 transition count 218
Iterating global reduction 0 with 25 rules applied. Total rules applied 122 place count 226 transition count 218
Applied a total of 122 rules in 10 ms. Remains 226 /287 variables (removed 61) and now considering 218/279 (removed 61) transitions.
// Phase 1: matrix 218 rows 226 cols
[2024-06-03 05:10:30] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 05:10:30] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-03 05:10:30] [INFO ] Invariant cache hit.
[2024-06-03 05:10:30] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-03 05:10:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 05:10:34] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-03 05:10:34] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-03 05:10:34] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-03 05:10:34] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 3 ms to minimize.
[2024-06-03 05:10:35] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 3 ms to minimize.
[2024-06-03 05:10:35] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-06-03 05:10:35] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-03 05:10:35] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
[2024-06-03 05:10:35] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-06-03 05:10:35] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-03 05:10:35] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
[2024-06-03 05:10:36] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 2 ms to minimize.
[2024-06-03 05:10:36] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/444 variables, 226/259 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/444 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 259 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15695 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/444 variables, 226/259 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 217/476 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 05:10:50] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-03 05:10:51] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 4 ms to minimize.
[2024-06-03 05:10:52] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-06-03 05:10:52] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-06-03 05:10:53] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-06-03 05:10:54] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 3 ms to minimize.
[2024-06-03 05:10:54] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 3 ms to minimize.
[2024-06-03 05:10:54] [INFO ] Deduced a trap composed of 75 places in 145 ms of which 4 ms to minimize.
[2024-06-03 05:10:54] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-06-03 05:10:54] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 4 ms to minimize.
[2024-06-03 05:10:54] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-06-03 05:10:54] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 12/488 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 05:10:59] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-06-03 05:10:59] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-06-03 05:10:59] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 05:11:01] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
[2024-06-03 05:11:03] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/444 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 493 constraints, problems are : Problem set: 0 solved, 217 unsolved in 27935 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 30/30 constraints]
After SMT, in 43669ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 43674ms
Starting structural reductions in LTL mode, iteration 1 : 226/287 places, 218/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44046 ms. Remains : 226/287 places, 218/279 transitions.
[2024-06-03 05:11:14] [INFO ] Flatten gal took : 10 ms
[2024-06-03 05:11:14] [INFO ] Flatten gal took : 9 ms
[2024-06-03 05:11:14] [INFO ] Input system was already deterministic with 218 transitions.
[2024-06-03 05:11:14] [INFO ] Flatten gal took : 8 ms
[2024-06-03 05:11:14] [INFO ] Flatten gal took : 8 ms
[2024-06-03 05:11:14] [INFO ] Time to serialize gal into /tmp/CTLFireability12856000771252145924.gal : 2 ms
[2024-06-03 05:11:14] [INFO ] Time to serialize properties into /tmp/CTLFireability9673941111489837831.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12856000771252145924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9673941111489837831.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86474e+17,4.52785,97692,2,17588,5,393802,6,0,1124,550516,0
Converting to forward existential form...Done !
original formula: E(EF((AX((p279==1)) + !(((AG((p169==1)) + (p105!=1)) + ((p153==1)||(p136==1)))))) U AG(((p120==1) * (E(((p194==1)&&(p8==1)) U ((p138==1)&...203
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (!(EX(!((p279==1)))) + !(((!(E(TRUE U !((p169==1)))) + (p105!=1)) + ((p153==1)||(p136==1)))...291
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t7, t11, t15, t17, t21, t30, t31, t38, t53, t63, t70, t74, t86, t101, t105, t...380
Detected timeout of ITS tools.
[2024-06-03 05:11:44] [INFO ] Flatten gal took : 8 ms
[2024-06-03 05:11:44] [INFO ] Applying decomposition
[2024-06-03 05:11:44] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4599009720657200538.txt' '-o' '/tmp/graph4599009720657200538.bin' '-w' '/tmp/graph4599009720657200538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4599009720657200538.bin' '-l' '-1' '-v' '-w' '/tmp/graph4599009720657200538.weights' '-q' '0' '-e' '0.001'
[2024-06-03 05:11:44] [INFO ] Decomposing Gal with order
[2024-06-03 05:11:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:11:44] [INFO ] Removed a total of 28 redundant transitions.
[2024-06-03 05:11:44] [INFO ] Flatten gal took : 14 ms
[2024-06-03 05:11:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-03 05:11:44] [INFO ] Time to serialize gal into /tmp/CTLFireability3043979274402055638.gal : 3 ms
[2024-06-03 05:11:44] [INFO ] Time to serialize properties into /tmp/CTLFireability7255039500922377207.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3043979274402055638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7255039500922377207.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86474e+17,0.51285,14216,1544,36,23719,281,559,30132,55,754,0
Converting to forward existential form...Done !
original formula: E(EF((AX((i0.i0.u85.p279==1)) + !(((AG((i9.i1.u45.p169==1)) + (i2.i1.u33.p105!=1)) + ((i6.u48.p153==1)||(i8.u41.p136==1)))))) U AG(((i7.u...302
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (!(EX(!((i0.i0.u85.p279==1)))) + !(((!(E(TRUE U !((i9.i1.u45.p169==1)))) + (i2.i1.u33.p105!...390
Reverse transition relation is NOT exact ! Due to transitions t11, t30, t175, t176, t177, t179, t181, t185, t186, t197, t200, t205, t208, t213, i0.i0.u85.t...564
(forward)formula 0,0,20.2484,524000,1,0,948764,400,3076,1.5112e+06,247,1124,1253312
FORMULA MedleyA-PT-21-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 250 transition count 242
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 250 transition count 242
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 101 place count 223 transition count 215
Iterating global reduction 0 with 27 rules applied. Total rules applied 128 place count 223 transition count 215
Applied a total of 128 rules in 13 ms. Remains 223 /287 variables (removed 64) and now considering 215/279 (removed 64) transitions.
// Phase 1: matrix 215 rows 223 cols
[2024-06-03 05:12:05] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 05:12:05] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-03 05:12:05] [INFO ] Invariant cache hit.
[2024-06-03 05:12:05] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-03 05:12:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:12:08] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-03 05:12:08] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-03 05:12:08] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-03 05:12:08] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 4 ms to minimize.
[2024-06-03 05:12:08] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 4 ms to minimize.
[2024-06-03 05:12:09] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-06-03 05:12:09] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-06-03 05:12:09] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-03 05:12:09] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-03 05:12:09] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 2 ms to minimize.
[2024-06-03 05:12:09] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 2 ms to minimize.
[2024-06-03 05:12:10] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 2 ms to minimize.
[2024-06-03 05:12:10] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/438 variables, 223/256 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 256 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15549 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/438 variables, 223/256 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 214/470 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:12:25] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-03 05:12:26] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-06-03 05:12:27] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-06-03 05:12:28] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 3 ms to minimize.
[2024-06-03 05:12:28] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 5/475 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:12:33] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 3 ms to minimize.
[2024-06-03 05:12:34] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
[2024-06-03 05:12:34] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 3 ms to minimize.
[2024-06-03 05:12:34] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:12:43] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/438 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-03 05:12:47] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 481 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 24/24 constraints]
After SMT, in 45590ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 45593ms
Starting structural reductions in LTL mode, iteration 1 : 223/287 places, 215/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45951 ms. Remains : 223/287 places, 215/279 transitions.
[2024-06-03 05:12:51] [INFO ] Flatten gal took : 4 ms
[2024-06-03 05:12:51] [INFO ] Flatten gal took : 4 ms
[2024-06-03 05:12:51] [INFO ] Input system was already deterministic with 215 transitions.
[2024-06-03 05:12:51] [INFO ] Flatten gal took : 4 ms
[2024-06-03 05:12:51] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:12:51] [INFO ] Time to serialize gal into /tmp/CTLFireability17967675793891917178.gal : 1 ms
[2024-06-03 05:12:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7638520514515553325.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17967675793891917178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7638520514515553325.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.49985e+17,2.47542,68988,2,11628,5,267759,6,0,1109,374336,0
Converting to forward existential form...Done !
original formula: (E((p85==1) U EX(AX(EF((p127==1))))) + AF(AG((p207==1))))
=> equivalent forward existential formula: [FwdG((Init * !(E((p85==1) U EX(!(EX(!(E(TRUE U (p127==1))))))))),!(!(E(TRUE U !((p207==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t103, t106, t108, t130, t142, t1...361
Detected timeout of ITS tools.
[2024-06-03 05:13:21] [INFO ] Flatten gal took : 6 ms
[2024-06-03 05:13:21] [INFO ] Applying decomposition
[2024-06-03 05:13:21] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph818857046677366034.txt' '-o' '/tmp/graph818857046677366034.bin' '-w' '/tmp/graph818857046677366034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph818857046677366034.bin' '-l' '-1' '-v' '-w' '/tmp/graph818857046677366034.weights' '-q' '0' '-e' '0.001'
[2024-06-03 05:13:21] [INFO ] Decomposing Gal with order
[2024-06-03 05:13:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:13:21] [INFO ] Removed a total of 29 redundant transitions.
[2024-06-03 05:13:21] [INFO ] Flatten gal took : 27 ms
[2024-06-03 05:13:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-03 05:13:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11330921302086158721.gal : 3 ms
[2024-06-03 05:13:21] [INFO ] Time to serialize properties into /tmp/CTLFireability2102529031621517864.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11330921302086158721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2102529031621517864.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.49985e+17,0.253935,11492,1306,25,17214,320,479,21132,43,861,0
Converting to forward existential form...Done !
original formula: (E((i5.i0.u27.p85==1) U EX(AX(EF((i8.u40.p127==1))))) + AF(AG((i12.u64.p207==1))))
=> equivalent forward existential formula: [FwdG((Init * !(E((i5.i0.u27.p85==1) U EX(!(EX(!(E(TRUE U (i8.u40.p127==1))))))))),!(!(E(TRUE U !((i12.u64.p207=...172
Reverse transition relation is NOT exact ! Due to transitions t10, t172, t173, t174, t176, t177, t178, t182, t183, t184, t194, t197, t202, t205, t210, t213...499
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,25.1014,737436,1,0,1.44082e+06,320,2973,2.38699e+06,216,861,1924171
FORMULA MedleyA-PT-21-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 286 transition count 205
Reduce places removed 73 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 77 rules applied. Total rules applied 150 place count 213 transition count 201
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 154 place count 209 transition count 201
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 154 place count 209 transition count 168
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 220 place count 176 transition count 168
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 249 place count 147 transition count 139
Iterating global reduction 3 with 29 rules applied. Total rules applied 278 place count 147 transition count 139
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 278 place count 147 transition count 131
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 294 place count 139 transition count 131
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 344 place count 114 transition count 106
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 345 place count 114 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 346 place count 113 transition count 105
Applied a total of 346 rules in 32 ms. Remains 113 /287 variables (removed 174) and now considering 105/279 (removed 174) transitions.
// Phase 1: matrix 105 rows 113 cols
[2024-06-03 05:13:46] [INFO ] Computed 20 invariants in 1 ms
[2024-06-03 05:13:46] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-03 05:13:46] [INFO ] Invariant cache hit.
[2024-06-03 05:13:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-03 05:13:46] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-06-03 05:13:46] [INFO ] Redundant transitions in 2 ms returned []
Running 83 sub problems to find dead transitions.
[2024-06-03 05:13:46] [INFO ] Invariant cache hit.
[2024-06-03 05:13:46] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 11/113 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-03 05:13:47] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-06-03 05:13:47] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-03 05:13:47] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-03 05:13:47] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 105/218 variables, 113/137 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 140 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3346 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 113/113 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 11/113 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 105/218 variables, 113/137 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 83/223 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-03 05:13:51] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/218 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 224 constraints, problems are : Problem set: 0 solved, 83 unsolved in 4113 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 113/113 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 5/5 constraints]
After SMT, in 7471ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 7473ms
Starting structural reductions in SI_CTL mode, iteration 1 : 113/287 places, 105/279 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7766 ms. Remains : 113/287 places, 105/279 transitions.
[2024-06-03 05:13:54] [INFO ] Flatten gal took : 3 ms
[2024-06-03 05:13:54] [INFO ] Flatten gal took : 3 ms
[2024-06-03 05:13:54] [INFO ] Input system was already deterministic with 105 transitions.
[2024-06-03 05:13:54] [INFO ] Flatten gal took : 3 ms
[2024-06-03 05:13:54] [INFO ] Flatten gal took : 2 ms
[2024-06-03 05:13:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8932473874020755404.gal : 1 ms
[2024-06-03 05:13:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16093383016709769791.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8932473874020755404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16093383016709769791.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75011e+12,0.763346,21740,2,1647,5,92940,6,0,556,103457,0
Converting to forward existential form...Done !
original formula: AG((!(A(!((AF((p30==1)) * (p138==1))) U ((p19==1)&&(p21==1)))) * A((!(E(((p22==1)&&(p72==1)) U (p241==1))) + (p69==1)) U ((EF((p260==1)) ...229
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(((p19==1)&&(p21==1)))))) * !(E(!(((p19==1)&&(p21==1))) U (!(!((!(EG(!((p30==1)))) *...638
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t8, t27, t40, t45, t52, t59, t85, t88, t92, t95, t101, t102, t103, Intersection with...236
(forward)formula 0,0,28.795,807824,1,0,527,4.28792e+06,248,255,3365,6.48943e+06,562
FORMULA MedleyA-PT-21-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 252 transition count 244
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 252 transition count 244
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 96 place count 226 transition count 218
Iterating global reduction 0 with 26 rules applied. Total rules applied 122 place count 226 transition count 218
Applied a total of 122 rules in 9 ms. Remains 226 /287 variables (removed 61) and now considering 218/279 (removed 61) transitions.
// Phase 1: matrix 218 rows 226 cols
[2024-06-03 05:14:23] [INFO ] Computed 20 invariants in 1 ms
[2024-06-03 05:14:23] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-03 05:14:23] [INFO ] Invariant cache hit.
[2024-06-03 05:14:23] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-03 05:14:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 05:14:27] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-03 05:14:27] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-03 05:14:27] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-03 05:14:27] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 4 ms to minimize.
[2024-06-03 05:14:27] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 3 ms to minimize.
[2024-06-03 05:14:27] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-06-03 05:14:27] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-06-03 05:14:27] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-03 05:14:27] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 2 ms to minimize.
[2024-06-03 05:14:28] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-03 05:14:28] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 05:14:29] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 05:14:32] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/444 variables, 226/259 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/444 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 259 constraints, problems are : Problem set: 0 solved, 217 unsolved in 19445 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 05:14:45] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/444 variables, 226/260 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 217/477 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 05:14:49] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-06-03 05:14:52] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 4 ms to minimize.
[2024-06-03 05:14:52] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 05:14:55] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 4 ms to minimize.
[2024-06-03 05:14:57] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
[2024-06-03 05:14:57] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 05:15:02] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 484 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 21/21 constraints]
After SMT, in 49497ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 49501ms
Starting structural reductions in LTL mode, iteration 1 : 226/287 places, 218/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49871 ms. Remains : 226/287 places, 218/279 transitions.
[2024-06-03 05:15:13] [INFO ] Flatten gal took : 7 ms
[2024-06-03 05:15:13] [INFO ] Flatten gal took : 7 ms
[2024-06-03 05:15:13] [INFO ] Input system was already deterministic with 218 transitions.
[2024-06-03 05:15:13] [INFO ] Flatten gal took : 7 ms
[2024-06-03 05:15:13] [INFO ] Flatten gal took : 16 ms
[2024-06-03 05:15:13] [INFO ] Time to serialize gal into /tmp/CTLFireability3463912322798899868.gal : 2 ms
[2024-06-03 05:15:13] [INFO ] Time to serialize properties into /tmp/CTLFireability10455120093498655711.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3463912322798899868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10455120093498655711.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6414e+17,3.53569,80408,2,14304,5,302564,6,0,1124,448028,0
Converting to forward existential form...Done !
original formula: AF(((AX((((AF((p41==1)) * EX(((p183==0)||(p185==0)))) * ((p19==1)&&(p21==1))) * ((p135==1)&&(p123==1)))) + ((p18==1)&&(p50==1))) + (AF((p...176
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!((((!(EG(!((p41==1)))) * EX(((p183==0)||(p185==0)))) * ((p19==1)&&(p21==1))) * ((p135==1)&&...239
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t102, t108, t111, t120, t131, t1...367
Detected timeout of ITS tools.
[2024-06-03 05:15:43] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:15:43] [INFO ] Applying decomposition
[2024-06-03 05:15:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10218611679616723637.txt' '-o' '/tmp/graph10218611679616723637.bin' '-w' '/tmp/graph10218611679616723637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10218611679616723637.bin' '-l' '-1' '-v' '-w' '/tmp/graph10218611679616723637.weights' '-q' '0' '-e' '0.001'
[2024-06-03 05:15:43] [INFO ] Decomposing Gal with order
[2024-06-03 05:15:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:15:43] [INFO ] Removed a total of 32 redundant transitions.
[2024-06-03 05:15:43] [INFO ] Flatten gal took : 13 ms
[2024-06-03 05:15:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-03 05:15:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13440230776875436787.gal : 3 ms
[2024-06-03 05:15:43] [INFO ] Time to serialize properties into /tmp/CTLFireability18380083190950751216.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13440230776875436787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18380083190950751216.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6414e+17,0.446821,11828,1252,25,17795,280,539,25520,43,743,0
Converting to forward existential form...Done !
original formula: AF(((AX((((AF((i1.u13.p41==1)) * EX(((i9.i0.u55.p183==0)||(i9.i0.u55.p185==0)))) * ((i0.u3.p19==1)&&(i0.u3.p21==1))) * ((i7.i2.u43.p135==...267
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!((((!(EG(!((i1.u13.p41==1)))) * EX(((i9.i0.u55.p183==0)||(i9.i0.u55.p185==0)))) * ((i0.u3.p...330
Reverse transition relation is NOT exact ! Due to transitions t10, t175, t176, t177, t180, t181, t185, t186, t187, t197, t200, t205, t208, t213, t216, i0.u...505
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 250 transition count 242
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 250 transition count 242
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 100 place count 224 transition count 216
Iterating global reduction 0 with 26 rules applied. Total rules applied 126 place count 224 transition count 216
Applied a total of 126 rules in 9 ms. Remains 224 /287 variables (removed 63) and now considering 216/279 (removed 63) transitions.
// Phase 1: matrix 216 rows 224 cols
[2024-06-03 05:16:13] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 05:16:13] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-03 05:16:13] [INFO ] Invariant cache hit.
[2024-06-03 05:16:13] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-03 05:16:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:16:17] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
[2024-06-03 05:16:17] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-03 05:16:17] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-03 05:16:17] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-06-03 05:16:17] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-06-03 05:16:17] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-06-03 05:16:17] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2024-06-03 05:16:17] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
[2024-06-03 05:16:17] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-03 05:16:17] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-03 05:16:17] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-03 05:16:18] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-03 05:16:18] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-03 05:16:18] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-03 05:16:18] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:16:19] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:16:22] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/440 variables, 224/261 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:16:28] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 262 constraints, problems are : Problem set: 0 solved, 215 unsolved in 21212 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/440 variables, 224/262 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 215/477 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:16:39] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-03 05:16:40] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-06-03 05:16:40] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 3 ms to minimize.
[2024-06-03 05:16:41] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-06-03 05:16:41] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 3 ms to minimize.
[2024-06-03 05:16:43] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-06-03 05:16:43] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:16:47] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-06-03 05:16:48] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-06-03 05:16:48] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 3/487 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:16:51] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:16:55] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 05:16:59] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 490 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 31/31 constraints]
After SMT, in 51259ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 51263ms
Starting structural reductions in LTL mode, iteration 1 : 224/287 places, 216/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51618 ms. Remains : 224/287 places, 216/279 transitions.
[2024-06-03 05:17:05] [INFO ] Flatten gal took : 4 ms
[2024-06-03 05:17:05] [INFO ] Flatten gal took : 4 ms
[2024-06-03 05:17:05] [INFO ] Input system was already deterministic with 216 transitions.
[2024-06-03 05:17:05] [INFO ] Flatten gal took : 7 ms
[2024-06-03 05:17:05] [INFO ] Flatten gal took : 4 ms
[2024-06-03 05:17:05] [INFO ] Time to serialize gal into /tmp/CTLFireability7190700263864119492.gal : 2 ms
[2024-06-03 05:17:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16212409334923488406.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7190700263864119492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16212409334923488406.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.49558e+17,2.61738,67844,2,11417,5,277953,6,0,1114,364150,0
Converting to forward existential form...Done !
original formula: E(EG((p208==1)) U ((p161!=1) * AX((AF(((p147==1)&&(p300==1))) + AG(EF((p218==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,EG((p208==1))) * (p161!=1)) * !(EX(!((!(EG(!(((p147==1)&&(p300==1))))) + !(E(TRUE U !(E(TRUE U (p21...179
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t55, t58, t59, t63, t64, t85, t89, t97, t101, t...368
Detected timeout of ITS tools.
[2024-06-03 05:17:35] [INFO ] Flatten gal took : 4 ms
[2024-06-03 05:17:35] [INFO ] Applying decomposition
[2024-06-03 05:17:35] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5690351996787774994.txt' '-o' '/tmp/graph5690351996787774994.bin' '-w' '/tmp/graph5690351996787774994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5690351996787774994.bin' '-l' '-1' '-v' '-w' '/tmp/graph5690351996787774994.weights' '-q' '0' '-e' '0.001'
[2024-06-03 05:17:35] [INFO ] Decomposing Gal with order
[2024-06-03 05:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:17:35] [INFO ] Removed a total of 29 redundant transitions.
[2024-06-03 05:17:35] [INFO ] Flatten gal took : 28 ms
[2024-06-03 05:17:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-03 05:17:35] [INFO ] Time to serialize gal into /tmp/CTLFireability3403525813216453706.gal : 3 ms
[2024-06-03 05:17:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17994713813194178068.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3403525813216453706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17994713813194178068.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.49558e+17,0.459903,16932,1215,29,31597,266,556,36023,48,721,0
Converting to forward existential form...Done !
original formula: E(EG((i10.i1.u64.p208==1)) U ((i8.i1.u51.p161!=1) * AX((AF(((i8.i0.u45.p147==1)&&(i4.i2.u85.p300==1))) + AG(EF((i10.i1.u67.p218==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,EG((i10.i1.u64.p208==1))) * (i8.i1.u51.p161!=1)) * !(EX(!((!(EG(!(((i8.i0.u45.p147==1)&&(i4.i2.u85....231
Reverse transition relation is NOT exact ! Due to transitions t10, t28, t173, t174, t175, t177, t179, t183, t184, t185, t198, t206, t211, t214, i1.u4.t0, i...555
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,21.6994,546468,1,0,1.02748e+06,327,3283,1.97821e+06,228,866,1296283
FORMULA MedleyA-PT-21-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 255 transition count 247
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 255 transition count 247
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 88 place count 231 transition count 223
Iterating global reduction 0 with 24 rules applied. Total rules applied 112 place count 231 transition count 223
Applied a total of 112 rules in 9 ms. Remains 231 /287 variables (removed 56) and now considering 223/279 (removed 56) transitions.
// Phase 1: matrix 223 rows 231 cols
[2024-06-03 05:17:57] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 05:17:57] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-03 05:17:57] [INFO ] Invariant cache hit.
[2024-06-03 05:17:57] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-06-03 05:17:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-03 05:17:59] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-03 05:18:00] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-03 05:18:00] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-03 05:18:00] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2024-06-03 05:18:00] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
[2024-06-03 05:18:00] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-06-03 05:18:00] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-06-03 05:18:00] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-03 05:18:00] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-03 05:18:01] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 2 ms to minimize.
[2024-06-03 05:18:01] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-03 05:18:01] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-03 05:18:01] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 2 ms to minimize.
[2024-06-03 05:18:01] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-03 05:18:02] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-03 05:18:03] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-03 05:18:03] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-03 05:18:03] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/454 variables, 231/269 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/454 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 269 constraints, problems are : Problem set: 0 solved, 222 unsolved in 17403 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/454 variables, 231/269 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 222/491 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-03 05:18:19] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-03 05:18:20] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 6 ms to minimize.
[2024-06-03 05:18:20] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 3 ms to minimize.
[2024-06-03 05:18:20] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 4 ms to minimize.
[2024-06-03 05:18:21] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 3 ms to minimize.
[2024-06-03 05:18:21] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 4 ms to minimize.
[2024-06-03 05:18:21] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 3 ms to minimize.
[2024-06-03 05:18:22] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 4 ms to minimize.
[2024-06-03 05:18:22] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 9/500 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-03 05:18:27] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 4 ms to minimize.
[2024-06-03 05:18:28] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 3 ms to minimize.
[2024-06-03 05:18:29] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-06-03 05:18:29] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
[2024-06-03 05:18:30] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 5/505 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-03 05:18:40] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/454 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 506 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 33/33 constraints]
After SMT, in 47459ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 47463ms
Starting structural reductions in LTL mode, iteration 1 : 231/287 places, 223/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47814 ms. Remains : 231/287 places, 223/279 transitions.
[2024-06-03 05:18:44] [INFO ] Flatten gal took : 8 ms
[2024-06-03 05:18:44] [INFO ] Flatten gal took : 7 ms
[2024-06-03 05:18:44] [INFO ] Input system was already deterministic with 223 transitions.
[2024-06-03 05:18:45] [INFO ] Flatten gal took : 16 ms
[2024-06-03 05:18:45] [INFO ] Flatten gal took : 8 ms
[2024-06-03 05:18:45] [INFO ] Time to serialize gal into /tmp/CTLFireability1584464779683063698.gal : 8 ms
[2024-06-03 05:18:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1768830068275908714.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1584464779683063698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1768830068275908714.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.74566e+17,15.1892,314480,2,45777,5,1.05523e+06,6,0,1149,2.02051e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 05:19:15] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:19:15] [INFO ] Applying decomposition
[2024-06-03 05:19:15] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10325184306229319678.txt' '-o' '/tmp/graph10325184306229319678.bin' '-w' '/tmp/graph10325184306229319678.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10325184306229319678.bin' '-l' '-1' '-v' '-w' '/tmp/graph10325184306229319678.weights' '-q' '0' '-e' '0.001'
[2024-06-03 05:19:15] [INFO ] Decomposing Gal with order
[2024-06-03 05:19:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:19:15] [INFO ] Removed a total of 28 redundant transitions.
[2024-06-03 05:19:15] [INFO ] Flatten gal took : 20 ms
[2024-06-03 05:19:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-03 05:19:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9510776805557653340.gal : 4 ms
[2024-06-03 05:19:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17430651119902836514.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9510776805557653340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17430651119902836514.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.74566e+17,9.22779,224076,6754,37,476457,382,512,692771,60,951,0
Converting to forward existential form...Done !
original formula: EF((((AX(A(((i7.u36.p110==1)&&(i10.i0.u46.p148==1)) U ((i11.u58.p177==1)&&(i12.u63.p197==1)))) * A((i15.u85.p281==1) U (i13.u70.p221==1))...436
=> equivalent forward existential formula: ((([(FwdU(EY(((FwdU(Init,TRUE) * ((!(EX(!(!((E(!(((i11.u58.p177==1)&&(i12.u63.p197==1))) U (!(((i7.u36.p110==1)&...2288
Reverse transition relation is NOT exact ! Due to transitions t10, t31, t180, t181, t182, t184, t185, t186, t190, t191, t192, t202, t205, t210, t218, t221,...611
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
[2024-06-03 05:19:45] [INFO ] Flatten gal took : 7 ms
[2024-06-03 05:19:45] [INFO ] Flatten gal took : 6 ms
[2024-06-03 05:19:45] [INFO ] Applying decomposition
[2024-06-03 05:19:45] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6273479875192087262.txt' '-o' '/tmp/graph6273479875192087262.bin' '-w' '/tmp/graph6273479875192087262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6273479875192087262.bin' '-l' '-1' '-v' '-w' '/tmp/graph6273479875192087262.weights' '-q' '0' '-e' '0.001'
[2024-06-03 05:19:45] [INFO ] Decomposing Gal with order
[2024-06-03 05:19:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:19:45] [INFO ] Removed a total of 33 redundant transitions.
[2024-06-03 05:19:45] [INFO ] Flatten gal took : 17 ms
[2024-06-03 05:19:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-03 05:19:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17709688825623024329.gal : 14 ms
[2024-06-03 05:19:45] [INFO ] Time to serialize properties into /tmp/CTLFireability7423630414144654418.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17709688825623024329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7423630414144654418.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.33313e+18,13.5001,268668,13621,45,449254,375,647,1.00741e+06,58,943,0
Converting to forward existential form...Done !
original formula: A(A(AX(((AF((i12.i0.u104.p272==1)) + (i12.i0.u102.p267==1)) + (i4.u45.p117==1))) U AG((!(E((i11.i0.u66.p170==1) U (i8.u67.p174==1))) * (A...318
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((i5.i2.u51.p134==1) * E(EX((i2.u20.p48==1)) U E(TRUE U ((i1.u11.p65==1)&&(i15.u112.p300...1151
Reverse transition relation is NOT exact ! Due to transitions t236, t237, t238, t240, t241, t242, t246, t261, i0.t234, i0.t230, i0.t226, i1.t220, i1.t216, ...974
Detected timeout of ITS tools.
[2024-06-03 05:47:31] [INFO ] Applying decomposition
[2024-06-03 05:47:31] [INFO ] Flatten gal took : 10 ms
[2024-06-03 05:47:31] [INFO ] Decomposing Gal with order
[2024-06-03 05:47:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:47:31] [INFO ] Removed a total of 8 redundant transitions.
[2024-06-03 05:47:31] [INFO ] Flatten gal took : 15 ms
[2024-06-03 05:47:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 7 ms.
[2024-06-03 05:47:31] [INFO ] Time to serialize gal into /tmp/CTLFireability5852325068979856502.gal : 3 ms
[2024-06-03 05:47:31] [INFO ] Time to serialize properties into /tmp/CTLFireability4440468128892739599.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5852325068979856502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4440468128892739599.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.33313e+18,230.136,3888076,13185,3054,3.9686e+06,30347,446,3.38948e+07,265,484990,0
Converting to forward existential form...Done !
original formula: A(A(AX(((AF((i0.i0.u34.p272==1)) + (i0.i0.u34.p267==1)) + (i0.i0.i0.i0.i0.i1.i1.i0.u21.p117==1))) U AG((!(E((i0.i0.i0.i0.i1.u54.p170==1) ...470
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((i0.i0.i0.i0.i0.i1.i1.i0.u22.p134==1) * E(EX((i0.i0.i0.i0.i0.i0.i1.i0.u13.p48==1)) U E(...1681
Reverse transition relation is NOT exact ! Due to transitions t238, t242, u38.t6, u38.t7, u38.t9, i0.t248, i0.i0.u34.t29, i0.i0.u34.t34, i0.i0.u34.t38, i0....1905
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="MedleyA-PT-21"
export BK_EXAMINATION="CTLFireability"
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-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-21, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734920100162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-21.tgz
mv MedleyA-PT-21 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;