About the Execution of ITS-Tools for CO4-PT-21
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7178.004 | 3600000.00 | 3800953.00 | 8443.30 | TTFFTTFTFFF?TT?? | 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.r550-tall-171734898700162.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 CO4-PT-21, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898700162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 344K 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 CO4-PT-21-CTLFireability-2024-00
FORMULA_NAME CO4-PT-21-CTLFireability-2024-01
FORMULA_NAME CO4-PT-21-CTLFireability-2024-02
FORMULA_NAME CO4-PT-21-CTLFireability-2024-03
FORMULA_NAME CO4-PT-21-CTLFireability-2024-04
FORMULA_NAME CO4-PT-21-CTLFireability-2024-05
FORMULA_NAME CO4-PT-21-CTLFireability-2024-06
FORMULA_NAME CO4-PT-21-CTLFireability-2024-07
FORMULA_NAME CO4-PT-21-CTLFireability-2024-08
FORMULA_NAME CO4-PT-21-CTLFireability-2024-09
FORMULA_NAME CO4-PT-21-CTLFireability-2024-10
FORMULA_NAME CO4-PT-21-CTLFireability-2024-11
FORMULA_NAME CO4-PT-21-CTLFireability-2024-12
FORMULA_NAME CO4-PT-21-CTLFireability-2024-13
FORMULA_NAME CO4-PT-21-CTLFireability-2024-14
FORMULA_NAME CO4-PT-21-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717357080168
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 19:38:01] [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-02 19:38:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:38:01] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-06-02 19:38:01] [INFO ] Transformed 1400 places.
[2024-06-02 19:38:01] [INFO ] Transformed 1583 transitions.
[2024-06-02 19:38:01] [INFO ] Found NUPN structural information;
[2024-06-02 19:38:01] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 307 places in 15 ms
Reduce places removed 307 places and 347 transitions.
Support contains 77 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1070 transition count 1231
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules 186 place count 912 transition count 1073
Iterating global reduction 1 with 158 rules applied. Total rules applied 344 place count 912 transition count 1073
Discarding 128 places :
Symmetric choice reduction at 1 with 128 rule applications. Total rules 472 place count 784 transition count 945
Iterating global reduction 1 with 128 rules applied. Total rules applied 600 place count 784 transition count 945
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 603 place count 784 transition count 942
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 661 place count 726 transition count 884
Iterating global reduction 2 with 58 rules applied. Total rules applied 719 place count 726 transition count 884
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 760 place count 685 transition count 843
Iterating global reduction 2 with 41 rules applied. Total rules applied 801 place count 685 transition count 843
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 803 place count 685 transition count 841
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 827 place count 661 transition count 817
Iterating global reduction 3 with 24 rules applied. Total rules applied 851 place count 661 transition count 817
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 852 place count 661 transition count 816
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 860 place count 653 transition count 808
Iterating global reduction 4 with 8 rules applied. Total rules applied 868 place count 653 transition count 808
Applied a total of 868 rules in 320 ms. Remains 653 /1093 variables (removed 440) and now considering 808/1236 (removed 428) transitions.
// Phase 1: matrix 808 rows 653 cols
[2024-06-02 19:38:02] [INFO ] Computed 5 invariants in 12 ms
[2024-06-02 19:38:02] [INFO ] Implicit Places using invariants in 348 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 380 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/1093 places, 808/1236 transitions.
Applied a total of 0 rules in 14 ms. Remains 652 /652 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 736 ms. Remains : 652/1093 places, 808/1236 transitions.
Support contains 77 out of 652 places after structural reductions.
[2024-06-02 19:38:02] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 19:38:02] [INFO ] Flatten gal took : 90 ms
FORMULA CO4-PT-21-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:38:02] [INFO ] Flatten gal took : 46 ms
[2024-06-02 19:38:02] [INFO ] Input system was already deterministic with 808 transitions.
Support contains 73 out of 652 places (down from 77) after GAL structural reductions.
RANDOM walk for 40000 steps (136 resets) in 1749 ms. (22 steps per ms) remains 51/59 properties
BEST_FIRST walk for 4004 steps (18 resets) in 39 ms. (100 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (16 resets) in 78 ms. (50 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (17 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (17 resets) in 35 ms. (111 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4003 steps (17 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (18 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (19 resets) in 10 ms. (363 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 47/49 properties
BEST_FIRST walk for 4004 steps (15 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (16 resets) in 40 ms. (97 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (17 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (17 resets) in 35 ms. (111 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (18 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (17 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (14 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (18 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (17 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (17 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (14 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (17 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (18 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (18 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (18 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (17 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (14 resets) in 33 ms. (117 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4002 steps (12 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 43/45 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (18 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (9 resets) in 8 ms. (444 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (16 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (19 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (17 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (17 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (19 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (10 resets) in 9 ms. (400 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (17 resets) in 9 ms. (400 steps per ms) remains 43/43 properties
// Phase 1: matrix 808 rows 652 cols
[2024-06-02 19:38:03] [INFO ] Computed 4 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 208/265 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 558/823 variables, 241/298 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 12/835 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/835 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 18/853 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/853 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 424/1277 variables, 240/542 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1277 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 134/1411 variables, 81/623 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1411 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 13 (OVERLAPS) 37/1448 variables, 24/647 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1448 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 15 (OVERLAPS) 11/1459 variables, 8/655 constraints. Problems are: Problem set: 1 solved, 42 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1459/1460 variables, and 655 constraints, problems are : Problem set: 1 solved, 42 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 651/652 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 195/249 variables, 54/54 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 1/55 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 547/796 variables, 232/287 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 41/328 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 0/328 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 12/808 variables, 1/329 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/808 variables, 0/329 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 18/826 variables, 3/332 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/826 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 438/1264 variables, 244/576 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1264 variables, 0/576 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 143/1407 variables, 87/663 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1407 variables, 0/663 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 15 (OVERLAPS) 39/1446 variables, 25/688 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1446 variables, 0/688 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 17 (OVERLAPS) 13/1459 variables, 9/697 constraints. Problems are: Problem set: 1 solved, 42 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1459/1460 variables, and 697 constraints, problems are : Problem set: 1 solved, 42 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 651/652 constraints, PredecessorRefiner: 42/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 10133ms problems are : Problem set: 1 solved, 42 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 808/808 transitions.
Graph (trivial) has 588 edges and 652 vertex of which 3 / 652 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1007 edges and 650 vertex of which 633 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 261 rules applied. Total rules applied 263 place count 633 transition count 533
Reduce places removed 238 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 253 rules applied. Total rules applied 516 place count 395 transition count 518
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 531 place count 380 transition count 518
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 531 place count 380 transition count 461
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 645 place count 323 transition count 461
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 647 place count 321 transition count 459
Iterating global reduction 3 with 2 rules applied. Total rules applied 649 place count 321 transition count 459
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 649 place count 321 transition count 458
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 651 place count 320 transition count 458
Performed 87 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 825 place count 233 transition count 359
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 829 place count 233 transition count 355
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 834 place count 228 transition count 350
Iterating global reduction 4 with 5 rules applied. Total rules applied 839 place count 228 transition count 350
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 841 place count 227 transition count 349
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 917 place count 189 transition count 352
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 934 place count 189 transition count 335
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 955 place count 168 transition count 293
Iterating global reduction 5 with 21 rules applied. Total rules applied 976 place count 168 transition count 293
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 985 place count 168 transition count 284
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 987 place count 166 transition count 279
Iterating global reduction 6 with 2 rules applied. Total rules applied 989 place count 166 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 990 place count 166 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 999 place count 166 transition count 269
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1007 place count 166 transition count 261
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1016 place count 158 transition count 260
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1020 place count 158 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1021 place count 157 transition count 259
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 8 with 7 rules applied. Total rules applied 1028 place count 154 transition count 255
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1032 place count 150 transition count 255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1036 place count 148 transition count 253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1038 place count 148 transition count 251
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 1042 place count 148 transition count 247
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1043 place count 147 transition count 246
Iterating global reduction 11 with 1 rules applied. Total rules applied 1044 place count 147 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1045 place count 147 transition count 245
Free-agglomeration rule applied 9 times.
Iterating global reduction 12 with 9 rules applied. Total rules applied 1054 place count 147 transition count 236
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1063 place count 138 transition count 236
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 1068 place count 138 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1069 place count 138 transition count 235
Applied a total of 1069 rules in 218 ms. Remains 138 /652 variables (removed 514) and now considering 235/808 (removed 573) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 138/652 places, 235/808 transitions.
RANDOM walk for 40000 steps (2509 resets) in 1178 ms. (33 steps per ms) remains 9/42 properties
BEST_FIRST walk for 40004 steps (230 resets) in 94 ms. (421 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (293 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (300 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (223 resets) in 33 ms. (1176 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (151 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (299 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (261 resets) in 85 ms. (465 steps per ms) remains 5/6 properties
[2024-06-02 19:38:14] [INFO ] Flow matrix only has 220 transitions (discarded 15 similar events)
// Phase 1: matrix 220 rows 138 cols
[2024-06-02 19:38:14] [INFO ] Computed 1 invariants in 1 ms
[2024-06-02 19:38:14] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/48 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 135/183 variables, 48/49 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 135/318 variables, 59/108 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 1/109 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 37/355 variables, 28/137 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 3/140 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/358 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 140 constraints, problems are : Problem set: 1 solved, 4 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 40/47 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 100/147 variables, 47/48 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 1/49 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 130/277 variables, 38/87 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 1/88 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 3/91 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 75/352 variables, 48/139 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 12 (OVERLAPS) 6/358 variables, 5/144 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/144 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/358 variables, 0/144 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 144 constraints, problems are : Problem set: 2 solved, 3 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 397ms problems are : Problem set: 2 solved, 3 unsolved
Finished Parikh walk after 271 steps, including 14 resets, run visited all 1 properties in 1 ms. (steps per millisecond=271 )
Parikh walk visited 3 properties in 30 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2024-06-02 19:38:15] [INFO ] Flatten gal took : 31 ms
[2024-06-02 19:38:15] [INFO ] Flatten gal took : 28 ms
[2024-06-02 19:38:15] [INFO ] Input system was already deterministic with 808 transitions.
Support contains 64 out of 652 places (down from 65) after GAL structural reductions.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 1010 edges and 652 vertex of which 643 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Graph (trivial) has 693 edges and 652 vertex of which 3 / 652 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1008 edges and 650 vertex of which 642 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 296 rules applied. Total rules applied 298 place count 641 transition count 499
Reduce places removed 296 places and 0 transitions.
Iterating post reduction 1 with 296 rules applied. Total rules applied 594 place count 345 transition count 499
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 594 place count 345 transition count 442
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 708 place count 288 transition count 442
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 719 place count 277 transition count 431
Iterating global reduction 2 with 11 rules applied. Total rules applied 730 place count 277 transition count 431
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 730 place count 277 transition count 426
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 740 place count 272 transition count 426
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 745 place count 267 transition count 421
Iterating global reduction 2 with 5 rules applied. Total rules applied 750 place count 267 transition count 421
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 824 place count 230 transition count 383
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 829 place count 230 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 830 place count 229 transition count 378
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 838 place count 221 transition count 370
Iterating global reduction 4 with 8 rules applied. Total rules applied 846 place count 221 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 849 place count 221 transition count 367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 850 place count 220 transition count 367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 852 place count 219 transition count 366
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 853 place count 218 transition count 365
Iterating global reduction 6 with 1 rules applied. Total rules applied 854 place count 218 transition count 365
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 855 place count 217 transition count 363
Iterating global reduction 6 with 1 rules applied. Total rules applied 856 place count 217 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 857 place count 217 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 876 place count 217 transition count 343
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 11 rules applied. Total rules applied 887 place count 217 transition count 332
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 898 place count 206 transition count 332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 898 place count 206 transition count 331
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 900 place count 205 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 902 place count 204 transition count 330
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 905 place count 204 transition count 330
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 907 place count 202 transition count 328
Applied a total of 907 rules in 88 ms. Remains 202 /652 variables (removed 450) and now considering 328/808 (removed 480) transitions.
// Phase 1: matrix 328 rows 202 cols
[2024-06-02 19:38:15] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:38:15] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 19:38:15] [INFO ] Invariant cache hit.
[2024-06-02 19:38:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:38:15] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-06-02 19:38:15] [INFO ] Redundant transitions in 19 ms returned []
Running 314 sub problems to find dead transitions.
[2024-06-02 19:38:15] [INFO ] Invariant cache hit.
[2024-06-02 19:38:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (OVERLAPS) 327/529 variables, 202/206 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 1/530 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (OVERLAPS) 0/530 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 207 constraints, problems are : Problem set: 0 solved, 314 unsolved in 11648 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (OVERLAPS) 327/529 variables, 202/206 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 314/520 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (OVERLAPS) 1/530 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 0/530 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 521 constraints, problems are : Problem set: 0 solved, 314 unsolved in 16801 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints]
After SMT, in 28569ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 28573ms
Starting structural reductions in SI_CTL mode, iteration 1 : 202/652 places, 328/808 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28903 ms. Remains : 202/652 places, 328/808 transitions.
[2024-06-02 19:38:44] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:38:44] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:38:44] [INFO ] Input system was already deterministic with 328 transitions.
[2024-06-02 19:38:44] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:38:44] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:38:44] [INFO ] Time to serialize gal into /tmp/CTLFireability12794488027021229937.gal : 12 ms
[2024-06-02 19:38:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4958586940467387460.ctl : 3 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/CTLFireability12794488027021229937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4958586940467387460.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.45602e+08,0.171248,10180,2,1294,5,26105,6,0,1121,24336,0
Converting to forward existential form...Done !
original formula: EG(E(!(EG((p1365==1))) U ((p226==1)&&((p156==1)||(p1004==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(!(EG((p1365==1))) U ((p226==1)&&((p156==1)||(p1004==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t20, t35, t63, t77, t82, t96, t109, t114, t156, t174, t323, Intersection with reach...231
(forward)formula 0,1,13.0506,431124,1,0,810,2.1249e+06,685,512,6831,2.86966e+06,1105
FORMULA CO4-PT-21-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 619 transition count 774
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 619 transition count 774
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 88 place count 597 transition count 752
Iterating global reduction 0 with 22 rules applied. Total rules applied 110 place count 597 transition count 752
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 111 place count 597 transition count 751
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 122 place count 586 transition count 740
Iterating global reduction 1 with 11 rules applied. Total rules applied 133 place count 586 transition count 740
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 136 place count 583 transition count 737
Iterating global reduction 1 with 3 rules applied. Total rules applied 139 place count 583 transition count 737
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 140 place count 583 transition count 736
Applied a total of 140 rules in 52 ms. Remains 583 /652 variables (removed 69) and now considering 736/808 (removed 72) transitions.
// Phase 1: matrix 736 rows 583 cols
[2024-06-02 19:38:57] [INFO ] Computed 4 invariants in 9 ms
[2024-06-02 19:38:57] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 19:38:57] [INFO ] Invariant cache hit.
[2024-06-02 19:38:58] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2024-06-02 19:38:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-02 19:39:27] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 26 ms to minimize.
[2024-06-02 19:39:27] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 589 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (OVERLAPS) 736/1319 variables, 583/589 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1319 variables, 735/1324 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 1324 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 2/2 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Starting structural reductions in LTL mode, iteration 1 : 583/652 places, 736/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60734 ms. Remains : 583/652 places, 736/808 transitions.
[2024-06-02 19:39:58] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:39:58] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:39:58] [INFO ] Input system was already deterministic with 736 transitions.
[2024-06-02 19:39:58] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:39:58] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:39:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13954577898048148649.gal : 5 ms
[2024-06-02 19:39:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2437639550712193306.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/CTLFireability13954577898048148649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2437639550712193306.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,8.66365e+10,3.17142,92444,2,11501,5,278103,6,0,3066,489052,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:40:28] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:40:28] [INFO ] Applying decomposition
[2024-06-02 19:40:28] [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/graph4116882792108757702.txt' '-o' '/tmp/graph4116882792108757702.bin' '-w' '/tmp/graph4116882792108757702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4116882792108757702.bin' '-l' '-1' '-v' '-w' '/tmp/graph4116882792108757702.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:40:28] [INFO ] Decomposing Gal with order
[2024-06-02 19:40:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:40:28] [INFO ] Removed a total of 227 redundant transitions.
[2024-06-02 19:40:28] [INFO ] Flatten gal took : 64 ms
[2024-06-02 19:40:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-06-02 19:40:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15714397662075429750.gal : 11 ms
[2024-06-02 19:40:28] [INFO ] Time to serialize properties into /tmp/CTLFireability4966133436067928760.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/CTLFireability15714397662075429750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4966133436067928760.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,8.66365e+10,0.448157,21632,1141,110,31720,2408,1272,75853,93,9570,0
Converting to forward existential form...Done !
original formula: EG((AF(EX(TRUE)) + EX((((i6.i1.i1.u56.p425==1)&&(i15.u142.p968==1)) + EX((i10.i1.i0.u65.p758==0))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EX(TRUE)))) + EX((((i6.i1.i1.u56.p425==1)&&(i15.u142.p968==1)) + EX((i10.i1.i0.u65.p758==0)))...168
Reverse transition relation is NOT exact ! Due to transitions t59, t103, t272, t284, t304, t343, t389, t418, t456, t497, t531, t543, t574, t586, t614, t623...903
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
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
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 SI_CTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Graph (trivial) has 700 edges and 652 vertex of which 3 / 652 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1008 edges and 650 vertex of which 641 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 300 transitions
Trivial Post-agglo rules discarded 300 transitions
Performed 300 trivial Post agglomeration. Transition count delta: 300
Iterating post reduction 0 with 301 rules applied. Total rules applied 303 place count 640 transition count 493
Reduce places removed 300 places and 0 transitions.
Iterating post reduction 1 with 300 rules applied. Total rules applied 603 place count 340 transition count 493
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 603 place count 340 transition count 436
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 717 place count 283 transition count 436
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 727 place count 273 transition count 426
Iterating global reduction 2 with 10 rules applied. Total rules applied 737 place count 273 transition count 426
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 737 place count 273 transition count 422
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 745 place count 269 transition count 422
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 749 place count 265 transition count 418
Iterating global reduction 2 with 4 rules applied. Total rules applied 753 place count 265 transition count 418
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 831 place count 226 transition count 378
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 836 place count 226 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 837 place count 225 transition count 373
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 845 place count 217 transition count 365
Iterating global reduction 4 with 8 rules applied. Total rules applied 853 place count 217 transition count 365
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 856 place count 217 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 857 place count 216 transition count 362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 859 place count 215 transition count 361
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 860 place count 214 transition count 360
Iterating global reduction 6 with 1 rules applied. Total rules applied 861 place count 214 transition count 360
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 862 place count 213 transition count 358
Iterating global reduction 6 with 1 rules applied. Total rules applied 863 place count 213 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 864 place count 213 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 883 place count 213 transition count 338
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 11 rules applied. Total rules applied 894 place count 213 transition count 327
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 905 place count 202 transition count 327
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 905 place count 202 transition count 326
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 907 place count 201 transition count 326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 909 place count 200 transition count 325
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 911 place count 198 transition count 323
Applied a total of 911 rules in 85 ms. Remains 198 /652 variables (removed 454) and now considering 323/808 (removed 485) transitions.
// Phase 1: matrix 323 rows 198 cols
[2024-06-02 19:40:59] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 19:40:59] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-06-02 19:40:59] [INFO ] Invariant cache hit.
[2024-06-02 19:40:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:40:59] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-06-02 19:40:59] [INFO ] Redundant transitions in 5 ms returned []
Running 310 sub problems to find dead transitions.
[2024-06-02 19:40:59] [INFO ] Invariant cache hit.
[2024-06-02 19:40:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 1/521 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 203 constraints, problems are : Problem set: 0 solved, 310 unsolved in 11577 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 310/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 1/521 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 0/521 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 521/521 variables, and 513 constraints, problems are : Problem set: 0 solved, 310 unsolved in 15949 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints]
After SMT, in 27633ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 27636ms
Starting structural reductions in SI_CTL mode, iteration 1 : 198/652 places, 323/808 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28142 ms. Remains : 198/652 places, 323/808 transitions.
[2024-06-02 19:41:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:41:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:41:27] [INFO ] Input system was already deterministic with 323 transitions.
[2024-06-02 19:41:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:41:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:41:27] [INFO ] Time to serialize gal into /tmp/CTLFireability2230539995192925680.gal : 2 ms
[2024-06-02 19:41:27] [INFO ] Time to serialize properties into /tmp/CTLFireability3215764213304278650.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/CTLFireability2230539995192925680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3215764213304278650.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.2367e+08,0.182374,9992,2,1265,5,25458,6,0,1101,24271,0
Converting to forward existential form...Done !
original formula: AG(EF(AG((p189==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((p189==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t18, t33, t59, t73, t78, t92, t107, t113, t153, t171, t321, Intersection with reachable ...226
(forward)formula 0,0,1.91734,61304,1,0,393,300961,667,208,6719,191387,655
FORMULA CO4-PT-21-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 620 transition count 775
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 620 transition count 775
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 85 place count 599 transition count 754
Iterating global reduction 0 with 21 rules applied. Total rules applied 106 place count 599 transition count 754
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 599 transition count 753
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 117 place count 589 transition count 743
Iterating global reduction 1 with 10 rules applied. Total rules applied 127 place count 589 transition count 743
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 586 transition count 740
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 586 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 134 place count 586 transition count 739
Applied a total of 134 rules in 75 ms. Remains 586 /652 variables (removed 66) and now considering 739/808 (removed 69) transitions.
// Phase 1: matrix 739 rows 586 cols
[2024-06-02 19:41:29] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 19:41:29] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 19:41:29] [INFO ] Invariant cache hit.
[2024-06-02 19:41:29] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 738 sub problems to find dead transitions.
[2024-06-02 19:41:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (OVERLAPS) 739/1325 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 738 unsolved
[2024-06-02 19:41:59] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 5 ms to minimize.
[2024-06-02 19:41:59] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 592 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 738 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 4 (OVERLAPS) 739/1325 variables, 586/592 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1325 variables, 738/1330 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1330 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 2/2 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 738 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in LTL mode, iteration 1 : 586/652 places, 739/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60665 ms. Remains : 586/652 places, 739/808 transitions.
[2024-06-02 19:42:29] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:42:29] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:42:29] [INFO ] Input system was already deterministic with 739 transitions.
[2024-06-02 19:42:29] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:42:29] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:42:29] [INFO ] Time to serialize gal into /tmp/CTLFireability2953694100941081583.gal : 4 ms
[2024-06-02 19:42:29] [INFO ] Time to serialize properties into /tmp/CTLFireability7434031806209443178.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/CTLFireability2953694100941081583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7434031806209443178.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,8.82942e+10,2.96019,94300,2,11607,5,280926,6,0,3081,489431,0
Converting to forward existential form...Done !
original formula: AF(((p835==0) * AX((p203==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((p835==0) * !(EX(!((p203==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t26, t27, t28, t33, t35, t40, t49, t51, t52, t53, t54, t55, t57, t60, t10...540
Detected timeout of ITS tools.
[2024-06-02 19:42:59] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:42:59] [INFO ] Applying decomposition
[2024-06-02 19:43:00] [INFO ] Flatten gal took : 13 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/graph5524840670530921192.txt' '-o' '/tmp/graph5524840670530921192.bin' '-w' '/tmp/graph5524840670530921192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5524840670530921192.bin' '-l' '-1' '-v' '-w' '/tmp/graph5524840670530921192.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:43:00] [INFO ] Decomposing Gal with order
[2024-06-02 19:43:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:43:00] [INFO ] Removed a total of 229 redundant transitions.
[2024-06-02 19:43:00] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:43:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2024-06-02 19:43:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9765866989044758922.gal : 9 ms
[2024-06-02 19:43:00] [INFO ] Time to serialize properties into /tmp/CTLFireability15707580493708680972.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/CTLFireability9765866989044758922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15707580493708680972.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,8.82942e+10,0.35223,16240,923,107,22017,2064,1275,43630,94,7028,0
Converting to forward existential form...Done !
original formula: AF(((i14.u118.p835==0) * AX((i6.u41.p203==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((i14.u118.p835==0) * !(EX(!((i6.u41.p203==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t35, t60, t104, t273, t285, t305, t345, t379, t391, t400, t420, t458, t545, t554, t556, t625,...899
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 622 transition count 778
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 622 transition count 778
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 80 place count 602 transition count 758
Iterating global reduction 0 with 20 rules applied. Total rules applied 100 place count 602 transition count 758
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 101 place count 602 transition count 757
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 110 place count 593 transition count 748
Iterating global reduction 1 with 9 rules applied. Total rules applied 119 place count 593 transition count 748
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 591 transition count 746
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 591 transition count 746
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 124 place count 591 transition count 745
Applied a total of 124 rules in 60 ms. Remains 591 /652 variables (removed 61) and now considering 745/808 (removed 63) transitions.
// Phase 1: matrix 745 rows 591 cols
[2024-06-02 19:43:30] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 19:43:30] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-02 19:43:30] [INFO ] Invariant cache hit.
[2024-06-02 19:43:30] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 744 sub problems to find dead transitions.
[2024-06-02 19:43:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 3 (OVERLAPS) 745/1336 variables, 591/595 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 595 constraints, problems are : Problem set: 0 solved, 744 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 591/591 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 3 (OVERLAPS) 745/1336 variables, 591/595 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 744/1339 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-06-02 19:44:26] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1340 constraints, problems are : Problem set: 0 solved, 744 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 591/591 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 1/1 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 744 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Starting structural reductions in LTL mode, iteration 1 : 591/652 places, 745/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60742 ms. Remains : 591/652 places, 745/808 transitions.
[2024-06-02 19:44:30] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:44:30] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:44:31] [INFO ] Input system was already deterministic with 745 transitions.
[2024-06-02 19:44:31] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:44:31] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:44:31] [INFO ] Time to serialize gal into /tmp/CTLFireability3905757165673229476.gal : 20 ms
[2024-06-02 19:44:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2097290489975689089.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/CTLFireability3905757165673229476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2097290489975689089.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,8.94403e+10,2.97632,88888,2,11229,5,271133,6,0,3106,456463,0
Converting to forward existential form...Done !
original formula: AX(((E((EG(A((p191==1) U (p713==1))) + !(EX((p299==1)))) U (p696==1)) + EG(AX(EF((p578==1))))) + AF(EX((p1199==1)))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !((E((EG(!((E(!((p713==1)) U (!((p191==1)) * !((p713==1)))) + EG(!((p713==1)))))) + !(EX((p299...242
Reverse transition relation is NOT exact ! Due to transitions t23, t24, t25, t26, t27, t28, t29, t34, t36, t41, t50, t52, t53, t54, t55, t56, t58, t61, t10...540
Detected timeout of ITS tools.
[2024-06-02 19:45:01] [INFO ] Flatten gal took : 31 ms
[2024-06-02 19:45:01] [INFO ] Applying decomposition
[2024-06-02 19:45:01] [INFO ] Flatten gal took : 21 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/graph5969650433458781400.txt' '-o' '/tmp/graph5969650433458781400.bin' '-w' '/tmp/graph5969650433458781400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5969650433458781400.bin' '-l' '-1' '-v' '-w' '/tmp/graph5969650433458781400.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:45:01] [INFO ] Decomposing Gal with order
[2024-06-02 19:45:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:45:01] [INFO ] Removed a total of 225 redundant transitions.
[2024-06-02 19:45:01] [INFO ] Flatten gal took : 61 ms
[2024-06-02 19:45:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 24 ms.
[2024-06-02 19:45:01] [INFO ] Time to serialize gal into /tmp/CTLFireability6107389013435334488.gal : 24 ms
[2024-06-02 19:45:01] [INFO ] Time to serialize properties into /tmp/CTLFireability6076377074399103683.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/CTLFireability6107389013435334488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6076377074399103683.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,8.94403e+10,0.387239,17464,907,101,23898,2626,1316,50505,98,8906,0
Converting to forward existential form...Done !
original formula: AX(((E((EG(A((i1.i0.i2.u18.p191==1) U (i12.u93.p713==1))) + !(EX((i3.u32.p299==1)))) U (i11.u88.p696==1)) + EG(AX(EF((i9.u72.p578==1)))))...193
=> equivalent forward existential formula: [FwdG((EY(Init) * !((E((EG(!((E(!((i12.u93.p713==1)) U (!((i1.i0.i2.u18.p191==1)) * !((i12.u93.p713==1)))) + EG(...316
Reverse transition relation is NOT exact ! Due to transitions t61, t105, t189, t248, t263, t274, t275, t306, t345, t400, t402, t422, t433, t503, t537, t549...896
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
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
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 624 transition count 779
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 624 transition count 779
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 74 place count 606 transition count 761
Iterating global reduction 0 with 18 rules applied. Total rules applied 92 place count 606 transition count 761
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 606 transition count 760
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 103 place count 596 transition count 750
Iterating global reduction 1 with 10 rules applied. Total rules applied 113 place count 596 transition count 750
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 593 transition count 747
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 593 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 593 transition count 746
Applied a total of 120 rules in 46 ms. Remains 593 /652 variables (removed 59) and now considering 746/808 (removed 62) transitions.
// Phase 1: matrix 746 rows 593 cols
[2024-06-02 19:45:31] [INFO ] Computed 4 invariants in 14 ms
[2024-06-02 19:45:32] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-06-02 19:45:32] [INFO ] Invariant cache hit.
[2024-06-02 19:45:32] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
Running 745 sub problems to find dead transitions.
[2024-06-02 19:45:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 3 (OVERLAPS) 746/1339 variables, 593/597 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-06-02 19:46:02] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-06-02 19:46:02] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 3 ms to minimize.
SMT process timed out in 30242ms, After SMT, problems are : Problem set: 0 solved, 745 unsolved
Search for dead transitions found 0 dead transitions in 30249ms
Starting structural reductions in LTL mode, iteration 1 : 593/652 places, 746/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31116 ms. Remains : 593/652 places, 746/808 transitions.
[2024-06-02 19:46:02] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:46:02] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:46:02] [INFO ] Input system was already deterministic with 746 transitions.
[2024-06-02 19:46:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:46:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:46:02] [INFO ] Time to serialize gal into /tmp/CTLFireability4873618176383684045.gal : 3 ms
[2024-06-02 19:46:02] [INFO ] Time to serialize properties into /tmp/CTLFireability2712501448566565539.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/CTLFireability4873618176383684045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2712501448566565539.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,9.71156e+10,3.11335,97552,2,11527,5,289640,6,0,3116,517211,0
Converting to forward existential form...Done !
original formula: (AF(EG((((EF((p742!=1)) * (p957!=1)) * (p1324!=1)) + EF((p1129!=1))))) * (AG((E((p153==1) U (p1125==1)) + AG(((p561!=1)||(p1285!=1))))) +...172
=> equivalent forward existential formula: ([FwdG(Init,!(EG((((E(TRUE U (p742!=1)) * (p957!=1)) * (p1324!=1)) + E(TRUE U (p1129!=1))))))] = FALSE * [(FwdU(...271
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t32, t34, t39, t48, t50, t51, t54, t55, t56, t58, t61, t10...540
Detected timeout of ITS tools.
[2024-06-02 19:46:32] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:46:32] [INFO ] Applying decomposition
[2024-06-02 19:46:32] [INFO ] Flatten gal took : 12 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/graph4158365591169192219.txt' '-o' '/tmp/graph4158365591169192219.bin' '-w' '/tmp/graph4158365591169192219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4158365591169192219.bin' '-l' '-1' '-v' '-w' '/tmp/graph4158365591169192219.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:46:32] [INFO ] Decomposing Gal with order
[2024-06-02 19:46:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:46:32] [INFO ] Removed a total of 221 redundant transitions.
[2024-06-02 19:46:32] [INFO ] Flatten gal took : 30 ms
[2024-06-02 19:46:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-02 19:46:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11316905773600212548.gal : 5 ms
[2024-06-02 19:46:32] [INFO ] Time to serialize properties into /tmp/CTLFireability17244837342930649556.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/CTLFireability11316905773600212548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17244837342930649556.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,9.71156e+10,0.440277,20564,1176,97,34134,1715,1054,59342,95,6133,0
Converting to forward existential form...Done !
original formula: (AF(EG((((EF((i7.u99.p742!=1)) * (i13.u144.p957!=1)) * (i21.u219.p1324!=1)) + EF((i17.u178.p1129!=1))))) * (AG((E((i1.u13.p153==1) U (i13...247
=> equivalent forward existential formula: ([FwdG(Init,!(EG((((E(TRUE U (i7.u99.p742!=1)) * (i13.u144.p957!=1)) * (i21.u219.p1324!=1)) + E(TRUE U (i17.u178...346
Reverse transition relation is NOT exact ! Due to transitions t34, t50, t61, t105, t305, t311, t350, t396, t425, t622, t631, t658, t659, i0.t613, i1.t591, ...835
(forward)formula 0,0,2.15936,85508,1,0,155589,3269,8839,361852,530,13561,433549
FORMULA CO4-PT-21-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Graph (trivial) has 697 edges and 652 vertex of which 3 / 652 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1008 edges and 650 vertex of which 641 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 298 transitions
Trivial Post-agglo rules discarded 298 transitions
Performed 298 trivial Post agglomeration. Transition count delta: 298
Iterating post reduction 0 with 299 rules applied. Total rules applied 301 place count 640 transition count 495
Reduce places removed 298 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 300 rules applied. Total rules applied 601 place count 342 transition count 493
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 603 place count 340 transition count 493
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 603 place count 340 transition count 436
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 717 place count 283 transition count 436
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 728 place count 272 transition count 425
Iterating global reduction 3 with 11 rules applied. Total rules applied 739 place count 272 transition count 425
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 739 place count 272 transition count 420
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 749 place count 267 transition count 420
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 754 place count 262 transition count 415
Iterating global reduction 3 with 5 rules applied. Total rules applied 759 place count 262 transition count 415
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 835 place count 224 transition count 376
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 840 place count 224 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 841 place count 223 transition count 371
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 849 place count 215 transition count 363
Iterating global reduction 5 with 8 rules applied. Total rules applied 857 place count 215 transition count 363
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 860 place count 215 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 861 place count 214 transition count 360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 863 place count 213 transition count 359
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 864 place count 212 transition count 358
Iterating global reduction 7 with 1 rules applied. Total rules applied 865 place count 212 transition count 358
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 866 place count 211 transition count 356
Iterating global reduction 7 with 1 rules applied. Total rules applied 867 place count 211 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 868 place count 211 transition count 355
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 887 place count 211 transition count 336
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 8 with 11 rules applied. Total rules applied 898 place count 211 transition count 325
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 909 place count 200 transition count 325
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 909 place count 200 transition count 324
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 911 place count 199 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 913 place count 198 transition count 323
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 916 place count 198 transition count 323
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 918 place count 196 transition count 321
Applied a total of 918 rules in 62 ms. Remains 196 /652 variables (removed 456) and now considering 321/808 (removed 487) transitions.
// Phase 1: matrix 321 rows 196 cols
[2024-06-02 19:46:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:46:35] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 19:46:35] [INFO ] Invariant cache hit.
[2024-06-02 19:46:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:46:35] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-06-02 19:46:35] [INFO ] Redundant transitions in 4 ms returned []
Running 308 sub problems to find dead transitions.
[2024-06-02 19:46:35] [INFO ] Invariant cache hit.
[2024-06-02 19:46:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 320/516 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 1/517 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 0/517 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 201 constraints, problems are : Problem set: 0 solved, 308 unsolved in 11155 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 320/516 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 308/508 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (OVERLAPS) 1/517 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 0/517 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 509 constraints, problems are : Problem set: 0 solved, 308 unsolved in 16769 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints]
After SMT, in 27994ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 27996ms
Starting structural reductions in SI_CTL mode, iteration 1 : 196/652 places, 321/808 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28237 ms. Remains : 196/652 places, 321/808 transitions.
[2024-06-02 19:47:03] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:47:03] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:47:03] [INFO ] Input system was already deterministic with 321 transitions.
[2024-06-02 19:47:03] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:47:03] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:47:03] [INFO ] Time to serialize gal into /tmp/CTLFireability18211581443816047617.gal : 2 ms
[2024-06-02 19:47:03] [INFO ] Time to serialize properties into /tmp/CTLFireability6626184882270021566.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/CTLFireability18211581443816047617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6626184882270021566.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.19253e+08,0.178364,9972,2,1242,5,24786,6,0,1091,23762,0
Converting to forward existential form...Done !
original formula: EF(EG((p707==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p707==1))] != FALSE
Hit Full ! (commute/partial/dont) 318/0/3
(forward)formula 0,1,0.681906,27244,1,0,8,143983,19,2,5240,38272,8
FORMULA CO4-PT-21-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 621 transition count 776
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 621 transition count 776
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 82 place count 601 transition count 756
Iterating global reduction 0 with 20 rules applied. Total rules applied 102 place count 601 transition count 756
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 103 place count 601 transition count 755
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 113 place count 591 transition count 745
Iterating global reduction 1 with 10 rules applied. Total rules applied 123 place count 591 transition count 745
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 588 transition count 742
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 588 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 130 place count 588 transition count 741
Applied a total of 130 rules in 44 ms. Remains 588 /652 variables (removed 64) and now considering 741/808 (removed 67) transitions.
// Phase 1: matrix 741 rows 588 cols
[2024-06-02 19:47:04] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 19:47:04] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-02 19:47:04] [INFO ] Invariant cache hit.
[2024-06-02 19:47:04] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 740 sub problems to find dead transitions.
[2024-06-02 19:47:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 3 (OVERLAPS) 741/1329 variables, 588/592 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1329/1329 variables, and 592 constraints, problems are : Problem set: 0 solved, 740 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 740/740 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 740 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 3 (OVERLAPS) 741/1329 variables, 588/592 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1329 variables, 740/1332 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-06-02 19:47:51] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1329/1329 variables, and 1333 constraints, problems are : Problem set: 0 solved, 740 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 740/740 constraints, Known Traps: 1/1 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LTL mode, iteration 1 : 588/652 places, 741/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60657 ms. Remains : 588/652 places, 741/808 transitions.
[2024-06-02 19:48:04] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:48:04] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:48:04] [INFO ] Input system was already deterministic with 741 transitions.
[2024-06-02 19:48:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:48:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:48:04] [INFO ] Time to serialize gal into /tmp/CTLFireability4372807920807830302.gal : 2 ms
[2024-06-02 19:48:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12771752018889834726.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/CTLFireability4372807920807830302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12771752018889834726.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,8.94204e+10,2.87962,90760,2,11300,5,273689,6,0,3091,473284,0
Converting to forward existential form...Done !
original formula: (AX((((p393==1)&&(p1285==1)) + ((EX((p998==1)) * EG((p991==1))) * ((p348==0) * (EF((p653==1)) + AF((p549==1))))))) * AF(EG((p1342==0))))
=> equivalent forward existential formula: ((([((EY(Init) * !(((p393==1)&&(p1285==1)))) * !(EX((p998==1))))] = FALSE * [((EY(Init) * !(((p393==1)&&(p1285==...402
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t26, t27, t28, t33, t35, t40, t49, t51, t52, t53, t54, t55, t57, t60, t10...546
Detected timeout of ITS tools.
[2024-06-02 19:48:34] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:48:34] [INFO ] Applying decomposition
[2024-06-02 19:48:34] [INFO ] Flatten gal took : 11 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/graph7819839102833203160.txt' '-o' '/tmp/graph7819839102833203160.bin' '-w' '/tmp/graph7819839102833203160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7819839102833203160.bin' '-l' '-1' '-v' '-w' '/tmp/graph7819839102833203160.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:48:35] [INFO ] Decomposing Gal with order
[2024-06-02 19:48:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:48:35] [INFO ] Removed a total of 233 redundant transitions.
[2024-06-02 19:48:35] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:48:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2024-06-02 19:48:35] [INFO ] Time to serialize gal into /tmp/CTLFireability9038816159056500502.gal : 5 ms
[2024-06-02 19:48:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7859463159771513257.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/CTLFireability9038816159056500502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7859463159771513257.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,8.94204e+10,0.63966,26508,1192,112,39543,2318,1269,111376,93,9687,0
Converting to forward existential form...Done !
original formula: (AX((((i6.i0.i2.u60.p393==1)&&(i15.u154.p1285==1)) + ((EX((i17.i0.i0.u161.p998==1)) * EG((i16.u158.p991==1))) * ((i5.u49.p348==0) * (EF((...231
=> equivalent forward existential formula: ((([((EY(Init) * !(((i6.i0.i2.u60.p393==1)&&(i15.u154.p1285==1)))) * !(EX((i17.i0.i0.u161.p998==1))))] = FALSE *...545
Reverse transition relation is NOT exact ! Due to transitions t60, t104, t188, t285, t305, t344, t378, t390, t398, t399, t421, t459, t500, t547, t618, t627...928
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 622 transition count 777
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 622 transition count 777
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 80 place count 602 transition count 757
Iterating global reduction 0 with 20 rules applied. Total rules applied 100 place count 602 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 101 place count 602 transition count 756
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 111 place count 592 transition count 746
Iterating global reduction 1 with 10 rules applied. Total rules applied 121 place count 592 transition count 746
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 124 place count 589 transition count 743
Iterating global reduction 1 with 3 rules applied. Total rules applied 127 place count 589 transition count 743
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 128 place count 589 transition count 742
Applied a total of 128 rules in 55 ms. Remains 589 /652 variables (removed 63) and now considering 742/808 (removed 66) transitions.
// Phase 1: matrix 742 rows 589 cols
[2024-06-02 19:49:05] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 19:49:05] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 19:49:05] [INFO ] Invariant cache hit.
[2024-06-02 19:49:05] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 741 sub problems to find dead transitions.
[2024-06-02 19:49:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (OVERLAPS) 1/589 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 3 (OVERLAPS) 742/1331 variables, 589/593 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-02 19:49:35] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 3 ms to minimize.
[2024-06-02 19:49:35] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
SMT process timed out in 30220ms, After SMT, problems are : Problem set: 0 solved, 741 unsolved
Search for dead transitions found 0 dead transitions in 30229ms
Starting structural reductions in LTL mode, iteration 1 : 589/652 places, 742/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30682 ms. Remains : 589/652 places, 742/808 transitions.
[2024-06-02 19:49:35] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:49:35] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:49:35] [INFO ] Input system was already deterministic with 742 transitions.
[2024-06-02 19:49:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:49:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:49:35] [INFO ] Time to serialize gal into /tmp/CTLFireability10781964805633350860.gal : 2 ms
[2024-06-02 19:49:35] [INFO ] Time to serialize properties into /tmp/CTLFireability5994341939219176218.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/CTLFireability10781964805633350860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5994341939219176218.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,8.94772e+10,3.61431,93140,2,11347,5,275241,6,0,3096,486906,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:50:05] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:50:06] [INFO ] Applying decomposition
[2024-06-02 19:50:06] [INFO ] Flatten gal took : 11 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/graph89494516892478194.txt' '-o' '/tmp/graph89494516892478194.bin' '-w' '/tmp/graph89494516892478194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph89494516892478194.bin' '-l' '-1' '-v' '-w' '/tmp/graph89494516892478194.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:50:06] [INFO ] Decomposing Gal with order
[2024-06-02 19:50:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:50:06] [INFO ] Removed a total of 222 redundant transitions.
[2024-06-02 19:50:06] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:50:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-06-02 19:50:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8825651575662110780.gal : 5 ms
[2024-06-02 19:50:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17727101222195308668.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/CTLFireability8825651575662110780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17727101222195308668.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,8.94772e+10,0.397714,18388,1062,111,26712,1997,1056,59755,95,7257,0
Converting to forward existential form...Done !
original formula: AF(EG(A(AX((((i7.i1.u65.p549==1)&&(i19.u209.p1258==1))&&(i21.u220.p1387==1))) U (E((i12.u136.p905==1) U (i12.u133.p903==1)) * ((i2.u16.p1...207
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((E(!((E((i12.u136.p905==1) U (i12.u133.p903==1)) * ((i2.u16.p185!=1)||((i21.u216.p1336==1)&&(i...499
Reverse transition relation is NOT exact ! Due to transitions t60, t105, t306, t345, t391, t399, t400, t420, t458, t499, t545, t617, t626, t654, t655, i0.t...848
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 624 transition count 779
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 624 transition count 779
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 75 place count 605 transition count 760
Iterating global reduction 0 with 19 rules applied. Total rules applied 94 place count 605 transition count 760
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 605 transition count 759
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 104 place count 596 transition count 750
Iterating global reduction 1 with 9 rules applied. Total rules applied 113 place count 596 transition count 750
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 593 transition count 747
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 593 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 593 transition count 746
Applied a total of 120 rules in 61 ms. Remains 593 /652 variables (removed 59) and now considering 746/808 (removed 62) transitions.
// Phase 1: matrix 746 rows 593 cols
[2024-06-02 19:50:36] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:50:36] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-02 19:50:36] [INFO ] Invariant cache hit.
[2024-06-02 19:50:36] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 745 sub problems to find dead transitions.
[2024-06-02 19:50:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 3 (OVERLAPS) 746/1339 variables, 593/597 constraints. Problems are: Problem set: 0 solved, 745 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1339/1339 variables, and 597 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 593/593 constraints, PredecessorRefiner: 745/745 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 745 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 3 (OVERLAPS) 746/1339 variables, 593/597 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1339 variables, 745/1342 constraints. Problems are: Problem set: 0 solved, 745 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1339/1339 variables, and 1342 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 593/593 constraints, PredecessorRefiner: 745/745 constraints, Known Traps: 0/0 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 745 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Starting structural reductions in LTL mode, iteration 1 : 593/652 places, 746/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60861 ms. Remains : 593/652 places, 746/808 transitions.
[2024-06-02 19:51:37] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:51:37] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:51:37] [INFO ] Input system was already deterministic with 746 transitions.
[2024-06-02 19:51:37] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:51:37] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:51:37] [INFO ] Time to serialize gal into /tmp/CTLFireability4643282085450018882.gal : 2 ms
[2024-06-02 19:51:37] [INFO ] Time to serialize properties into /tmp/CTLFireability1127406155349840003.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/CTLFireability4643282085450018882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1127406155349840003.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.03954e+11,3.51964,110604,2,14070,5,326425,6,0,3116,604115,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:52:07] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:52:07] [INFO ] Applying decomposition
[2024-06-02 19:52:07] [INFO ] Flatten gal took : 11 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/graph13959065601040340575.txt' '-o' '/tmp/graph13959065601040340575.bin' '-w' '/tmp/graph13959065601040340575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13959065601040340575.bin' '-l' '-1' '-v' '-w' '/tmp/graph13959065601040340575.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:52:07] [INFO ] Decomposing Gal with order
[2024-06-02 19:52:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:52:07] [INFO ] Removed a total of 226 redundant transitions.
[2024-06-02 19:52:07] [INFO ] Flatten gal took : 36 ms
[2024-06-02 19:52:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-06-02 19:52:07] [INFO ] Time to serialize gal into /tmp/CTLFireability13422863719028211575.gal : 6 ms
[2024-06-02 19:52:07] [INFO ] Time to serialize properties into /tmp/CTLFireability14134116688453042446.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/CTLFireability13422863719028211575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14134116688453042446.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.03954e+11,1.51721,55036,1611,117,77109,1965,1291,327802,100,8813,0
Converting to forward existential form...Done !
original formula: E((((i2.i1.i0.u38.p319==1) + !(AG((i13.i1.i1.u202.p1229!=1)))) * (EX((i0.u214.p1295==1)) + !((!(AG((i12.i0.i1.u111.p796==1))) * (i15.u165...421
=> equivalent forward existential formula: [(((((FwdU(Init,(((i2.i1.i0.u38.p319==1) + !(!(E(TRUE U !((i13.i1.i1.u202.p1229!=1)))))) * (EX((i0.u214.p1295==1...509
Reverse transition relation is NOT exact ! Due to transitions t60, t106, t190, t191, t236, t276, t299, t308, t348, t382, t394, t402, t403, t423, t434, t461...1084
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
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 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Graph (trivial) has 700 edges and 652 vertex of which 3 / 652 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1008 edges and 650 vertex of which 641 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 300 transitions
Trivial Post-agglo rules discarded 300 transitions
Performed 300 trivial Post agglomeration. Transition count delta: 300
Iterating post reduction 0 with 301 rules applied. Total rules applied 303 place count 640 transition count 493
Reduce places removed 300 places and 0 transitions.
Iterating post reduction 1 with 300 rules applied. Total rules applied 603 place count 340 transition count 493
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 603 place count 340 transition count 436
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 717 place count 283 transition count 436
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 727 place count 273 transition count 426
Iterating global reduction 2 with 10 rules applied. Total rules applied 737 place count 273 transition count 426
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 737 place count 273 transition count 421
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 747 place count 268 transition count 421
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 751 place count 264 transition count 417
Iterating global reduction 2 with 4 rules applied. Total rules applied 755 place count 264 transition count 417
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 831 place count 226 transition count 378
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 836 place count 226 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 837 place count 225 transition count 373
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 845 place count 217 transition count 365
Iterating global reduction 4 with 8 rules applied. Total rules applied 853 place count 217 transition count 365
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 856 place count 217 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 857 place count 216 transition count 362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 859 place count 215 transition count 361
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 860 place count 214 transition count 360
Iterating global reduction 6 with 1 rules applied. Total rules applied 861 place count 214 transition count 360
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 862 place count 213 transition count 358
Iterating global reduction 6 with 1 rules applied. Total rules applied 863 place count 213 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 864 place count 213 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 883 place count 213 transition count 338
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 11 rules applied. Total rules applied 894 place count 213 transition count 327
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 905 place count 202 transition count 327
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 905 place count 202 transition count 326
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 907 place count 201 transition count 326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 909 place count 200 transition count 325
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 911 place count 198 transition count 323
Applied a total of 911 rules in 58 ms. Remains 198 /652 variables (removed 454) and now considering 323/808 (removed 485) transitions.
// Phase 1: matrix 323 rows 198 cols
[2024-06-02 19:52:37] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:52:37] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-02 19:52:37] [INFO ] Invariant cache hit.
[2024-06-02 19:52:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:52:37] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-06-02 19:52:37] [INFO ] Redundant transitions in 5 ms returned []
Running 310 sub problems to find dead transitions.
[2024-06-02 19:52:37] [INFO ] Invariant cache hit.
[2024-06-02 19:52:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 1/521 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 203 constraints, problems are : Problem set: 0 solved, 310 unsolved in 12091 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 310/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 1/521 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 0/521 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 521/521 variables, and 513 constraints, problems are : Problem set: 0 solved, 310 unsolved in 15593 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints]
After SMT, in 27819ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 27823ms
Starting structural reductions in SI_CTL mode, iteration 1 : 198/652 places, 323/808 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28157 ms. Remains : 198/652 places, 323/808 transitions.
[2024-06-02 19:53:05] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:53:05] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:53:05] [INFO ] Input system was already deterministic with 323 transitions.
[2024-06-02 19:53:05] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:53:05] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:53:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16183126254549239006.gal : 1 ms
[2024-06-02 19:53:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality53150115791461686.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16183126254549239006.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality53150115791461686.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 31447 steps (2699 resets) in 103 ms. (302 steps per ms) remains 0/1 properties
FORMULA CO4-PT-21-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Graph (trivial) has 700 edges and 652 vertex of which 3 / 652 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1008 edges and 650 vertex of which 641 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 300 transitions
Trivial Post-agglo rules discarded 300 transitions
Performed 300 trivial Post agglomeration. Transition count delta: 300
Iterating post reduction 0 with 301 rules applied. Total rules applied 303 place count 640 transition count 493
Reduce places removed 300 places and 0 transitions.
Iterating post reduction 1 with 300 rules applied. Total rules applied 603 place count 340 transition count 493
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 603 place count 340 transition count 436
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 717 place count 283 transition count 436
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 728 place count 272 transition count 425
Iterating global reduction 2 with 11 rules applied. Total rules applied 739 place count 272 transition count 425
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 739 place count 272 transition count 420
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 749 place count 267 transition count 420
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 754 place count 262 transition count 415
Iterating global reduction 2 with 5 rules applied. Total rules applied 759 place count 262 transition count 415
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 833 place count 225 transition count 377
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 838 place count 225 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 839 place count 224 transition count 372
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 847 place count 216 transition count 364
Iterating global reduction 4 with 8 rules applied. Total rules applied 855 place count 216 transition count 364
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 858 place count 216 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 859 place count 215 transition count 361
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 861 place count 214 transition count 360
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 862 place count 213 transition count 359
Iterating global reduction 6 with 1 rules applied. Total rules applied 863 place count 213 transition count 359
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 864 place count 212 transition count 357
Iterating global reduction 6 with 1 rules applied. Total rules applied 865 place count 212 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 866 place count 212 transition count 356
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 885 place count 212 transition count 337
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 11 rules applied. Total rules applied 896 place count 212 transition count 326
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 907 place count 201 transition count 326
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 907 place count 201 transition count 325
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 909 place count 200 transition count 325
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 911 place count 199 transition count 324
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 913 place count 197 transition count 322
Applied a total of 913 rules in 59 ms. Remains 197 /652 variables (removed 455) and now considering 322/808 (removed 486) transitions.
// Phase 1: matrix 322 rows 197 cols
[2024-06-02 19:53:05] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:53:05] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 19:53:05] [INFO ] Invariant cache hit.
[2024-06-02 19:53:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:53:06] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2024-06-02 19:53:06] [INFO ] Redundant transitions in 6 ms returned []
Running 309 sub problems to find dead transitions.
[2024-06-02 19:53:06] [INFO ] Invariant cache hit.
[2024-06-02 19:53:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 321/518 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 1/519 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 0/519 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 202 constraints, problems are : Problem set: 0 solved, 309 unsolved in 11019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 321/518 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 309/510 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 1/519 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 0/519 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 519/519 variables, and 511 constraints, problems are : Problem set: 0 solved, 309 unsolved in 15753 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
After SMT, in 26893ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 26902ms
Starting structural reductions in SI_CTL mode, iteration 1 : 197/652 places, 322/808 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27459 ms. Remains : 197/652 places, 322/808 transitions.
[2024-06-02 19:53:33] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:53:33] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:53:33] [INFO ] Input system was already deterministic with 322 transitions.
[2024-06-02 19:53:33] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:53:33] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:53:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16322714752191978756.gal : 1 ms
[2024-06-02 19:53:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12352482624139517875.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/CTLFireability16322714752191978756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12352482624139517875.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 -...285
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.20932e+08,0.183059,9984,2,1265,5,25216,6,0,1096,24223,0
Converting to forward existential form...Done !
original formula: EF(EG((p1133==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p1133==1))] != FALSE
Hit Full ! (commute/partial/dont) 320/0/2
(forward)formula 0,1,0.688107,27472,1,0,9,144205,19,2,5261,39530,8
FORMULA CO4-PT-21-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 622 transition count 777
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 622 transition count 777
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 79 place count 603 transition count 758
Iterating global reduction 0 with 19 rules applied. Total rules applied 98 place count 603 transition count 758
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 107 place count 594 transition count 749
Iterating global reduction 0 with 9 rules applied. Total rules applied 116 place count 594 transition count 749
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 592 transition count 747
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 592 transition count 747
Applied a total of 120 rules in 65 ms. Remains 592 /652 variables (removed 60) and now considering 747/808 (removed 61) transitions.
// Phase 1: matrix 747 rows 592 cols
[2024-06-02 19:53:34] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 19:53:34] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 19:53:34] [INFO ] Invariant cache hit.
[2024-06-02 19:53:34] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 746 sub problems to find dead transitions.
[2024-06-02 19:53:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 3 (OVERLAPS) 747/1339 variables, 592/596 constraints. Problems are: Problem set: 0 solved, 746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1339/1339 variables, and 596 constraints, problems are : Problem set: 0 solved, 746 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 746/746 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 746 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 3 (OVERLAPS) 747/1339 variables, 592/596 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1339 variables, 746/1342 constraints. Problems are: Problem set: 0 solved, 746 unsolved
[2024-06-02 19:54:22] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1339/1339 variables, and 1343 constraints, problems are : Problem set: 0 solved, 746 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 746/746 constraints, Known Traps: 1/1 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 746 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in LTL mode, iteration 1 : 592/652 places, 747/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60653 ms. Remains : 592/652 places, 747/808 transitions.
[2024-06-02 19:54:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:54:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:54:34] [INFO ] Input system was already deterministic with 747 transitions.
[2024-06-02 19:54:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:54:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:54:34] [INFO ] Time to serialize gal into /tmp/CTLFireability11129050421089055515.gal : 3 ms
[2024-06-02 19:54:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7882596455485612129.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/CTLFireability11129050421089055515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7882596455485612129.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,9.68769e+10,3.02692,93904,2,11477,5,279054,6,0,3113,483445,0
Converting to forward existential form...Done !
original formula: (A((p1315!=1) U EG(!((AX((p1222==1)) + ((p751!=1)&&((p1109==1)||(p1129==1))))))) * !(E((p615==1) U E(EF(((p126==1)&&(p777==1))) U A(EX((p...181
=> equivalent forward existential formula: (([((FwdU(Init,!(EG(!((!(EX(!((p1222==1)))) + ((p751!=1)&&((p1109==1)||(p1129==1)))))))) * !((p1315!=1))) * !(EG...505
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t32, t34, t39, t48, t50, t51, t52, t53, t54, t57, t59, t62...545
Detected timeout of ITS tools.
[2024-06-02 19:55:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:55:04] [INFO ] Applying decomposition
[2024-06-02 19:55:04] [INFO ] Flatten gal took : 12 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/graph3007821337560738247.txt' '-o' '/tmp/graph3007821337560738247.bin' '-w' '/tmp/graph3007821337560738247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3007821337560738247.bin' '-l' '-1' '-v' '-w' '/tmp/graph3007821337560738247.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:55:04] [INFO ] Decomposing Gal with order
[2024-06-02 19:55:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:55:04] [INFO ] Removed a total of 231 redundant transitions.
[2024-06-02 19:55:04] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:55:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-06-02 19:55:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14101349927517683250.gal : 23 ms
[2024-06-02 19:55:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2664424258858570774.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/CTLFireability14101349927517683250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2664424258858570774.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,9.68769e+10,0.538625,19436,1050,109,27564,2022,1253,67160,93,8403,0
Converting to forward existential form...Done !
original formula: (A((i21.u224.p1315!=1) U EG(!((AX((i20.u216.p1222==1)) + ((i10.i0.i1.u106.p751!=1)&&((i17.u183.p1109==1)||(i16.i1.i0.u185.p1129==1)))))))...268
=> equivalent forward existential formula: (([((FwdU(Init,!(EG(!((!(EX(!((i20.u216.p1222==1)))) + ((i10.i0.i1.u106.p751!=1)&&((i17.u183.p1109==1)||(i16.i1....688
Reverse transition relation is NOT exact ! Due to transitions t62, t106, t279, t291, t311, t350, t396, t404, t405, t425, t438, t465, t506, t552, t583, t623...921
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 808/808 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 620 transition count 775
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 620 transition count 775
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 85 place count 599 transition count 754
Iterating global reduction 0 with 21 rules applied. Total rules applied 106 place count 599 transition count 754
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 599 transition count 753
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 118 place count 588 transition count 742
Iterating global reduction 1 with 11 rules applied. Total rules applied 129 place count 588 transition count 742
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 132 place count 585 transition count 739
Iterating global reduction 1 with 3 rules applied. Total rules applied 135 place count 585 transition count 739
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 136 place count 585 transition count 738
Applied a total of 136 rules in 52 ms. Remains 585 /652 variables (removed 67) and now considering 738/808 (removed 70) transitions.
// Phase 1: matrix 738 rows 585 cols
[2024-06-02 19:55:35] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:55:35] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-02 19:55:35] [INFO ] Invariant cache hit.
[2024-06-02 19:55:35] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 737 sub problems to find dead transitions.
[2024-06-02 19:55:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 3 (OVERLAPS) 738/1323 variables, 585/589 constraints. Problems are: Problem set: 0 solved, 737 unsolved
[2024-06-02 19:56:04] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2024-06-02 19:56:04] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 591 constraints, problems are : Problem set: 0 solved, 737 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 737/737 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 737 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 4 (OVERLAPS) 738/1323 variables, 585/591 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1323 variables, 737/1328 constraints. Problems are: Problem set: 0 solved, 737 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 1328 constraints, problems are : Problem set: 0 solved, 737 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 737/737 constraints, Known Traps: 2/2 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 737 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 585/652 places, 738/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60684 ms. Remains : 585/652 places, 738/808 transitions.
[2024-06-02 19:56:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:56:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:56:35] [INFO ] Input system was already deterministic with 738 transitions.
[2024-06-02 19:56:35] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:56:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:56:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14503401923953588812.gal : 17 ms
[2024-06-02 19:56:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7692430204848124647.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/CTLFireability14503401923953588812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7692430204848124647.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,8.77415e+10,2.9993,92552,2,11217,5,269012,6,0,3076,477067,0
Converting to forward existential form...Done !
original formula: A(AX(AG(!(EF(((p1273==1)&&(p1387==1)))))) U (p306==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p306==1))))) * !(E(!((p306==1)) U (!(!(EX(!(!(E(TRUE U !(!(E(TRUE U ((p1273==1)&&(p1387==1))))...191
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t32, t34, t39, t48, t50, t51, t52, t53, t54, t56, t59, t10...540
Detected timeout of ITS tools.
[2024-06-02 19:57:05] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:57:05] [INFO ] Applying decomposition
[2024-06-02 19:57:05] [INFO ] Flatten gal took : 12 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/graph7579712555052052110.txt' '-o' '/tmp/graph7579712555052052110.bin' '-w' '/tmp/graph7579712555052052110.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7579712555052052110.bin' '-l' '-1' '-v' '-w' '/tmp/graph7579712555052052110.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:57:05] [INFO ] Decomposing Gal with order
[2024-06-02 19:57:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:57:06] [INFO ] Removed a total of 222 redundant transitions.
[2024-06-02 19:57:06] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:57:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-06-02 19:57:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9320115275957633365.gal : 5 ms
[2024-06-02 19:57:06] [INFO ] Time to serialize properties into /tmp/CTLFireability3162237895422445473.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/CTLFireability9320115275957633365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3162237895422445473.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,8.77415e+10,0.470009,18772,1095,109,26310,2301,1300,61481,93,8706,0
Converting to forward existential form...Done !
original formula: A(AX(AG(!(EF(((i20.i1.i2.u206.p1273==1)&&(i21.u215.p1387==1)))))) U (i2.u35.p306==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i2.u35.p306==1))))) * !(E(!((i2.u35.p306==1)) U (!(!(EX(!(!(E(TRUE U !(!(E(TRUE U ((i20.i1.i2....236
Reverse transition relation is NOT exact ! Due to transitions t59, t103, t187, t272, t284, t304, t343, t377, t389, t398, t497, t531, t545, t554, t556, t576...853
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
[2024-06-02 19:57:36] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:57:36] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:57:36] [INFO ] Applying decomposition
[2024-06-02 19:57:36] [INFO ] Flatten gal took : 12 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/graph6585157831337321152.txt' '-o' '/tmp/graph6585157831337321152.bin' '-w' '/tmp/graph6585157831337321152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6585157831337321152.bin' '-l' '-1' '-v' '-w' '/tmp/graph6585157831337321152.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:57:36] [INFO ] Decomposing Gal with order
[2024-06-02 19:57:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:57:36] [INFO ] Removed a total of 238 redundant transitions.
[2024-06-02 19:57:36] [INFO ] Flatten gal took : 27 ms
[2024-06-02 19:57:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-06-02 19:57:36] [INFO ] Time to serialize gal into /tmp/CTLFireability9275471649453839493.gal : 20 ms
[2024-06-02 19:57:36] [INFO ] Time to serialize properties into /tmp/CTLFireability15610883017002689580.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/CTLFireability9275471649453839493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15610883017002689580.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 8 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.62412e+11,0.633984,29604,1646,103,49865,1469,1442,104091,100,5457,0
Converting to forward existential form...Done !
original formula: EG((AF(EX(TRUE)) + EX((((i4.i3.i1.u71.p425==1)&&(i12.u168.p968==1)) + EX((i6.i1.i1.u121.p758==0))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EX(TRUE)))) + EX((((i4.i3.i1.u71.p425==1)&&(i12.u168.p968==1)) + EX((i6.i1.i1.u121.p758==0)))...168
Reverse transition relation is NOT exact ! Due to transitions t58, t72, t125, t131, t214, t215, t262, t304, t327, t330, t336, t377, t434, t456, t469, t541,...1162
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
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
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
(forward)formula 0,1,318.825,2763744,1,0,3.53634e+06,3958,2989,2.46868e+07,195,20862,218731
FORMULA CO4-PT-21-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AF(((i6.i2.i3.u137.p835==0) * AX((i1.u10.p203==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((i6.i2.i3.u137.p835==0) * !(EX(!((i1.u10.p203==1)))))))] = FALSE
(forward)formula 1,0,319.056,2763744,1,0,3.53634e+06,3958,3651,2.46868e+07,215,20862,251596
FORMULA CO4-PT-21-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX(((E((EG(A((i0.i0.i0.u22.p191==1) U (i10.i1.i0.u110.p713==1))) + !(EX((i3.u39.p299==1)))) U (i7.u105.p696==1)) + EG(AX(EF((i6.i0.i1.u85...206
=> equivalent forward existential formula: [FwdG((EY(Init) * !((E((EG(!((E(!((i10.i1.i0.u110.p713==1)) U (!((i0.i0.i0.u22.p191==1)) * !((i10.i1.i0.u110.p71...343
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 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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
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
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
Using saturation style SCC detection
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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 2,1,805.462,3871400,1,0,3.53634e+06,7180,3591,3.85114e+07,211,42764,1259029
FORMULA CO4-PT-21-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (AX((((i4.i0.i1.u65.p393==1)&&(i12.u240.p1285==1)) + ((EX((i14.i1.i0.u174.p998==1)) * EG((i14.i0.i1.u171.p991==1))) * ((i0.i0.i1.u53.p348...250
=> equivalent forward existential formula: ((([((EY(Init) * !(((i4.i0.i1.u65.p393==1)&&(i12.u240.p1285==1)))) * !(EX((i14.i1.i0.u174.p998==1))))] = FALSE *...564
(forward)formula 3,0,914.385,4274264,1,0,3.75525e+06,7180,5573,4.00951e+07,297,42764,1169789
FORMULA CO4-PT-21-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF(EG(A(AX((((i10.i1.i0.u75.p549==1)&&(i19.i1.i0.u235.p1258==1))&&(i20.u251.p1387==1))) U (E((i12.u157.p905==1) U (i12.u153.p903==1)) * (...223
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((E(!((E((i12.u157.p905==1) U (i12.u153.p903==1)) * ((i0.i0.i1.u20.p185!=1)||((i20.u245.p1336==...527
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
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 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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 4,0,1481.02,5277252,1,0,5.19268e+06,8480,2989,5.41151e+07,195,50429,1624713
FORMULA CO4-PT-21-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2024-06-02 20:24:07] [INFO ] Applying decomposition
[2024-06-02 20:24:07] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:24:07] [INFO ] Decomposing Gal with order
[2024-06-02 20:24:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:24:07] [INFO ] Removed a total of 91 redundant transitions.
[2024-06-02 20:24:07] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:24:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 312 labels/synchronizations in 6 ms.
[2024-06-02 20:24:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14480819766622514654.gal : 4 ms
[2024-06-02 20:24:07] [INFO ] Time to serialize properties into /tmp/CTLFireability16907103140481893617.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/CTLFireability14480819766622514654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16907103140481893617.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 3 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.62412e+11,1.25018,43296,296,3530,4763,102427,246,13366,1743,405978,0
Converting to forward existential form...Done !
original formula: E((((i0.i0.i0.i0.i0.u7.p319==1) + !(AG((i0.i0.i1.u11.p1229!=1)))) * (EX((i0.i0.i1.u12.p1295==1)) + !((!(AG((i0.i0.i0.i0.i0.u8.p796==1))) ...498
=> equivalent forward existential formula: [(((((FwdU(Init,(((i0.i0.i0.i0.i0.u7.p319==1) + !(!(E(TRUE U !((i0.i0.i1.u11.p1229!=1)))))) * (EX((i0.i0.i1.u12....586
Reverse transition relation is NOT exact ! Due to transitions i0.t707, i0.t693, i0.t58, i0.t42, i0.u13.t36, i0.u13.t39, i0.u13.t47, i0.u13.t56, i0.u13.t59,...1692
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
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="CO4-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 CO4-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 r550-tall-171734898700162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-21.tgz
mv CO4-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 ;