About the Execution of ITS-Tools for Peterson-PT-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2766.168 | 1116730.00 | 1215941.00 | 3845.00 | FTTFTFFFFTTFTTFF | 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.r268-smll-171654407200258.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 Peterson-PT-3, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407200258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K May 18 16:43 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 Peterson-PT-3-CTLFireability-2024-00
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-01
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-02
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-03
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-04
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-05
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-06
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-07
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-08
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-09
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-10
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-11
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-12
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-13
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-14
FORMULA_NAME Peterson-PT-3-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716762369959
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-26 22:26:12] [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-05-26 22:26:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:26:13] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-05-26 22:26:13] [INFO ] Transformed 244 places.
[2024-05-26 22:26:13] [INFO ] Transformed 332 transitions.
[2024-05-26 22:26:13] [INFO ] Found NUPN structural information;
[2024-05-26 22:26:13] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 494 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 45 ms.
Support contains 244 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 29 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 22:26:13] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 22:26:13] [INFO ] Computed 15 invariants in 27 ms
[2024-05-26 22:26:13] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-26 22:26:13] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:26:13] [INFO ] Invariant cache hit.
[2024-05-26 22:26:14] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 22:26:14] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 22:26:14] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:26:14] [INFO ] Invariant cache hit.
[2024-05-26 22:26:14] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:26:17] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 17 ms to minimize.
[2024-05-26 22:26:18] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 6 ms to minimize.
[2024-05-26 22:26:18] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-26 22:26:18] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 2 ms to minimize.
[2024-05-26 22:26:19] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
[2024-05-26 22:26:19] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:26:25] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:26:28] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:26:37] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 4 ms to minimize.
[2024-05-26 22:26:37] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 3 ms to minimize.
[2024-05-26 22:26:37] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 3 ms to minimize.
[2024-05-26 22:26:37] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 3 ms to minimize.
[2024-05-26 22:26:37] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 5 ms to minimize.
[2024-05-26 22:26:38] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 3 ms to minimize.
[2024-05-26 22:26:38] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 3 ms to minimize.
[2024-05-26 22:26:38] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-05-26 22:26:38] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 3 ms to minimize.
[2024-05-26 22:26:38] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 3 ms to minimize.
[2024-05-26 22:26:38] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 4 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 4 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 4 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 3 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 6 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 3 ms to minimize.
[2024-05-26 22:26:40] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 4 ms to minimize.
[2024-05-26 22:26:40] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 4 ms to minimize.
[2024-05-26 22:26:40] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:26:41] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 4 ms to minimize.
[2024-05-26 22:26:41] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 4 ms to minimize.
[2024-05-26 22:26:41] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 3 ms to minimize.
[2024-05-26 22:26:42] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 3 ms to minimize.
[2024-05-26 22:26:42] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-26 22:26:42] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 4 ms to minimize.
[2024-05-26 22:26:42] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 3 ms to minimize.
[2024-05-26 22:26:42] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 2 ms to minimize.
[2024-05-26 22:26:42] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-26 22:26:42] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 3 ms to minimize.
[2024-05-26 22:26:43] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 3 ms to minimize.
[2024-05-26 22:26:43] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 4 ms to minimize.
[2024-05-26 22:26:43] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
[2024-05-26 22:26:43] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 3 ms to minimize.
[2024-05-26 22:26:43] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 3 ms to minimize.
[2024-05-26 22:26:44] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 3 ms to minimize.
[2024-05-26 22:26:44] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 3 ms to minimize.
[2024-05-26 22:26:44] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 3 ms to minimize.
SMT process timed out in 30236ms, After SMT, problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 30269ms
Finished structural reductions in LTL mode , in 1 iterations and 31233 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 244 out of 244 places after structural reductions.
[2024-05-26 22:26:45] [INFO ] Flatten gal took : 99 ms
[2024-05-26 22:26:45] [INFO ] Flatten gal took : 72 ms
[2024-05-26 22:26:45] [INFO ] Input system was already deterministic with 332 transitions.
Reduction of identical properties reduced properties to check from 59 to 55
RANDOM walk for 40000 steps (8 resets) in 3055 ms. (13 steps per ms) remains 14/55 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 13/13 properties
[2024-05-26 22:26:47] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:26:47] [INFO ] Invariant cache hit.
[2024-05-26 22:26:47] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 208/241 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 208/252 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/242 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-26 22:26:47] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-05-26 22:26:48] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 4 ms to minimize.
[2024-05-26 22:26:48] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 4 ms to minimize.
[2024-05-26 22:26:48] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 3 ms to minimize.
[2024-05-26 22:26:48] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 5 ms to minimize.
[2024-05-26 22:26:48] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 4 ms to minimize.
[2024-05-26 22:26:49] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 3 ms to minimize.
[2024-05-26 22:26:49] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 4 ms to minimize.
[2024-05-26 22:26:49] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 4 ms to minimize.
[2024-05-26 22:26:49] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 4 ms to minimize.
[2024-05-26 22:26:49] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 19 ms to minimize.
[2024-05-26 22:26:49] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
[2024-05-26 22:26:50] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-05-26 22:26:50] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-26 22:26:50] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 3 ms to minimize.
[2024-05-26 22:26:50] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-05-26 22:26:50] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 17/272 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-26 22:26:50] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-26 22:26:50] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
[2024-05-26 22:26:50] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 3 ms to minimize.
[2024-05-26 22:26:51] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-26 22:26:51] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-26 22:26:51] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-26 22:26:51] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
[2024-05-26 22:26:51] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-26 22:26:51] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-26 22:26:51] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 3 ms to minimize.
[2024-05-26 22:26:52] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-26 22:26:52] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 4 ms to minimize.
SMT process timed out in 5064ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 244 transition count 257
Reduce places removed 75 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 80 rules applied. Total rules applied 155 place count 169 transition count 252
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 160 place count 164 transition count 252
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 160 place count 164 transition count 209
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 246 place count 121 transition count 209
Applied a total of 246 rules in 81 ms. Remains 121 /244 variables (removed 123) and now considering 209/332 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 121/244 places, 209/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 654 ms. (61 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 9/9 properties
[2024-05-26 22:26:53] [INFO ] Flow matrix only has 185 transitions (discarded 24 similar events)
// Phase 1: matrix 185 rows 121 cols
[2024-05-26 22:26:53] [INFO ] Computed 15 invariants in 4 ms
[2024-05-26 22:26:53] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 88/116 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 88/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2/118 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 3/121 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 185/306 variables, 121/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 57/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 314 constraints, problems are : Problem set: 0 solved, 9 unsolved in 522 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 121/121 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 88/116 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 88/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/118 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 3/121 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-26 22:26:54] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-26 22:26:55] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-05-26 22:26:55] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-26 22:26:55] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-05-26 22:26:55] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-26 22:26:55] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-26 22:26:55] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-26 22:26:55] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-05-26 22:26:55] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-26 22:26:55] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-26 22:26:55] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-26 22:26:55] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-26 22:26:55] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-26 22:26:56] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-26 22:26:56] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
Problem AtomicPropp52 is UNSAT
[2024-05-26 22:26:56] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 6/167 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-26 22:26:56] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-26 22:26:56] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-26 22:26:56] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-26 22:26:56] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-26 22:26:56] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-26 22:26:56] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/121 variables, 6/173 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-26 22:26:56] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-26 22:26:56] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/121 variables, 2/175 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-26 22:26:57] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-26 22:26:57] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 2/177 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-26 22:26:57] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/121 variables, 1/178 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-26 22:26:57] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-05-26 22:26:57] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/121 variables, 2/180 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/121 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 185/306 variables, 121/301 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 57/358 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 8/366 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-26 22:26:57] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-05-26 22:26:58] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-26 22:26:58] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 3 ms to minimize.
[2024-05-26 22:26:58] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/306 variables, 4/370 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-26 22:26:58] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-26 22:26:58] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/306 variables, 2/372 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/306 variables, 0/372 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-26 22:26:59] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/306 variables, 1/373 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-26 22:26:59] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/306 variables, 1/374 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-26 22:27:00] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/306 variables, 1/375 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/306 variables, 0/375 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 0/306 variables, 0/375 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 375 constraints, problems are : Problem set: 1 solved, 8 unsolved in 7109 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 121/121 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 53/53 constraints]
After SMT, in 7655ms problems are : Problem set: 1 solved, 8 unsolved
Parikh walk visited 1 properties in 2334 ms.
Support contains 11 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 209/209 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 121 transition count 204
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 116 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 115 transition count 203
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 115 transition count 199
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 20 place count 111 transition count 199
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 40 place count 101 transition count 189
Applied a total of 40 rules in 27 ms. Remains 101 /121 variables (removed 20) and now considering 189/209 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 101/121 places, 189/209 transitions.
RANDOM walk for 40000 steps (8 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
Probably explored full state space saw : 87953 states, properties seen :6
Probabilistic random walk after 439765 steps, saw 87953 distinct states, run finished after 1300 ms. (steps per millisecond=338 ) properties seen :6
Explored full state space saw : 87954 states, properties seen :0
Exhaustive walk after 439770 steps, saw 87954 distinct states, run finished after 659 ms. (steps per millisecond=667 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA Peterson-PT-3-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 22:27:05] [INFO ] Flatten gal took : 23 ms
[2024-05-26 22:27:05] [INFO ] Flatten gal took : 28 ms
[2024-05-26 22:27:05] [INFO ] Input system was already deterministic with 332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 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 0 with 1 rules applied. Total rules applied 1 place count 244 transition count 331
Reduce places removed 1 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 13 rules applied. Total rules applied 14 place count 243 transition count 319
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 26 place count 231 transition count 319
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 228 transition count 316
Applied a total of 32 rules in 25 ms. Remains 228 /244 variables (removed 16) and now considering 316/332 (removed 16) transitions.
[2024-05-26 22:27:05] [INFO ] Flow matrix only has 292 transitions (discarded 24 similar events)
// Phase 1: matrix 292 rows 228 cols
[2024-05-26 22:27:05] [INFO ] Computed 15 invariants in 4 ms
[2024-05-26 22:27:05] [INFO ] Implicit Places using invariants in 97 ms returned [214, 215, 216, 217]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 224/244 places, 316/332 transitions.
Applied a total of 0 rules in 13 ms. Remains 224 /224 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 142 ms. Remains : 224/244 places, 316/332 transitions.
[2024-05-26 22:27:05] [INFO ] Flatten gal took : 19 ms
[2024-05-26 22:27:05] [INFO ] Flatten gal took : 21 ms
[2024-05-26 22:27:05] [INFO ] Input system was already deterministic with 316 transitions.
[2024-05-26 22:27:05] [INFO ] Flatten gal took : 17 ms
[2024-05-26 22:27:05] [INFO ] Flatten gal took : 17 ms
[2024-05-26 22:27:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15388090437063057593.gal : 22 ms
[2024-05-26 22:27:06] [INFO ] Time to serialize properties into /tmp/CTLFireability10715623421041501407.ctl : 9 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/CTLFireability15388090437063057593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10715623421041501407.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,2.73907e+06,18.1915,400544,2,70401,5,1.06706e+06,6,0,1215,1.71748e+06,0
Converting to forward existential form...Done !
original formula: !(E((AF(((EF((((((((BeginLoop_1_0_0==1)||(BeginLoop_0_2_0==1))||((BeginLoop_3_0_0==1)||(BeginLoop_2_0_0==1)))||(((BeginLoop_1_0_1==1)||(B...8627
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!(((E(TRUE U (((((((BeginLoop_1_0_0==1)||(BeginLoop_0_2_0==1))||((BeginLoop_3_0_0==1)||(BeginL...7756
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-26 22:27:36] [INFO ] Flatten gal took : 15 ms
[2024-05-26 22:27:36] [INFO ] Applying decomposition
[2024-05-26 22:27:36] [INFO ] Flatten gal took : 15 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/graph14002129998691122759.txt' '-o' '/tmp/graph14002129998691122759.bin' '-w' '/tmp/graph14002129998691122759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14002129998691122759.bin' '-l' '-1' '-v' '-w' '/tmp/graph14002129998691122759.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:27:36] [INFO ] Decomposing Gal with order
[2024-05-26 22:27:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:27:36] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-26 22:27:36] [INFO ] Flatten gal took : 171 ms
[2024-05-26 22:27:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 31 ms.
[2024-05-26 22:27:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12169782215852220465.gal : 10 ms
[2024-05-26 22:27:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12135618673090938493.ctl : 7 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/CTLFireability12169782215852220465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12135618673090938493.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,2.73907e+06,10.8836,267236,2381,185,407694,5216,786,1.63978e+06,100,40345,0
Converting to forward existential form...Done !
original formula: !(E((AF(((EF((((((((i13.u25.BeginLoop_1_0_0==1)||(i8.i1.u3.BeginLoop_0_2_0==1))||((i13.u56.BeginLoop_3_0_0==1)||(i13.u57.BeginLoop_2_0_0=...12093
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!(((E(TRUE U (((((((i13.u25.BeginLoop_1_0_0==1)||(i8.i1.u3.BeginLoop_0_2_0==1))||((i13.u56.Beg...12690
Reverse transition relation is NOT exact ! Due to transitions t12, t52, t53, t54, t58, t125, t126, t127, t128, t129, t130, t131, t132, t133, t134, t135, t1...786
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 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
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 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
Using saturation style SCC detection
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
(forward)formula 0,0,18.4678,271316,1,0,407694,5959,5714,1.89896e+06,614,40345,977456
FORMULA Peterson-PT-3-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 244 transition count 329
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 241 transition count 329
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 6 place count 241 transition count 321
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 233 transition count 321
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 224 transition count 312
Applied a total of 40 rules in 31 ms. Remains 224 /244 variables (removed 20) and now considering 312/332 (removed 20) transitions.
[2024-05-26 22:27:55] [INFO ] Flow matrix only has 288 transitions (discarded 24 similar events)
// Phase 1: matrix 288 rows 224 cols
[2024-05-26 22:27:55] [INFO ] Computed 15 invariants in 3 ms
[2024-05-26 22:27:55] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-26 22:27:55] [INFO ] Flow matrix only has 288 transitions (discarded 24 similar events)
[2024-05-26 22:27:55] [INFO ] Invariant cache hit.
[2024-05-26 22:27:55] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 22:27:55] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2024-05-26 22:27:55] [INFO ] Redundant transitions in 33 ms returned []
Running 308 sub problems to find dead transitions.
[2024-05-26 22:27:55] [INFO ] Flow matrix only has 288 transitions (discarded 24 similar events)
[2024-05-26 22:27:55] [INFO ] Invariant cache hit.
[2024-05-26 22:27:55] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 4/224 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-05-26 22:28:06] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 5 ms to minimize.
[2024-05-26 22:28:06] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 4 ms to minimize.
[2024-05-26 22:28:06] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 3 ms to minimize.
[2024-05-26 22:28:06] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 4 ms to minimize.
[2024-05-26 22:28:06] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2024-05-26 22:28:07] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-05-26 22:28:07] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-05-26 22:28:07] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-05-26 22:28:07] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
[2024-05-26 22:28:07] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-26 22:28:07] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2024-05-26 22:28:07] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-26 22:28:07] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-26 22:28:07] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 3 ms to minimize.
[2024-05-26 22:28:08] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 3 ms to minimize.
[2024-05-26 22:28:08] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-26 22:28:08] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-26 22:28:08] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-05-26 22:28:08] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 3 ms to minimize.
[2024-05-26 22:28:08] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-05-26 22:28:09] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-26 22:28:09] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 3 ms to minimize.
[2024-05-26 22:28:09] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 3 ms to minimize.
[2024-05-26 22:28:09] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-26 22:28:09] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-26 22:28:09] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2024-05-26 22:28:09] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 2 ms to minimize.
[2024-05-26 22:28:09] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 3 ms to minimize.
[2024-05-26 22:28:09] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-26 22:28:10] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-26 22:28:10] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-05-26 22:28:10] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
[2024-05-26 22:28:10] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 3 ms to minimize.
[2024-05-26 22:28:10] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-05-26 22:28:10] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-05-26 22:28:11] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-05-26 22:28:11] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-05-26 22:28:11] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 3 ms to minimize.
[2024-05-26 22:28:11] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2024-05-26 22:28:11] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-05-26 22:28:12] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-26 22:28:12] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 3 ms to minimize.
[2024-05-26 22:28:12] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-05-26 22:28:13] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-05-26 22:28:13] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2024-05-26 22:28:13] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2024-05-26 22:28:13] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-05-26 22:28:13] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2024-05-26 22:28:14] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
[2024-05-26 22:28:14] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 4 ms to minimize.
[2024-05-26 22:28:15] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 3 ms to minimize.
[2024-05-26 22:28:15] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 12/291 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-05-26 22:28:20] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 2 ms to minimize.
[2024-05-26 22:28:21] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-05-26 22:28:25] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 224/512 variables, and 294 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30046 ms.
Refiners :[Domain max(s): 224/224 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/224 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 51/276 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (OVERLAPS) 4/224 variables, 7/283 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-05-26 22:28:33] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-05-26 22:28:36] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 3 ms to minimize.
[2024-05-26 22:28:37] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 4 ms to minimize.
[2024-05-26 22:28:39] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 12 (OVERLAPS) 288/512 variables, 224/522 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 57/579 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 308/887 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 887 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30013 ms.
Refiners :[Domain max(s): 224/224 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 224/224 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 59/59 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in SI_CTL mode, iteration 1 : 224/244 places, 312/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60787 ms. Remains : 224/244 places, 312/332 transitions.
[2024-05-26 22:28:56] [INFO ] Flatten gal took : 14 ms
[2024-05-26 22:28:56] [INFO ] Flatten gal took : 16 ms
[2024-05-26 22:28:56] [INFO ] Input system was already deterministic with 312 transitions.
[2024-05-26 22:28:56] [INFO ] Flatten gal took : 14 ms
[2024-05-26 22:28:56] [INFO ] Flatten gal took : 13 ms
[2024-05-26 22:28:56] [INFO ] Time to serialize gal into /tmp/CTLFireability9291430854527383245.gal : 3 ms
[2024-05-26 22:28:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16114314336958845873.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/CTLFireability9291430854527383245.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16114314336958845873.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.7191e+06,15.0133,356620,2,62944,5,944784,6,0,1211,1.46295e+06,0
Converting to forward existential form...Done !
original formula: (A(!(((AG((((((TestIdentity_1_2_1==1)||(TestIdentity_2_2_2==1))||((TestIdentity_0_2_0==1)||(TestIdentity_3_0_3==1)))||(((TestIdentity_3_2...3881
=> equivalent forward existential formula: ([((Init * !(EG(!(((((WantSection_3_T==1)&&(CS_3==1))||((WantSection_0_T==1)&&(CS_0==1)))||(((WantSection_1_T==1...4310
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-26 22:29:26] [INFO ] Flatten gal took : 21 ms
[2024-05-26 22:29:26] [INFO ] Applying decomposition
[2024-05-26 22:29:26] [INFO ] Flatten gal took : 19 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/graph5551217928861215736.txt' '-o' '/tmp/graph5551217928861215736.bin' '-w' '/tmp/graph5551217928861215736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5551217928861215736.bin' '-l' '-1' '-v' '-w' '/tmp/graph5551217928861215736.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:29:26] [INFO ] Decomposing Gal with order
[2024-05-26 22:29:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:29:26] [INFO ] Removed a total of 196 redundant transitions.
[2024-05-26 22:29:26] [INFO ] Flatten gal took : 45 ms
[2024-05-26 22:29:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 12 ms.
[2024-05-26 22:29:26] [INFO ] Time to serialize gal into /tmp/CTLFireability18054546414436503373.gal : 10 ms
[2024-05-26 22:29:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3230728068868757449.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18054546414436503373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3230728068868757449.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.7191e+06,9.35374,203272,2661,765,225784,12474,735,1.38646e+06,151,120590,0
Converting to forward existential form...Done !
original formula: (A(!(((AG((((((i11.i0.u14.TestIdentity_1_2_1==1)||(i3.i0.u7.TestIdentity_2_2_2==1))||((i0.i0.u29.TestIdentity_0_2_0==1)||(i13.u12.TestIde...5188
=> equivalent forward existential formula: ([((Init * !(EG(!(((((i9.u34.WantSection_3_T==1)&&(i10.u8.CS_3==1))||((i10.u8.WantSection_0_T==1)&&(i10.u33.CS_0...5748
Reverse transition relation is NOT exact ! Due to transitions t16, t50, t51, t52, t109, t110, t111, t112, t113, t114, t115, t116, t117, t118, t119, t120, t...744
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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,19.0361,330332,1,0,328579,23101,4525,2.55335e+06,824,142487,1062792
FORMULA Peterson-PT-3-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 15 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 22:29:45] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 22:29:45] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 22:29:45] [INFO ] Implicit Places using invariants in 100 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 116 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 240/244 places, 332/332 transitions.
[2024-05-26 22:29:45] [INFO ] Flatten gal took : 12 ms
[2024-05-26 22:29:45] [INFO ] Flatten gal took : 13 ms
[2024-05-26 22:29:45] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-26 22:29:45] [INFO ] Flatten gal took : 13 ms
[2024-05-26 22:29:45] [INFO ] Flatten gal took : 11 ms
[2024-05-26 22:29:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4720518815625407939.gal : 2 ms
[2024-05-26 22:29:45] [INFO ] Time to serialize properties into /tmp/CTLFireability4176077041127026287.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/CTLFireability4720518815625407939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4176077041127026287.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,3.40795e+06,19.1877,388688,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
original formula: AG(EX((EF(((((((((WantSection_1_T==0)||(TestAlone_2_0_1==0))&&((WantSection_1_T==0)||(TestAlone_0_1_1==0)))&&(((WantSection_1_T==0)||(Tes...6920
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((E(TRUE U ((((((((WantSection_1_T==0)||(TestAlone_2_0_1==0))&&((WantSection_1_T==0)||(T...5367
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-26 22:30:15] [INFO ] Flatten gal took : 10 ms
[2024-05-26 22:30:15] [INFO ] Applying decomposition
[2024-05-26 22:30:15] [INFO ] Flatten gal took : 9 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/graph6843679688608007700.txt' '-o' '/tmp/graph6843679688608007700.bin' '-w' '/tmp/graph6843679688608007700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6843679688608007700.bin' '-l' '-1' '-v' '-w' '/tmp/graph6843679688608007700.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:30:15] [INFO ] Decomposing Gal with order
[2024-05-26 22:30:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:30:16] [INFO ] Removed a total of 214 redundant transitions.
[2024-05-26 22:30:16] [INFO ] Flatten gal took : 42 ms
[2024-05-26 22:30:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 6 ms.
[2024-05-26 22:30:16] [INFO ] Time to serialize gal into /tmp/CTLFireability15003686393759765545.gal : 8 ms
[2024-05-26 22:30:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13115534192781100346.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/CTLFireability15003686393759765545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13115534192781100346.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,3.40795e+06,7.48746,157472,3425,146,216654,5425,693,917478,81,33425,0
Converting to forward existential form...Done !
original formula: AG(EX((EF(((((((((i1.i0.u46.WantSection_1_T==0)||(i2.i0.u71.TestAlone_2_0_1==0))&&((i1.i0.u46.WantSection_1_T==0)||(i4.i1.u28.TestAlone_0...9616
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((E(TRUE U ((((((((i1.i0.u46.WantSection_1_T==0)||(i2.i0.u71.TestAlone_2_0_1==0))&&((i1....9682
Reverse transition relation is NOT exact ! Due to transitions t24, t64, t65, t66, t67, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t15...880
(forward)formula 0,1,14.9353,230600,1,0,318190,5425,4866,1.30516e+06,449,33425,1118097
FORMULA Peterson-PT-3-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 22:30:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:30:31] [INFO ] Invariant cache hit.
[2024-05-26 22:30:31] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-26 22:30:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:30:31] [INFO ] Invariant cache hit.
[2024-05-26 22:30:31] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 22:30:31] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 22:30:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:30:31] [INFO ] Invariant cache hit.
[2024-05-26 22:30:31] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:30:34] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-26 22:30:35] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-05-26 22:30:35] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-26 22:30:35] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 2 ms to minimize.
[2024-05-26 22:30:37] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 3 ms to minimize.
[2024-05-26 22:30:37] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:30:43] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:30:46] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:30:54] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 3 ms to minimize.
[2024-05-26 22:30:54] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 3 ms to minimize.
[2024-05-26 22:30:54] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 3 ms to minimize.
[2024-05-26 22:30:54] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-26 22:30:55] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 3 ms to minimize.
[2024-05-26 22:30:55] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 3 ms to minimize.
[2024-05-26 22:30:55] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 4 ms to minimize.
[2024-05-26 22:30:55] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 4 ms to minimize.
[2024-05-26 22:30:55] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 2 ms to minimize.
[2024-05-26 22:30:55] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 3 ms to minimize.
[2024-05-26 22:30:56] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 4 ms to minimize.
[2024-05-26 22:30:56] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 4 ms to minimize.
[2024-05-26 22:30:56] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 4 ms to minimize.
[2024-05-26 22:30:56] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 3 ms to minimize.
[2024-05-26 22:30:56] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-26 22:30:56] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 3 ms to minimize.
[2024-05-26 22:30:57] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-26 22:30:57] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 4 ms to minimize.
[2024-05-26 22:30:57] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 3 ms to minimize.
[2024-05-26 22:30:57] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:30:58] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 4 ms to minimize.
[2024-05-26 22:30:58] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 3 ms to minimize.
[2024-05-26 22:30:58] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 3 ms to minimize.
[2024-05-26 22:30:59] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 3 ms to minimize.
[2024-05-26 22:30:59] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 3 ms to minimize.
[2024-05-26 22:30:59] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-05-26 22:30:59] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-26 22:30:59] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
[2024-05-26 22:30:59] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 3 ms to minimize.
[2024-05-26 22:31:00] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2024-05-26 22:31:00] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 3 ms to minimize.
[2024-05-26 22:31:00] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 3 ms to minimize.
[2024-05-26 22:31:00] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 3 ms to minimize.
[2024-05-26 22:31:00] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2024-05-26 22:31:00] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 5 ms to minimize.
[2024-05-26 22:31:01] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2024-05-26 22:31:01] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 3 ms to minimize.
[2024-05-26 22:31:01] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 3 ms to minimize.
SMT process timed out in 30187ms, After SMT, problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 30191ms
Finished structural reductions in LTL mode , in 1 iterations and 30528 ms. Remains : 244/244 places, 332/332 transitions.
[2024-05-26 22:31:01] [INFO ] Flatten gal took : 16 ms
[2024-05-26 22:31:01] [INFO ] Flatten gal took : 26 ms
[2024-05-26 22:31:01] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-26 22:31:01] [INFO ] Flatten gal took : 17 ms
[2024-05-26 22:31:01] [INFO ] Flatten gal took : 18 ms
[2024-05-26 22:31:01] [INFO ] Time to serialize gal into /tmp/CTLFireability10099364399379918126.gal : 4 ms
[2024-05-26 22:31:01] [INFO ] Time to serialize properties into /tmp/CTLFireability16714090739410080365.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10099364399379918126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16714090739410080365.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,3.40795e+06,20.5617,420600,2,73296,5,1.12801e+06,6,0,1311,1.8281e+06,0
Converting to forward existential form...Done !
original formula: AF(E(AG(A(EX(((((WantSection_3_F==1)&&(Idle_3==1))||((WantSection_2_F==1)&&(Idle_2==1)))||(((WantSection_1_F==1)&&(Idle_1==1))||((WantSec...5425
=> equivalent forward existential formula: [FwdG(Init,!(E(!(E(TRUE U !(!((E(!(((((((((WantSection_2_F==1)&&(TestAlone_3_1_2==1))||((WantSection_2_F==1)&&(T...6862
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-26 22:31:31] [INFO ] Flatten gal took : 11 ms
[2024-05-26 22:31:31] [INFO ] Applying decomposition
[2024-05-26 22:31:31] [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/graph1646746647611383807.txt' '-o' '/tmp/graph1646746647611383807.bin' '-w' '/tmp/graph1646746647611383807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1646746647611383807.bin' '-l' '-1' '-v' '-w' '/tmp/graph1646746647611383807.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:31:31] [INFO ] Decomposing Gal with order
[2024-05-26 22:31:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:31:31] [INFO ] Removed a total of 222 redundant transitions.
[2024-05-26 22:31:31] [INFO ] Flatten gal took : 22 ms
[2024-05-26 22:31:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 22:31:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15841658777703633489.gal : 5 ms
[2024-05-26 22:31:32] [INFO ] Time to serialize properties into /tmp/CTLFireability13280683080597251574.ctl : 53 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/CTLFireability15841658777703633489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13280683080597251574.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,3.40795e+06,5.11823,110120,3149,89,149354,4436,727,610429,69,23178,0
Converting to forward existential form...Done !
original formula: AF(E(AG(A(EX(((((i11.u22.WantSection_3_F==1)&&(i11.u22.Idle_3==1))||((i6.i0.u23.WantSection_2_F==1)&&(i6.i0.u23.Idle_2==1)))||(((i3.i0.u2...7445
=> equivalent forward existential formula: [FwdG(Init,!(E(!(E(TRUE U !(!((E(!(((((((((i6.i0.u23.WantSection_2_F==1)&&(i13.u54.TestAlone_3_1_2==1))||((i6.i0...12283
Reverse transition relation is NOT exact ! Due to transitions t24, t36, t37, t64, t65, t66, t67, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149,...879
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 22:32:02] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:32:02] [INFO ] Invariant cache hit.
[2024-05-26 22:32:02] [INFO ] Implicit Places using invariants in 104 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 116 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 240/244 places, 332/332 transitions.
[2024-05-26 22:32:02] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:32:02] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:32:02] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-26 22:32:02] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:32:02] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:32:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8469106987815151192.gal : 2 ms
[2024-05-26 22:32:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13255543741440741997.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/CTLFireability8469106987815151192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13255543741440741997.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40795e+06,17.883,388908,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
original formula: AG(!(A((!(EX(((((WantSection_3_T==1)&&(CS_3==1))||((WantSection_0_T==1)&&(CS_0==1)))||(((WantSection_1_T==1)&&(CS_1==1))||((WantSection_2...5647
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !((((((((((((((((TestIdentity_0_0_3==1)||(TestIdentity_1_2_2==1))||((Test...10736
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-26 22:32:32] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:32:32] [INFO ] Applying decomposition
[2024-05-26 22:32:32] [INFO ] Flatten gal took : 8 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/graph9008544085633818165.txt' '-o' '/tmp/graph9008544085633818165.bin' '-w' '/tmp/graph9008544085633818165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9008544085633818165.bin' '-l' '-1' '-v' '-w' '/tmp/graph9008544085633818165.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:32:32] [INFO ] Decomposing Gal with order
[2024-05-26 22:32:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:32:32] [INFO ] Removed a total of 216 redundant transitions.
[2024-05-26 22:32:32] [INFO ] Flatten gal took : 28 ms
[2024-05-26 22:32:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2024-05-26 22:32:32] [INFO ] Time to serialize gal into /tmp/CTLFireability600031751530263745.gal : 5 ms
[2024-05-26 22:32:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7695334807536442151.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability600031751530263745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7695334807536442151.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40795e+06,8.39187,162592,3593,188,213205,16181,782,910442,104,119795,0
Converting to forward existential form...Done !
original formula: AG(!(A((!(EX(((((i13.u49.WantSection_3_T==1)&&(i10.i2.u90.CS_3==1))||((i2.i0.u43.WantSection_0_T==1)&&(i12.i2.u16.CS_0==1)))||(((i10.i0.u...7910
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !((((((((((((((((i3.i0.u80.TestIdentity_0_0_3==1)||(i6.i0.u79.TestIdentit...20084
Reverse transition relation is NOT exact ! Due to transitions t24, t36, t37, t64, t65, t66, t67, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149,...831
(forward)formula 0,1,15.2362,257104,1,0,341322,16181,4794,1.56906e+06,521,119795,1247412
FORMULA Peterson-PT-3-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 22:32:47] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:32:47] [INFO ] Invariant cache hit.
[2024-05-26 22:32:47] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-26 22:32:47] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:32:47] [INFO ] Invariant cache hit.
[2024-05-26 22:32:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 22:32:48] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 22:32:48] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:32:48] [INFO ] Invariant cache hit.
[2024-05-26 22:32:48] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:32:50] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-26 22:32:51] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 2 ms to minimize.
[2024-05-26 22:32:51] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-26 22:32:52] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-05-26 22:32:53] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-26 22:32:53] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:32:59] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:33:02] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:33:11] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-26 22:33:11] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2024-05-26 22:33:11] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-26 22:33:11] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 3 ms to minimize.
[2024-05-26 22:33:12] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 2 ms to minimize.
[2024-05-26 22:33:12] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 4 ms to minimize.
[2024-05-26 22:33:12] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 6 ms to minimize.
[2024-05-26 22:33:12] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 3 ms to minimize.
[2024-05-26 22:33:12] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 3 ms to minimize.
[2024-05-26 22:33:12] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2024-05-26 22:33:13] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 4 ms to minimize.
[2024-05-26 22:33:13] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 4 ms to minimize.
[2024-05-26 22:33:13] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 3 ms to minimize.
[2024-05-26 22:33:13] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 3 ms to minimize.
[2024-05-26 22:33:13] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 3 ms to minimize.
[2024-05-26 22:33:14] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 3 ms to minimize.
[2024-05-26 22:33:14] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 3 ms to minimize.
[2024-05-26 22:33:14] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 3 ms to minimize.
[2024-05-26 22:33:14] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 4 ms to minimize.
[2024-05-26 22:33:14] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:33:15] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 4 ms to minimize.
[2024-05-26 22:33:15] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 3 ms to minimize.
[2024-05-26 22:33:16] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
[2024-05-26 22:33:16] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 3 ms to minimize.
[2024-05-26 22:33:16] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 3 ms to minimize.
[2024-05-26 22:33:16] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 2 ms to minimize.
[2024-05-26 22:33:16] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-05-26 22:33:16] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-26 22:33:16] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-26 22:33:17] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-05-26 22:33:17] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 3 ms to minimize.
[2024-05-26 22:33:17] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 3 ms to minimize.
[2024-05-26 22:33:17] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2024-05-26 22:33:17] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 3 ms to minimize.
[2024-05-26 22:33:18] [INFO ] Deduced a trap composed of 73 places in 168 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 244/552 variables, and 302 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30016 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 4/244 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/299 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:33:24] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 2 ms to minimize.
[2024-05-26 22:33:24] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 2 ms to minimize.
[2024-05-26 22:33:24] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 3 ms to minimize.
[2024-05-26 22:33:24] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-26 22:33:24] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-05-26 22:33:25] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 3 ms to minimize.
[2024-05-26 22:33:25] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 3 ms to minimize.
[2024-05-26 22:33:25] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-05-26 22:33:25] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 3 ms to minimize.
[2024-05-26 22:33:25] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 3 ms to minimize.
[2024-05-26 22:33:26] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
[2024-05-26 22:33:26] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 4 ms to minimize.
[2024-05-26 22:33:26] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 4 ms to minimize.
[2024-05-26 22:33:26] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 3 ms to minimize.
[2024-05-26 22:33:26] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 3 ms to minimize.
[2024-05-26 22:33:27] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-26 22:33:27] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
[2024-05-26 22:33:27] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-26 22:33:28] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-05-26 22:33:29] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:33:30] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-26 22:33:30] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 2 ms to minimize.
[2024-05-26 22:33:30] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-05-26 22:33:30] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 3 ms to minimize.
[2024-05-26 22:33:31] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 3 ms to minimize.
[2024-05-26 22:33:31] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-26 22:33:32] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 7/329 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:33:36] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-26 22:33:36] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 4 ms to minimize.
[2024-05-26 22:33:36] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
[2024-05-26 22:33:36] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-26 22:33:38] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 3 ms to minimize.
[2024-05-26 22:33:38] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 6/335 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:33:41] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/552 variables, and 336 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30027 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/328 constraints, Known Traps: 77/77 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Finished structural reductions in LTL mode , in 1 iterations and 60566 ms. Remains : 244/244 places, 332/332 transitions.
[2024-05-26 22:33:48] [INFO ] Flatten gal took : 14 ms
[2024-05-26 22:33:48] [INFO ] Flatten gal took : 16 ms
[2024-05-26 22:33:48] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-26 22:33:48] [INFO ] Flatten gal took : 15 ms
[2024-05-26 22:33:48] [INFO ] Flatten gal took : 14 ms
[2024-05-26 22:33:48] [INFO ] Time to serialize gal into /tmp/CTLFireability14127902075004971402.gal : 3 ms
[2024-05-26 22:33:48] [INFO ] Time to serialize properties into /tmp/CTLFireability11925661310432157348.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14127902075004971402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11925661310432157348.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,3.40795e+06,19.8345,420952,2,73296,5,1.12801e+06,6,0,1311,1.8281e+06,0
Converting to forward existential form...Done !
original formula: AX((!(E((((((WantSection_3_F==1)&&(Idle_3==1))||((WantSection_2_F==1)&&(Idle_2==1)))||(((WantSection_1_F==1)&&(Idle_1==1))||((WantSection...4422
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(((((((EG(!(E(TRUE U !(((((EndTurn_0_1==0)&&(EndTurn_2_0==0))&&((EndTurn_3_0==0)&&(EndTurn_1...3769
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-26 22:34:18] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:34:18] [INFO ] Applying decomposition
[2024-05-26 22:34:18] [INFO ] Flatten gal took : 9 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/graph2625793613694167805.txt' '-o' '/tmp/graph2625793613694167805.bin' '-w' '/tmp/graph2625793613694167805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2625793613694167805.bin' '-l' '-1' '-v' '-w' '/tmp/graph2625793613694167805.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:34:18] [INFO ] Decomposing Gal with order
[2024-05-26 22:34:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:34:18] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-26 22:34:18] [INFO ] Flatten gal took : 20 ms
[2024-05-26 22:34:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 5 ms.
[2024-05-26 22:34:18] [INFO ] Time to serialize gal into /tmp/CTLFireability4261383264699940210.gal : 4 ms
[2024-05-26 22:34:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9698405389374435391.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4261383264699940210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9698405389374435391.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40795e+06,6.17503,141288,3388,273,200412,5433,730,854521,113,40656,0
Converting to forward existential form...Done !
original formula: AX((!(E((((((i9.u65.WantSection_3_F==1)&&(i9.u65.Idle_3==1))||((i7.i0.u24.WantSection_2_F==1)&&(i7.i0.u24.Idle_2==1)))||(((i2.i0.u25.Want...5969
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(((((((EG(!(E(TRUE U !(((((i8.u6.EndTurn_0_1==0)&&(i9.u34.EndTurn_2_0==0))&&((i9.u7.EndTurn_...6026
Reverse transition relation is NOT exact ! Due to transitions t24, t64, t65, t66, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t151, t1...755
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 22:34:48] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:34:48] [INFO ] Invariant cache hit.
[2024-05-26 22:34:48] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-26 22:34:48] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:34:48] [INFO ] Invariant cache hit.
[2024-05-26 22:34:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 22:34:49] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 22:34:49] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:34:49] [INFO ] Invariant cache hit.
[2024-05-26 22:34:49] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:34:51] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
[2024-05-26 22:34:52] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
[2024-05-26 22:34:52] [INFO ] Deduced a trap composed of 97 places in 62 ms of which 2 ms to minimize.
[2024-05-26 22:34:52] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-26 22:34:53] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-26 22:34:54] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:34:59] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:35:01] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:35:10] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 4 ms to minimize.
[2024-05-26 22:35:10] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 3 ms to minimize.
[2024-05-26 22:35:10] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 2 ms to minimize.
[2024-05-26 22:35:10] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-26 22:35:10] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-26 22:35:10] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 3 ms to minimize.
[2024-05-26 22:35:10] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 3 ms to minimize.
[2024-05-26 22:35:11] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 4 ms to minimize.
[2024-05-26 22:35:11] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2024-05-26 22:35:11] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 3 ms to minimize.
[2024-05-26 22:35:11] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 4 ms to minimize.
[2024-05-26 22:35:11] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 3 ms to minimize.
[2024-05-26 22:35:12] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 3 ms to minimize.
[2024-05-26 22:35:12] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 3 ms to minimize.
[2024-05-26 22:35:12] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-26 22:35:12] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-26 22:35:12] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-26 22:35:12] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 4 ms to minimize.
[2024-05-26 22:35:13] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 3 ms to minimize.
[2024-05-26 22:35:13] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:35:14] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 4 ms to minimize.
[2024-05-26 22:35:14] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 3 ms to minimize.
[2024-05-26 22:35:14] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 3 ms to minimize.
[2024-05-26 22:35:14] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
[2024-05-26 22:35:14] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 3 ms to minimize.
[2024-05-26 22:35:15] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-26 22:35:15] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 2 ms to minimize.
[2024-05-26 22:35:15] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-05-26 22:35:15] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 3 ms to minimize.
[2024-05-26 22:35:15] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-26 22:35:15] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 3 ms to minimize.
[2024-05-26 22:35:15] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 3 ms to minimize.
[2024-05-26 22:35:16] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-26 22:35:16] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-26 22:35:16] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-26 22:35:16] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 2 ms to minimize.
[2024-05-26 22:35:16] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 2 ms to minimize.
[2024-05-26 22:35:16] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-05-26 22:35:16] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-05-26 22:35:16] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:35:17] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-26 22:35:17] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-05-26 22:35:18] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-05-26 22:35:18] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-26 22:35:18] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
[2024-05-26 22:35:18] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-26 22:35:18] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-26 22:35:18] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 244/552 variables, and 315 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30011 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 55/302 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 4/244 variables, 6/308 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/312 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:35:23] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-05-26 22:35:24] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2024-05-26 22:35:24] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-26 22:35:24] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-26 22:35:24] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-26 22:35:25] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-26 22:35:25] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-05-26 22:35:25] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 8/323 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:35:27] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-26 22:35:28] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-26 22:35:28] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:35:31] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 2 ms to minimize.
[2024-05-26 22:35:32] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:35:35] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 3 ms to minimize.
[2024-05-26 22:35:35] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:35:37] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 22:35:42] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/552 variables, and 332 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30022 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/328 constraints, Known Traps: 73/73 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in LTL mode , in 1 iterations and 60583 ms. Remains : 244/244 places, 332/332 transitions.
[2024-05-26 22:35:49] [INFO ] Flatten gal took : 12 ms
[2024-05-26 22:35:49] [INFO ] Flatten gal took : 14 ms
[2024-05-26 22:35:49] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-26 22:35:49] [INFO ] Flatten gal took : 13 ms
[2024-05-26 22:35:49] [INFO ] Flatten gal took : 13 ms
[2024-05-26 22:35:49] [INFO ] Time to serialize gal into /tmp/CTLFireability4580865643025063380.gal : 3 ms
[2024-05-26 22:35:49] [INFO ] Time to serialize properties into /tmp/CTLFireability6527802270269809514.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/CTLFireability4580865643025063380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6527802270269809514.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,3.40795e+06,20.9186,420652,2,73296,5,1.12801e+06,6,0,1311,1.8281e+06,0
Converting to forward existential form...Done !
original formula: EX(!(A(E(!(AG((((EndTurn_0_2==1)||(EndTurn_2_2==1))||((EndTurn_3_2==1)||(EndTurn_1_2==1))))) U !(A((((((TestIdentity_1_2_1==1)||(TestIden...3932
=> equivalent forward existential formula: ([(((FwdU(EY(Init),!(!((!(EX(!(((((WantSection_3_F==1)&&(Idle_3==1))||((WantSection_2_F==1)&&(Idle_2==1)))||(((W...8355
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-26 22:36:19] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:36:19] [INFO ] Applying decomposition
[2024-05-26 22:36:19] [INFO ] Flatten gal took : 8 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/graph9665881639657347734.txt' '-o' '/tmp/graph9665881639657347734.bin' '-w' '/tmp/graph9665881639657347734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9665881639657347734.bin' '-l' '-1' '-v' '-w' '/tmp/graph9665881639657347734.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:36:19] [INFO ] Decomposing Gal with order
[2024-05-26 22:36:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:36:19] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-26 22:36:19] [INFO ] Flatten gal took : 27 ms
[2024-05-26 22:36:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 8 ms.
[2024-05-26 22:36:19] [INFO ] Time to serialize gal into /tmp/CTLFireability4801420498911552167.gal : 6 ms
[2024-05-26 22:36:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17359652468144547043.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/CTLFireability4801420498911552167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17359652468144547043.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,3.40795e+06,3.41033,92736,2767,264,158656,4178,720,481762,116,29086,0
Converting to forward existential form...Done !
original formula: EX(!(A(E(!(AG((((i13.u8.EndTurn_0_2==1)||(i13.u11.EndTurn_2_2==1))||((i13.u65.EndTurn_3_2==1)||(i5.i0.u12.EndTurn_1_2==1))))) U !(A((((((...5243
=> equivalent forward existential formula: ([(((FwdU(EY(Init),!(!((!(EX(!(((((i3.u25.WantSection_3_F==1)&&(i3.u25.Idle_3==1))||((i5.i0.u26.WantSection_2_F=...14709
Reverse transition relation is NOT exact ! Due to transitions t24, t64, t65, t66, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t151, t1...753
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 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
(forward)formula 0,0,7.34324,158472,1,0,241641,5785,4773,929017,691,31404,656554
FORMULA Peterson-PT-3-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 LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 22:36:26] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:36:26] [INFO ] Invariant cache hit.
[2024-05-26 22:36:27] [INFO ] Implicit Places using invariants in 140 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 141 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 240/244 places, 332/332 transitions.
[2024-05-26 22:36:27] [INFO ] Flatten gal took : 10 ms
[2024-05-26 22:36:27] [INFO ] Flatten gal took : 11 ms
[2024-05-26 22:36:27] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-26 22:36:27] [INFO ] Flatten gal took : 12 ms
[2024-05-26 22:36:27] [INFO ] Flatten gal took : 12 ms
[2024-05-26 22:36:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13029983389318065133.gal : 3 ms
[2024-05-26 22:36:27] [INFO ] Time to serialize properties into /tmp/CTLFireability16257128749148412161.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/CTLFireability13029983389318065133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16257128749148412161.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,3.40795e+06,23.6391,388704,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
original formula: EF(AX((AG(((((WantSection_3_T==1)&&(CS_3==1))||((WantSection_0_T==1)&&(CS_0==1)))||(((WantSection_1_T==1)&&(CS_1==1))||((WantSection_2_T=...4295
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!(E(TRUE U !(((((WantSection_3_T==1)&&(CS_3==1))||((WantSection_0_T==1)&&(CS_0==1)))...3896
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-26 22:36:57] [INFO ] Flatten gal took : 14 ms
[2024-05-26 22:36:57] [INFO ] Applying decomposition
[2024-05-26 22:36:57] [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/graph8616799005009424560.txt' '-o' '/tmp/graph8616799005009424560.bin' '-w' '/tmp/graph8616799005009424560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8616799005009424560.bin' '-l' '-1' '-v' '-w' '/tmp/graph8616799005009424560.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:36:57] [INFO ] Decomposing Gal with order
[2024-05-26 22:36:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:36:57] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-26 22:36:57] [INFO ] Flatten gal took : 31 ms
[2024-05-26 22:36:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 9 ms.
[2024-05-26 22:36:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5242753679380632742.gal : 6 ms
[2024-05-26 22:36:57] [INFO ] Time to serialize properties into /tmp/CTLFireability17954828952609432673.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5242753679380632742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17954828952609432673.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,3.40795e+06,5.94108,117684,3021,322,164981,11641,686,648790,120,99372,0
Converting to forward existential form...Done !
original formula: EF(AX((AG(((((i6.u52.WantSection_3_T==1)&&(i14.u27.CS_3==1))||((i0.i1.u51.WantSection_0_T==1)&&(i3.i0.u25.CS_0==1)))||(((i2.i0.u50.WantSe...6006
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!(E(TRUE U !(((((i6.u52.WantSection_3_T==1)&&(i14.u27.CS_3==1))||((i0.i1.u51.WantSec...6076
Reverse transition relation is NOT exact ! Due to transitions t24, t64, t65, t66, t67, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t15...745
(forward)formula 0,0,9.46793,129036,1,0,175975,11641,4614,818028,722,99372,517444
FORMULA Peterson-PT-3-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 22:37:06] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:37:06] [INFO ] Invariant cache hit.
[2024-05-26 22:37:07] [INFO ] Implicit Places using invariants in 169 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 173 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 184 ms. Remains : 240/244 places, 332/332 transitions.
[2024-05-26 22:37:07] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:37:07] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:37:07] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-26 22:37:07] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:37:07] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:37:07] [INFO ] Time to serialize gal into /tmp/CTLFireability1062945267015702588.gal : 2 ms
[2024-05-26 22:37:07] [INFO ] Time to serialize properties into /tmp/CTLFireability4589345967461561609.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/CTLFireability1062945267015702588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4589345967461561609.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,3.40795e+06,19.006,388620,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-26 22:37:37] [INFO ] Flatten gal took : 12 ms
[2024-05-26 22:37:37] [INFO ] Applying decomposition
[2024-05-26 22:37:37] [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/graph9368880066676228850.txt' '-o' '/tmp/graph9368880066676228850.bin' '-w' '/tmp/graph9368880066676228850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9368880066676228850.bin' '-l' '-1' '-v' '-w' '/tmp/graph9368880066676228850.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:37:37] [INFO ] Decomposing Gal with order
[2024-05-26 22:37:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:37:37] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-26 22:37:37] [INFO ] Flatten gal took : 18 ms
[2024-05-26 22:37:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2024-05-26 22:37:37] [INFO ] Time to serialize gal into /tmp/CTLFireability4806469770864838554.gal : 5 ms
[2024-05-26 22:37:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10117034251971093596.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/CTLFireability4806469770864838554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10117034251971093596.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,3.40795e+06,3.11806,69420,2646,215,119293,3050,747,302777,104,20660,0
Converting to forward existential form...Done !
original formula: AG(((EF(((i11.i0.u10.IsEndLoop_2_2_1==1)||((i7.i2.u90.Turn_1_1==1)&&(i7.i2.u90.AskForSection_1_1==1)))) + (!(A(AG(((i10.u67.TestTurn_1_2=...610
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * !((E(TRUE U ((i11.i0.u10.IsEndLoop_2_2_1==1)||((i7.i2.u90.Turn_1_1==1)&&(i7.i2.u90.As...2553
Reverse transition relation is NOT exact ! Due to transitions t24, t64, t65, t66, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t151, t1...776
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found 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 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
(forward)formula 0,0,8.19248,156276,1,0,266892,5390,4332,759711,596,25972,760576
FORMULA Peterson-PT-3-CTLFireability-2024-08 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 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 192 place count 148 transition count 189
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 286 place count 101 transition count 189
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 310 place count 89 transition count 177
Applied a total of 310 rules in 23 ms. Remains 89 /244 variables (removed 155) and now considering 177/332 (removed 155) transitions.
[2024-05-26 22:37:45] [INFO ] Flow matrix only has 153 transitions (discarded 24 similar events)
// Phase 1: matrix 153 rows 89 cols
[2024-05-26 22:37:45] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 22:37:45] [INFO ] Implicit Places using invariants in 142 ms returned [82, 83, 84, 85]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 143 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 85/244 places, 177/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 172 ms. Remains : 85/244 places, 177/332 transitions.
[2024-05-26 22:37:45] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:37:45] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:37:45] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-26 22:37:45] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:37:45] [INFO ] Flatten gal took : 4 ms
[2024-05-26 22:37:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10532934524878152922.gal : 4 ms
[2024-05-26 22:37:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14742143321795310342.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10532934524878152922.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14742143321795310342.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 20272 steps (5 resets) in 98 ms. (204 steps per ms) remains 0/1 properties
FORMULA Peterson-PT-3-CTLFireability-2024-09 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 LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 22:37:45] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 22:37:45] [INFO ] Computed 15 invariants in 12 ms
[2024-05-26 22:37:46] [INFO ] Implicit Places using invariants in 266 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 268 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 274 ms. Remains : 240/244 places, 332/332 transitions.
[2024-05-26 22:37:46] [INFO ] Flatten gal took : 10 ms
[2024-05-26 22:37:46] [INFO ] Flatten gal took : 11 ms
[2024-05-26 22:37:46] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-26 22:37:46] [INFO ] Flatten gal took : 11 ms
[2024-05-26 22:37:46] [INFO ] Flatten gal took : 11 ms
[2024-05-26 22:37:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16911749747386412251.gal : 3 ms
[2024-05-26 22:37:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12173883957631169968.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/CTLFireability16911749747386412251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12173883957631169968.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,3.40795e+06,20.105,388656,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-26 22:38:16] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:38:16] [INFO ] Applying decomposition
[2024-05-26 22:38:16] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7834335925480570867.txt' '-o' '/tmp/graph7834335925480570867.bin' '-w' '/tmp/graph7834335925480570867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7834335925480570867.bin' '-l' '-1' '-v' '-w' '/tmp/graph7834335925480570867.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:38:16] [INFO ] Decomposing Gal with order
[2024-05-26 22:38:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:38:16] [INFO ] Removed a total of 214 redundant transitions.
[2024-05-26 22:38:16] [INFO ] Flatten gal took : 16 ms
[2024-05-26 22:38:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2024-05-26 22:38:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14712412649469802089.gal : 4 ms
[2024-05-26 22:38:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11489143675565227110.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/CTLFireability14712412649469802089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11489143675565227110.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,3.40795e+06,14.4805,272812,3170,181,341311,2676,777,1.83854e+06,87,21247,0
Converting to forward existential form...Done !
original formula: (EF(EG(EX(((i7.i0.u48.WantSection_2_T==1)&&(i13.i1.u78.TestAlone_3_0_2==1))))) + AF(((i13.i1.u50.WantSection_1_T==1)&&(i12.i1.u73.TestAlo...170
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U EG(EX(((i7.i0.u48.WantSection_2_T==1)&&(i13.i1.u78.TestAlone_3_0_2==1))))))),!(((i13.i1...224
Reverse transition relation is NOT exact ! Due to transitions t24, t64, t65, t66, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t151, t1...823
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 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
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 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
(forward)formula 0,1,17.7847,272812,1,0,341311,2676,4425,1.83854e+06,484,21247,788461
FORMULA Peterson-PT-3-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 22:38:34] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:38:34] [INFO ] Invariant cache hit.
[2024-05-26 22:38:34] [INFO ] Implicit Places using invariants in 184 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 185 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 240/244 places, 332/332 transitions.
[2024-05-26 22:38:34] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:38:34] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:38:34] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-26 22:38:34] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:38:34] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:38:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7842217302083164726.gal : 4 ms
[2024-05-26 22:38:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6491124075700589645.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/CTLFireability7842217302083164726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6491124075700589645.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,3.40795e+06,19.9758,388700,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-26 22:39:04] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:39:04] [INFO ] Applying decomposition
[2024-05-26 22:39:04] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15021989743505433946.txt' '-o' '/tmp/graph15021989743505433946.bin' '-w' '/tmp/graph15021989743505433946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15021989743505433946.bin' '-l' '-1' '-v' '-w' '/tmp/graph15021989743505433946.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:39:04] [INFO ] Decomposing Gal with order
[2024-05-26 22:39:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:39:04] [INFO ] Removed a total of 216 redundant transitions.
[2024-05-26 22:39:04] [INFO ] Flatten gal took : 17 ms
[2024-05-26 22:39:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2024-05-26 22:39:04] [INFO ] Time to serialize gal into /tmp/CTLFireability6223888234692944532.gal : 5 ms
[2024-05-26 22:39:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8900773148467389219.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/CTLFireability6223888234692944532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8900773148467389219.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40795e+06,6.65147,136624,3150,203,210040,5245,727,724546,96,45190,0
Converting to forward existential form...Done !
original formula: EF(EG((EF(((i9.u57.EndTurn_0_0==0)||(i3.u32.IsEndLoop_2_0_0==1))) * EX(AX(((i9.u49.WantSection_3_T==1)&&(i3.u75.TestAlone_2_0_3==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(E(TRUE U ((i9.u57.EndTurn_0_0==0)||(i3.u32.IsEndLoop_2_0_0==1))) * EX(!(EX(!(((i9.u49.Wan...217
Reverse transition relation is NOT exact ! Due to transitions t24, t64, t65, t66, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t151, t1...802
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 7
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,10.3091,152992,1,0,210040,5245,3649,937454,491,45190,778243
FORMULA Peterson-PT-3-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 244 transition count 246
Reduce places removed 86 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 87 rules applied. Total rules applied 173 place count 158 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 174 place count 157 transition count 245
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 174 place count 157 transition count 198
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 268 place count 110 transition count 198
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 290 place count 99 transition count 187
Applied a total of 290 rules in 19 ms. Remains 99 /244 variables (removed 145) and now considering 187/332 (removed 145) transitions.
[2024-05-26 22:39:14] [INFO ] Flow matrix only has 163 transitions (discarded 24 similar events)
// Phase 1: matrix 163 rows 99 cols
[2024-05-26 22:39:14] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 22:39:14] [INFO ] Implicit Places using invariants in 143 ms returned [91, 92, 93, 94]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 145 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 95/244 places, 187/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 95 /95 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 172 ms. Remains : 95/244 places, 187/332 transitions.
[2024-05-26 22:39:15] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:39:15] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:39:15] [INFO ] Input system was already deterministic with 187 transitions.
[2024-05-26 22:39:15] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:39:15] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:39:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15569961962413292479.gal : 2 ms
[2024-05-26 22:39:15] [INFO ] Time to serialize properties into /tmp/CTLFireability10309797994418886415.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/CTLFireability15569961962413292479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10309797994418886415.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,110973,1.77732,39976,2,9006,5,115817,6,0,570,134810,0
Converting to forward existential form...Done !
original formula: EF((A(E((((Turn_2_2==1)&&(AskForSection_1_2==1)) + E((TestIdentity_1_1_2==1) U ((WantSection_0_T==1)&&(TestAlone_2_2_0==1)))) U (!(((AskF...386
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (((TestIdentity_0_0_2==1)||(AskForSection_1_0==0))||(Turn_0_3==0))) * !(EG(!(((WantSection...558
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t10, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t61, t80, t81, t82, ...619
(forward)formula 0,1,24.4438,554088,1,0,802,3.97691e+06,414,394,3954,2.49745e+06,784
FORMULA Peterson-PT-3-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 22:39:39] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 22:39:39] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 22:39:39] [INFO ] Implicit Places using invariants in 177 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 178 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 183 ms. Remains : 240/244 places, 332/332 transitions.
[2024-05-26 22:39:39] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:39:39] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:39:39] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-26 22:39:39] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:39:39] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:39:39] [INFO ] Time to serialize gal into /tmp/CTLFireability7028063933726226340.gal : 1 ms
[2024-05-26 22:39:39] [INFO ] Time to serialize properties into /tmp/CTLFireability14274081183381196374.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/CTLFireability7028063933726226340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14274081183381196374.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40795e+06,19.992,388728,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-26 22:40:09] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:40:09] [INFO ] Applying decomposition
[2024-05-26 22:40:09] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1790171221638655236.txt' '-o' '/tmp/graph1790171221638655236.bin' '-w' '/tmp/graph1790171221638655236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1790171221638655236.bin' '-l' '-1' '-v' '-w' '/tmp/graph1790171221638655236.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:40:09] [INFO ] Decomposing Gal with order
[2024-05-26 22:40:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:40:10] [INFO ] Removed a total of 222 redundant transitions.
[2024-05-26 22:40:10] [INFO ] Flatten gal took : 25 ms
[2024-05-26 22:40:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 22:40:10] [INFO ] Time to serialize gal into /tmp/CTLFireability12778058034131339533.gal : 6 ms
[2024-05-26 22:40:10] [INFO ] Time to serialize properties into /tmp/CTLFireability360518740184632586.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/CTLFireability12778058034131339533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability360518740184632586.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40795e+06,19.7171,398824,4416,90,401540,5516,789,3.41551e+06,65,29962,0
Converting to forward existential form...Done !
original formula: AX(AX(EF(((i12.i0.u50.WantSection_0_F==1)&&(i3.u24.TestAlone_1_1_0==1)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U ((i12.i0.u50.WantSection_0_F==1)&&(i3.u24.TestAlone_1_1_0==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t36, t37, t64, t65, t66, t67, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149,...882
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 22:40:40] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 22:40:40] [INFO ] Invariant cache hit.
[2024-05-26 22:40:40] [INFO ] Implicit Places using invariants in 167 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 168 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 173 ms. Remains : 240/244 places, 332/332 transitions.
[2024-05-26 22:40:40] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:40:40] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:40:40] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-26 22:40:40] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:40:40] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:40:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1682791542229784943.gal : 1 ms
[2024-05-26 22:40:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9492801906590781038.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/CTLFireability1682791542229784943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9492801906590781038.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,3.40795e+06,20.0103,388732,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-26 22:41:10] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:41:10] [INFO ] Applying decomposition
[2024-05-26 22:41:10] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4956278733660617794.txt' '-o' '/tmp/graph4956278733660617794.bin' '-w' '/tmp/graph4956278733660617794.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4956278733660617794.bin' '-l' '-1' '-v' '-w' '/tmp/graph4956278733660617794.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:41:10] [INFO ] Decomposing Gal with order
[2024-05-26 22:41:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:41:10] [INFO ] Removed a total of 224 redundant transitions.
[2024-05-26 22:41:10] [INFO ] Flatten gal took : 15 ms
[2024-05-26 22:41:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 22:41:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16412688111019266955.gal : 4 ms
[2024-05-26 22:41:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4115521269468568977.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/CTLFireability16412688111019266955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4115521269468568977.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,3.40795e+06,6.98446,158436,3051,80,246181,2100,831,885875,68,12408,0
Converting to forward existential form...Done !
original formula: EG(AX((EF(((i10.i1.u54.WantSection_1_F==1)&&(i6.i2.u34.TestAlone_0_1_1==1))) * (E((((i5.i1.u73.Turn_1_1==1)&&(i6.i2.u61.AskForSection_0_1...297
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((E(TRUE U ((i10.i1.u54.WantSection_1_F==1)&&(i6.i2.u34.TestAlone_0_1_1==1))) * (E((((i5.i1.u73...358
Reverse transition relation is NOT exact ! Due to transitions t24, t36, t37, t64, t65, t66, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150...869
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.
[2024-05-26 22:41:40] [INFO ] Flatten gal took : 10 ms
[2024-05-26 22:41:40] [INFO ] Flatten gal took : 13 ms
[2024-05-26 22:41:40] [INFO ] Applying decomposition
[2024-05-26 22:41:40] [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/graph15193379274203963915.txt' '-o' '/tmp/graph15193379274203963915.bin' '-w' '/tmp/graph15193379274203963915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15193379274203963915.bin' '-l' '-1' '-v' '-w' '/tmp/graph15193379274203963915.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:41:40] [INFO ] Decomposing Gal with order
[2024-05-26 22:41:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:41:40] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-26 22:41:40] [INFO ] Flatten gal took : 25 ms
[2024-05-26 22:41:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2024-05-26 22:41:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15210594983427010884.gal : 4 ms
[2024-05-26 22:41:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15603311984954223416.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/CTLFireability15210594983427010884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15603311984954223416.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 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40795e+06,12.44,260580,4344,255,352806,14353,672,1.59179e+06,105,130809,0
Converting to forward existential form...Done !
original formula: AF(E(AG(A(EX(((((i7.u25.WantSection_3_F==1)&&(i7.u25.Idle_3==1))||((i2.u63.WantSection_2_F==1)&&(i2.u63.Idle_2==1)))||(((i0.u26.WantSecti...7225
=> equivalent forward existential formula: [FwdG(Init,!(E(!(E(TRUE U !(!((E(!(((((((((i2.u63.WantSection_2_F==1)&&(i10.u56.TestAlone_3_1_2==1))||((i2.u63.W...11877
Reverse transition relation is NOT exact ! Due to transitions t24, t36, t37, t64, t65, t66, t67, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149,...759
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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,59.7865,1224796,1,0,1.50228e+06,14353,4782,8.81949e+06,613,130809,3659855
FORMULA Peterson-PT-3-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX((!(E((((((i7.u25.WantSection_3_F==1)&&(i7.u25.Idle_3==1))||((i2.u63.WantSection_2_F==1)&&(i2.u63.Idle_2==1)))||(((i0.u26.WantSection_1...5826
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(((((((EG(!(E(TRUE U !(((((i13.u33.EndTurn_0_1==0)&&(i7.u32.EndTurn_2_0==0))&&((i7.u8.EndTur...5883
(forward)formula 1,0,171.333,2208260,1,0,2.54067e+06,16146,1703,1.71189e+07,252,130809,4645568
FORMULA Peterson-PT-3-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX(AX(EF(((i14.u64.WantSection_0_F==1)&&(i13.u40.TestAlone_1_1_0==1)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U ((i14.u64.WantSection_0_F==1)&&(i13.u40.TestAlone_1_1_0==1)))))] = FALSE
(forward)formula 2,1,178.619,2208260,1,0,2.54067e+06,16146,2519,1.71189e+07,312,130809,5275109
FORMULA Peterson-PT-3-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EG(AX((EF(((i0.u26.WantSection_1_F==1)&&(i5.i0.u14.TestAlone_0_1_1==1))) * (E((((i13.u62.Turn_1_1==1)&&(i13.u33.AskForSection_0_1==1))||(...277
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((E(TRUE U ((i0.u26.WantSection_1_F==1)&&(i5.i0.u14.TestAlone_0_1_1==1))) * (E((((i13.u62.Turn_...338
(forward)formula 3,0,185.578,2208260,1,0,2.56261e+06,16146,2625,1.71189e+07,317,130809,5776054
FORMULA Peterson-PT-3-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1114079 ms.
BK_STOP 1716763486689
--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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 r268-smll-171654407200258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 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 ;