About the Execution of ITS-Tools for EisenbergMcGuire-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1144.228 | 672473.00 | 774319.00 | 1700.70 | TFFFTTFFTFTTTTFT | 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.r158-smll-171636266300146.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 EisenbergMcGuire-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300146
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 12 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 12 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 121K May 18 16:42 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 EisenbergMcGuire-PT-03-CTLFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2023-12
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2023-14
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716508904306
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 00:01:46] [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-24 00:01:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 00:01:46] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-05-24 00:01:46] [INFO ] Transformed 117 places.
[2024-05-24 00:01:46] [INFO ] Transformed 216 transitions.
[2024-05-24 00:01:46] [INFO ] Found NUPN structural information;
[2024-05-24 00:01:46] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 149 ms.
Support contains 75 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Applied a total of 0 rules in 55 ms. Remains 117 /117 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-24 00:01:46] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
// Phase 1: matrix 153 rows 117 cols
[2024-05-24 00:01:47] [INFO ] Computed 10 invariants in 41 ms
[2024-05-24 00:01:47] [INFO ] Implicit Places using invariants in 618 ms returned []
[2024-05-24 00:01:47] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2024-05-24 00:01:47] [INFO ] Invariant cache hit.
[2024-05-24 00:01:47] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 00:01:47] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-24 00:01:47] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2024-05-24 00:01:48] [INFO ] Invariant cache hit.
[2024-05-24 00:01:48] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-24 00:01:49] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 15 ms to minimize.
[2024-05-24 00:01:49] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:01:50] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 2 ms to minimize.
[2024-05-24 00:01:50] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 2 ms to minimize.
[2024-05-24 00:01:50] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 20 ms to minimize.
[2024-05-24 00:01:50] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:01:50] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:01:51] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-24 00:01:51] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 2 ms to minimize.
[2024-05-24 00:01:51] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:01:51] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 5 ms to minimize.
[2024-05-24 00:01:51] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2024-05-24 00:01:51] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2024-05-24 00:01:51] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 2 ms to minimize.
[2024-05-24 00:01:51] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2024-05-24 00:01:52] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2024-05-24 00:01:52] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:01:52] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-24 00:01:52] [INFO ] Deduced a trap composed of 15 places in 305 ms of which 16 ms to minimize.
[2024-05-24 00:01:53] [INFO ] Deduced a trap composed of 35 places in 322 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-24 00:01:54] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
[2024-05-24 00:01:55] [INFO ] Deduced a trap composed of 33 places in 527 ms of which 2 ms to minimize.
[2024-05-24 00:01:55] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 1 ms to minimize.
[2024-05-24 00:01:56] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2024-05-24 00:01:56] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-05-24 00:01:56] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 1 ms to minimize.
[2024-05-24 00:01:56] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2024-05-24 00:01:57] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 1 ms to minimize.
[2024-05-24 00:01:57] [INFO ] Deduced a trap composed of 38 places in 372 ms of which 2 ms to minimize.
[2024-05-24 00:01:57] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 10/157 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-24 00:01:59] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2024-05-24 00:01:59] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-05-24 00:01:59] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-24 00:02:00] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 153/270 variables, 117/278 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 56/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 334 constraints, problems are : Problem set: 0 solved, 213 unsolved in 21662 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 34/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 153/270 variables, 117/278 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 56/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 213/547 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-24 00:02:14] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2024-05-24 00:02:14] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-05-24 00:02:14] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:02:15] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 4/551 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-24 00:02:19] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-24 00:02:21] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (OVERLAPS) 0/270 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 553 constraints, problems are : Problem set: 0 solved, 213 unsolved in 22338 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 40/40 constraints]
After SMT, in 44324ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 44364ms
Finished structural reductions in LTL mode , in 1 iterations and 45529 ms. Remains : 117/117 places, 216/216 transitions.
Support contains 75 out of 117 places after structural reductions.
[2024-05-24 00:02:32] [INFO ] Flatten gal took : 93 ms
[2024-05-24 00:02:32] [INFO ] Flatten gal took : 34 ms
[2024-05-24 00:02:32] [INFO ] Input system was already deterministic with 216 transitions.
RANDOM walk for 40000 steps (8 resets) in 3048 ms. (13 steps per ms) remains 45/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 40/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
[2024-05-24 00:02:34] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2024-05-24 00:02:34] [INFO ] Invariant cache hit.
[2024-05-24 00:02:34] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/51 constraints. Problems are: Problem set: 2 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 2 solved, 37 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 3 (OVERLAPS) 67/117 variables, 6/57 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 67/124 constraints. Problems are: Problem set: 4 solved, 35 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 5 solved, 34 unsolved
[2024-05-24 00:02:35] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:02:35] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2024-05-24 00:02:35] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 00:02:35] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-24 00:02:35] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:02:35] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 6/133 constraints. Problems are: Problem set: 5 solved, 34 unsolved
[2024-05-24 00:02:35] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:02:35] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-24 00:02:35] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-24 00:02:35] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:02:35] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 3 ms to minimize.
[2024-05-24 00:02:35] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2024-05-24 00:02:36] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
Problem AtomicPropp21 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 7/140 constraints. Problems are: Problem set: 6 solved, 33 unsolved
[2024-05-24 00:02:36] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-24 00:02:36] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-05-24 00:02:36] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 3/143 constraints. Problems are: Problem set: 6 solved, 33 unsolved
[2024-05-24 00:02:36] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 13 ms to minimize.
[2024-05-24 00:02:36] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-24 00:02:36] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 3/146 constraints. Problems are: Problem set: 6 solved, 33 unsolved
[2024-05-24 00:02:37] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 1/147 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 0/147 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 153/270 variables, 117/264 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 56/320 constraints. Problems are: Problem set: 6 solved, 33 unsolved
[2024-05-24 00:02:37] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 1/321 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 0/321 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 0/270 variables, 0/321 constraints. Problems are: Problem set: 6 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 321 constraints, problems are : Problem set: 6 solved, 33 unsolved in 4024 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 6 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 1/42 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/42 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 76/117 variables, 6/48 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 76/124 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 21/148 constraints. Problems are: Problem set: 6 solved, 33 unsolved
[2024-05-24 00:02:38] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:02:39] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 2 ms to minimize.
[2024-05-24 00:02:39] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 3/151 constraints. Problems are: Problem set: 6 solved, 33 unsolved
[2024-05-24 00:02:39] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 1/152 constraints. Problems are: Problem set: 6 solved, 33 unsolved
[2024-05-24 00:02:39] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 1/153 constraints. Problems are: Problem set: 6 solved, 33 unsolved
[2024-05-24 00:02:39] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 1/154 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 0/154 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 153/270 variables, 117/271 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 56/327 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 33/360 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 0/360 constraints. Problems are: Problem set: 6 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 0/270 variables, 0/360 constraints. Problems are: Problem set: 6 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 360 constraints, problems are : Problem set: 6 solved, 33 unsolved in 3162 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 33/39 constraints, Known Traps: 27/27 constraints]
After SMT, in 7249ms problems are : Problem set: 6 solved, 33 unsolved
Fused 33 Parikh solutions to 31 different solutions.
Parikh walk visited 2 properties in 3189 ms.
Support contains 39 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 117 transition count 198
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 99 transition count 198
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 95 transition count 186
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 95 transition count 186
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 90 transition count 181
Applied a total of 54 rules in 49 ms. Remains 90 /117 variables (removed 27) and now considering 181/216 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 90/117 places, 181/216 transitions.
RANDOM walk for 40000 steps (8 resets) in 496 ms. (80 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
Probably explored full state space saw : 12498 states, properties seen :30
Probabilistic random walk after 49992 steps, saw 12498 distinct states, run finished after 470 ms. (steps per millisecond=106 ) properties seen :30
Explored full state space saw : 12498 states, properties seen :0
Exhaustive walk after 49992 steps, saw 12498 distinct states, run finished after 98 ms. (steps per millisecond=510 ) properties seen :0
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2024-05-24 00:02:46] [INFO ] Flatten gal took : 21 ms
[2024-05-24 00:02:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 00:02:46] [INFO ] Flatten gal took : 22 ms
[2024-05-24 00:02:46] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 68 out of 117 places (down from 71) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 9 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
[2024-05-24 00:02:46] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-05-24 00:02:46] [INFO ] Computed 10 invariants in 10 ms
[2024-05-24 00:02:46] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-24 00:02:46] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:02:46] [INFO ] Invariant cache hit.
[2024-05-24 00:02:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:02:46] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-24 00:02:46] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:02:46] [INFO ] Invariant cache hit.
[2024-05-24 00:02:46] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:02:47] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:02:47] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:02:47] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:02:47] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2024-05-24 00:02:47] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:02:47] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:02:47] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
[2024-05-24 00:02:47] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-24 00:02:47] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
[2024-05-24 00:02:48] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-24 00:02:48] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:02:48] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:02:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-24 00:02:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-24 00:02:48] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 2 ms to minimize.
[2024-05-24 00:02:48] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
[2024-05-24 00:02:48] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:02:48] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:02:48] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:02:48] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:02:48] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-24 00:02:49] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 2 ms to minimize.
[2024-05-24 00:02:49] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-24 00:02:49] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:02:49] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2024-05-24 00:02:49] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:02:50] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:02:53] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:02:53] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12360 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:02:59] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:03:02] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:03:02] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2024-05-24 00:03:02] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-05-24 00:03:03] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 10561 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 22977ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 22981ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 198/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23290 ms. Remains : 111/117 places, 198/216 transitions.
[2024-05-24 00:03:09] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:03:09] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:03:09] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-24 00:03:09] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:03:09] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:03:09] [INFO ] Time to serialize gal into /tmp/CTLFireability5938571722724831155.gal : 8 ms
[2024-05-24 00:03:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14910532703440106637.ctl : 11 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/CTLFireability5938571722724831155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14910532703440106637.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,24617,1.86481,48600,2,11856,5,129101,6,0,645,141739,0
Converting to forward existential form...Done !
original formula: AF(((E(((flag_2_active==1)&&(p04_2==1)) U !(A((((turn_0==1)&&(flag_0_waiting==1))&&(p25_2_3==1)) U (((turn_1==1)&&(flag_1_active==1))&&(p...502
=> equivalent forward existential formula: [FwdG(Init,!(((E(((flag_2_active==1)&&(p04_2==1)) U !(!((E(!((((turn_1==1)&&(flag_1_active==1))&&(p25_1_2==1))) ...1286
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t42, t43,...683
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-24 00:03:39] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:03:39] [INFO ] Applying decomposition
[2024-05-24 00:03:39] [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/graph11981097939121747761.txt' '-o' '/tmp/graph11981097939121747761.bin' '-w' '/tmp/graph11981097939121747761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11981097939121747761.bin' '-l' '-1' '-v' '-w' '/tmp/graph11981097939121747761.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:03:39] [INFO ] Decomposing Gal with order
[2024-05-24 00:03:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:03:39] [INFO ] Removed a total of 223 redundant transitions.
[2024-05-24 00:03:39] [INFO ] Flatten gal took : 73 ms
[2024-05-24 00:03:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 17 ms.
[2024-05-24 00:03:39] [INFO ] Time to serialize gal into /tmp/CTLFireability7917805921215533358.gal : 7 ms
[2024-05-24 00:03:39] [INFO ] Time to serialize properties into /tmp/CTLFireability10715562316069721515.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/CTLFireability7917805921215533358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10715562316069721515.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,24617,1.34287,31532,1440,276,33912,1082,659,141867,105,9473,0
Converting to forward existential form...Done !
original formula: AF(((E(((i0.u0.flag_2_active==1)&&(i1.u1.p04_2==1)) U !(A((((i1.u1.turn_0==1)&&(i1.u26.flag_0_waiting==1))&&(i5.i1.u25.p25_2_3==1)) U (((...683
=> equivalent forward existential formula: [FwdG(Init,!(((E(((i0.u0.flag_2_active==1)&&(i1.u1.p04_2==1)) U !(!((E(!((((i1.u1.turn_1==1)&&(i0.u0.flag_1_acti...1691
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t28, t29, t30, t31, t32, t33, t34, t35, t48, t49, t50, t96, t99, t100...655
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
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,4.83404,103604,1,0,141820,5047,3346,530656,411,26228,480958
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 9 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
[2024-05-24 00:03:44] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2024-05-24 00:03:44] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 00:03:45] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-24 00:03:45] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-05-24 00:03:45] [INFO ] Invariant cache hit.
[2024-05-24 00:03:45] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-24 00:03:45] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-24 00:03:45] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-05-24 00:03:45] [INFO ] Invariant cache hit.
[2024-05-24 00:03:45] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:03:46] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
[2024-05-24 00:03:46] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:03:46] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 00:03:46] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-24 00:03:46] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:03:46] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:03:46] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:03:46] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-24 00:03:46] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:03:46] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 2 ms to minimize.
[2024-05-24 00:03:46] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-05-24 00:03:47] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-24 00:03:47] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-24 00:03:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 00:03:47] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-05-24 00:03:47] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-24 00:03:47] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:03:47] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:03:48] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:03:49] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 138/250 variables, 112/142 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 46/188 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:03:53] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-05-24 00:03:53] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/250 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 190 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12417 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:03:58] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:03:58] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-24 00:03:58] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:03:58] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-24 00:03:58] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:03:59] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:03:59] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/151 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/197 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 198/395 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:01] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-24 00:04:02] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-24 00:04:02] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:04:02] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 4/399 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:03] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:04:04] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:09] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/250 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:13] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:04:13] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 14 (OVERLAPS) 0/250 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 404 constraints, problems are : Problem set: 0 solved, 198 unsolved in 23020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 38/38 constraints]
After SMT, in 35498ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 35502ms
Starting structural reductions in LTL mode, iteration 1 : 112/117 places, 201/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35919 ms. Remains : 112/117 places, 201/216 transitions.
[2024-05-24 00:04:20] [INFO ] Flatten gal took : 11 ms
[2024-05-24 00:04:20] [INFO ] Flatten gal took : 11 ms
[2024-05-24 00:04:20] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-24 00:04:20] [INFO ] Flatten gal took : 20 ms
[2024-05-24 00:04:20] [INFO ] Flatten gal took : 25 ms
[2024-05-24 00:04:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15066419503366604636.gal : 3 ms
[2024-05-24 00:04:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15653818355245266715.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/CTLFireability15066419503366604636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15653818355245266715.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,25743,2.09705,55008,2,12599,5,143921,6,0,652,160138,0
Converting to forward existential form...Done !
original formula: AX(EF((E((p18_2_3==1) U AG(((turn_1==1)&&(p10_1_0==1)))) * ((p34_0_1==0)||(((turn_1==1)&&(flag_1_active==1))&&(p25_1_2==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (E((p18_2_3==1) U !(E(TRUE U !(((turn_1==1)&&(p10_1_0==1)))))) * ((p34_0_1==0)||(((turn_...210
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t30, t31, t32, t33, t34, t35, t42, t43, t44, t45,...691
(forward)formula 0,0,8.06184,177136,1,0,491,707185,429,206,4279,420893,418
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 9 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
[2024-05-24 00:04:29] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2024-05-24 00:04:29] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 00:04:29] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-24 00:04:29] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-05-24 00:04:29] [INFO ] Invariant cache hit.
[2024-05-24 00:04:29] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-24 00:04:29] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-24 00:04:29] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-05-24 00:04:29] [INFO ] Invariant cache hit.
[2024-05-24 00:04:29] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:30] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:04:30] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-24 00:04:30] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-24 00:04:30] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-24 00:04:30] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-05-24 00:04:30] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2024-05-24 00:04:31] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-24 00:04:31] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:04:31] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:04:31] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:04:31] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-24 00:04:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-24 00:04:32] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:04:32] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:04:32] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:32] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:04:32] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:04:32] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-24 00:04:32] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:04:33] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-24 00:04:33] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2024-05-24 00:04:33] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:04:33] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-24 00:04:33] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:04:33] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:35] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 138/250 variables, 112/148 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 46/194 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 194 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12714 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:43] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:43] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:44] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-24 00:04:44] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-24 00:04:44] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:45] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:46] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 138/250 variables, 112/155 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 46/201 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 198/399 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:49] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:04:49] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-05-24 00:04:49] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:04:49] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:52] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:04:54] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-05-24 00:04:55] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-05-24 00:04:55] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 16 (OVERLAPS) 0/250 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 407 constraints, problems are : Problem set: 0 solved, 198 unsolved in 20311 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 41/41 constraints]
After SMT, in 33094ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 33099ms
Starting structural reductions in LTL mode, iteration 1 : 112/117 places, 201/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33503 ms. Remains : 112/117 places, 201/216 transitions.
[2024-05-24 00:05:02] [INFO ] Flatten gal took : 23 ms
[2024-05-24 00:05:02] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:05:02] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-24 00:05:02] [INFO ] Flatten gal took : 20 ms
[2024-05-24 00:05:02] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:05:02] [INFO ] Time to serialize gal into /tmp/CTLFireability18070693746553227600.gal : 17 ms
[2024-05-24 00:05:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12897563342811143802.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/CTLFireability18070693746553227600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12897563342811143802.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,26002,2.02152,54680,2,12541,5,138646,6,0,652,165019,0
Converting to forward existential form...Done !
original formula: (AX(AG((((E(((turn_0==1)&&(p07_0==1)) U (((turn_1==1)&&(flag_1_waiting==1))&&(p25_0_1==1))) * (((flag_0_waiting==1)&&(p33_1_0==1))||(p18_...344
=> equivalent forward existential formula: ((([((FwdU(EY(Init),TRUE) * !(E(!(((turn_1==1)&&(p27_0==1))) U !(E(TRUE U !((((turn_1==1)&&(flag_1_active==1))&&...734
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t42, t44,...696
(forward)formula 0,0,7.73424,173764,1,0,492,642954,425,208,4206,419588,415
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 115 transition count 214
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 4 place count 115 transition count 184
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 64 place count 85 transition count 184
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 79 transition count 166
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 79 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 73 transition count 160
Applied a total of 88 rules in 49 ms. Remains 73 /117 variables (removed 44) and now considering 160/216 (removed 56) transitions.
[2024-05-24 00:05:10] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
// Phase 1: matrix 97 rows 73 cols
[2024-05-24 00:05:10] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 00:05:10] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-24 00:05:10] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 00:05:10] [INFO ] Invariant cache hit.
[2024-05-24 00:05:10] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:05:10] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-24 00:05:10] [INFO ] Redundant transitions in 6 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-24 00:05:10] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 00:05:10] [INFO ] Invariant cache hit.
[2024-05-24 00:05:10] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:05:11] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:05:11] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:05:11] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:05:11] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:05:11] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-24 00:05:11] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:05:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-24 00:05:12] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 00:05:12] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:05:12] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:05:12] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:05:12] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:05:12] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:05:12] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:05:12] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-24 00:05:12] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:05:13] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:05:14] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:05:14] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:05:14] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 97/170 variables, 73/103 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 44/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:05:16] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:05:16] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/170 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 149 constraints, problems are : Problem set: 0 solved, 157 unsolved in 8016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/105 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 44/149 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 157/306 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 306 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4324 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 22/22 constraints]
After SMT, in 12389ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 12391ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/117 places, 160/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12773 ms. Remains : 73/117 places, 160/216 transitions.
[2024-05-24 00:05:23] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:05:23] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:05:23] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-24 00:05:23] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:05:23] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:05:23] [INFO ] Time to serialize gal into /tmp/CTLFireability15721764304402259716.gal : 3 ms
[2024-05-24 00:05:23] [INFO ] Time to serialize properties into /tmp/CTLFireability167891833294890274.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/CTLFireability15721764304402259716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability167891833294890274.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,5810,0.978578,31136,2,6996,5,74974,6,0,455,76384,0
Converting to forward existential form...Done !
original formula: EF(AG((((turn_0==1)&&(flag_0_waiting==1))&&(p25_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((turn_0==1)&&(flag_0_waiting==1))&&(p25_1_3==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31,...637
(forward)formula 0,0,3.24561,80856,1,0,422,288396,342,164,3180,179112,334
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 6 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
[2024-05-24 00:05:26] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2024-05-24 00:05:26] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 00:05:26] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-24 00:05:26] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-05-24 00:05:26] [INFO ] Invariant cache hit.
[2024-05-24 00:05:27] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-24 00:05:27] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-24 00:05:27] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-05-24 00:05:27] [INFO ] Invariant cache hit.
[2024-05-24 00:05:27] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:05:27] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:05:28] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:05:28] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-24 00:05:28] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-24 00:05:28] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:05:28] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:05:28] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:05:28] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:05:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-24 00:05:28] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2024-05-24 00:05:28] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-24 00:05:29] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-05-24 00:05:29] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:05:29] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 3 ms to minimize.
[2024-05-24 00:05:29] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 2 ms to minimize.
[2024-05-24 00:05:29] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:05:29] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-24 00:05:29] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-24 00:05:30] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-24 00:05:30] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:05:30] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-05-24 00:05:30] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-24 00:05:31] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/145 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/191 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:05:34] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 192 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12507 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:05:40] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-24 00:05:40] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-24 00:05:40] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-24 00:05:40] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/150 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 198/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:05:43] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-24 00:05:43] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-24 00:05:43] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:05:43] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-24 00:05:44] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-24 00:05:44] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 6/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:05:46] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:05:48] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:05:50] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:05:50] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:05:53] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:05:57] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:05:57] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/250 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:06:01] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-24 00:06:01] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 17 (OVERLAPS) 0/250 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 409 constraints, problems are : Problem set: 0 solved, 198 unsolved in 29203 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 43/43 constraints]
After SMT, in 41767ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 41770ms
Starting structural reductions in LTL mode, iteration 1 : 112/117 places, 201/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42258 ms. Remains : 112/117 places, 201/216 transitions.
[2024-05-24 00:06:08] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:06:08] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:06:08] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-24 00:06:08] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:06:08] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:06:08] [INFO ] Time to serialize gal into /tmp/CTLFireability10420940416217706419.gal : 2 ms
[2024-05-24 00:06:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12843510152136599153.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/CTLFireability10420940416217706419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12843510152136599153.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,25695,1.76043,52652,2,12392,5,138717,6,0,652,150597,0
Converting to forward existential form...Done !
original formula: (EX(EF((A(EF((((turn_1==1)&&(flag_1_active==1))&&(p25_1_3==1))) U (((p17_0==1)&&(turn_1==1))&&((flag_1_idle==1)&&(p25_2_3==1)))) + ((flag...421
=> equivalent forward existential formula: (([((FwdU(EY(Init),TRUE) * !(EG(!((((p17_0==1)&&(turn_1==1))&&((flag_1_idle==1)&&(p25_2_3==1))))))) * !(E(!((((p...797
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t42, t43, t44, t45,...691
(forward)formula 0,1,15.3388,373660,1,0,541,1.97143e+06,432,242,4515,1.08415e+06,508
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 5 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
[2024-05-24 00:06:24] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-05-24 00:06:24] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 00:06:24] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-24 00:06:24] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:06:24] [INFO ] Invariant cache hit.
[2024-05-24 00:06:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:06:24] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-24 00:06:24] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:06:24] [INFO ] Invariant cache hit.
[2024-05-24 00:06:24] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:06:25] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-24 00:06:25] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-24 00:06:25] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 3 ms to minimize.
[2024-05-24 00:06:25] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-05-24 00:06:25] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:06:25] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:06:26] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 13 ms to minimize.
[2024-05-24 00:06:26] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-05-24 00:06:26] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
[2024-05-24 00:06:26] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-24 00:06:26] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 12 ms to minimize.
[2024-05-24 00:06:26] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-24 00:06:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-24 00:06:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 00:06:26] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:06:26] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:06:26] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:06:26] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:06:26] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 2 ms to minimize.
[2024-05-24 00:06:27] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:06:27] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-24 00:06:27] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
[2024-05-24 00:06:27] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:06:27] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:06:27] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-24 00:06:28] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-05-24 00:06:28] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:06:31] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:06:31] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12167 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:06:38] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:06:40] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-24 00:06:40] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:06:40] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-05-24 00:06:41] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 10894 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 23122ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 23124ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 198/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23447 ms. Remains : 111/117 places, 198/216 transitions.
[2024-05-24 00:06:47] [INFO ] Flatten gal took : 28 ms
[2024-05-24 00:06:47] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:06:47] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-24 00:06:47] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:06:47] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:06:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14838055751899925201.gal : 12 ms
[2024-05-24 00:06:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7159370650899797445.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/CTLFireability14838055751899925201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7159370650899797445.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,24617,2.0057,48800,2,11856,5,129101,6,0,645,141739,0
Converting to forward existential form...Done !
original formula: EG(!(E(!((((turn_2==1)&&(flag_2_active==1))&&(p25_1_0==1))) U AX(AX((p34_0_2==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!((((turn_2==1)&&(flag_2_active==1))&&(p25_1_0==1))) U !(EX(!(!(EX(!((p34_0_2==1))))))))))] != FA...158
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t42, t43,...683
(forward)formula 0,1,8.53747,194072,1,0,486,713590,422,205,4328,575496,413
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 14 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
[2024-05-24 00:06:56] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2024-05-24 00:06:56] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 00:06:56] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-24 00:06:56] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-05-24 00:06:56] [INFO ] Invariant cache hit.
[2024-05-24 00:06:56] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-24 00:06:56] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-24 00:06:56] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-05-24 00:06:56] [INFO ] Invariant cache hit.
[2024-05-24 00:06:56] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:06:57] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:06:57] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:06:58] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-05-24 00:06:58] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-24 00:06:58] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-24 00:06:58] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:06:58] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:06:58] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-24 00:06:58] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-24 00:06:58] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:06:58] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-24 00:06:58] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-24 00:06:58] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2024-05-24 00:06:59] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-24 00:06:59] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-24 00:06:59] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-24 00:06:59] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-24 00:06:59] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-24 00:06:59] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2024-05-24 00:07:00] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:07:00] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-24 00:07:00] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-05-24 00:07:00] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/145 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/191 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:07:04] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 192 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12645 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:07:10] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:07:10] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 00:07:10] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-24 00:07:10] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/150 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 198/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:07:13] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
[2024-05-24 00:07:13] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-24 00:07:13] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-24 00:07:13] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:07:14] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:07:14] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 6/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:07:16] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:07:18] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:07:20] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-24 00:07:20] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:07:24] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:07:28] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-24 00:07:28] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/250 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:07:32] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:07:32] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 17 (OVERLAPS) 0/250 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 409 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 43/43 constraints]
After SMT, in 42710ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 42712ms
Starting structural reductions in LTL mode, iteration 1 : 112/117 places, 201/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43133 ms. Remains : 112/117 places, 201/216 transitions.
[2024-05-24 00:07:39] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:07:39] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:07:39] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-24 00:07:39] [INFO ] Flatten gal took : 22 ms
[2024-05-24 00:07:39] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:07:39] [INFO ] Time to serialize gal into /tmp/CTLFireability14376533691651764298.gal : 3 ms
[2024-05-24 00:07:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5334088930933176494.ctl : 25 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/CTLFireability14376533691651764298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5334088930933176494.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,25695,2.06816,52664,2,12392,5,138717,6,0,652,150597,0
Converting to forward existential form...Done !
original formula: (EG((((EG(((flag_2_waiting==0)||(p09_0_2==0))) * !(A((((turn_0==1)&&(flag_0_waiting==1))&&(p25_1_3==1)) U (((turn_2==1)&&(flag_2_active==...743
=> equivalent forward existential formula: ([FwdG(Init,(((EG(((flag_2_waiting==0)||(p09_0_2==0))) * !(!((E(!((((turn_2==1)&&(flag_2_active==1))&&(p25_2_3==...1075
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t42, t43, t44, t45,...691
(forward)formula 0,0,8.29618,186120,1,0,513,799142,456,222,4241,548439,451
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 213
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 114 transition count 184
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 85 transition count 184
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 79 transition count 166
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 79 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 73 transition count 160
Applied a total of 88 rules in 24 ms. Remains 73 /117 variables (removed 44) and now considering 160/216 (removed 56) transitions.
[2024-05-24 00:07:48] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
// Phase 1: matrix 97 rows 73 cols
[2024-05-24 00:07:48] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 00:07:48] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-24 00:07:48] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 00:07:48] [INFO ] Invariant cache hit.
[2024-05-24 00:07:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:07:48] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2024-05-24 00:07:48] [INFO ] Redundant transitions in 5 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-24 00:07:48] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 00:07:48] [INFO ] Invariant cache hit.
[2024-05-24 00:07:48] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:07:49] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
[2024-05-24 00:07:49] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-24 00:07:49] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-24 00:07:49] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:07:49] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:07:49] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:07:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-24 00:07:50] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-24 00:07:50] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:07:50] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-24 00:07:50] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-24 00:07:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-24 00:07:50] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-24 00:07:50] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:07:50] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-24 00:07:50] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 00:07:50] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:07:50] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-24 00:07:50] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 0 ms to minimize.
[2024-05-24 00:07:51] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/103 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 44/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:07:53] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:07:53] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:07:53] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/170 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 150 constraints, problems are : Problem set: 0 solved, 157 unsolved in 7939 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/106 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 44/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 157/307 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:07:58] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-24 00:07:59] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:07:59] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:08:00] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 311 constraints, problems are : Problem set: 0 solved, 157 unsolved in 7332 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 27/27 constraints]
After SMT, in 15336ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 15338ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/117 places, 160/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16100 ms. Remains : 73/117 places, 160/216 transitions.
[2024-05-24 00:08:04] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:08:04] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:08:04] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-24 00:08:04] [INFO ] Flatten gal took : 18 ms
[2024-05-24 00:08:04] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:08:04] [INFO ] Time to serialize gal into /tmp/CTLFireability627575302771446851.gal : 2 ms
[2024-05-24 00:08:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16378674199394715168.ctl : 21 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/CTLFireability627575302771446851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16378674199394715168.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,5595,1.13745,31468,2,7029,5,74610,6,0,455,75913,0
Converting to forward existential form...Done !
original formula: AF(EG(EF(AG((p34_2_1==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U !(E(TRUE U !((p34_2_1==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28,...638
(forward)formula 0,0,4.09191,92712,1,0,419,328823,351,164,3322,256522,335
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 3 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
[2024-05-24 00:08:08] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2024-05-24 00:08:08] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 00:08:08] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-24 00:08:08] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-05-24 00:08:08] [INFO ] Invariant cache hit.
[2024-05-24 00:08:08] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-24 00:08:08] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-24 00:08:09] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-05-24 00:08:09] [INFO ] Invariant cache hit.
[2024-05-24 00:08:09] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:08:09] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:08:09] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:08:10] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:08:10] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-05-24 00:08:10] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-24 00:08:10] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2024-05-24 00:08:10] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-24 00:08:10] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-24 00:08:10] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2024-05-24 00:08:10] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2024-05-24 00:08:10] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:08:11] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:08:11] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2024-05-24 00:08:11] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:08:11] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:08:11] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-24 00:08:11] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-24 00:08:11] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2024-05-24 00:08:11] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-24 00:08:12] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:08:12] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:08:12] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-24 00:08:12] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 2 ms to minimize.
[2024-05-24 00:08:12] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-24 00:08:12] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:08:12] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-05-24 00:08:13] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:08:13] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-24 00:08:13] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-24 00:08:13] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-24 00:08:13] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/153 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:08:17] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 200 constraints, problems are : Problem set: 0 solved, 198 unsolved in 13607 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:08:23] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/155 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/201 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 198/399 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:08:26] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:08:26] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:08:28] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:08:34] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/250 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (OVERLAPS) 0/250 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 403 constraints, problems are : Problem set: 0 solved, 198 unsolved in 18195 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 37/37 constraints]
After SMT, in 31841ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 31844ms
Starting structural reductions in LTL mode, iteration 1 : 112/117 places, 201/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32383 ms. Remains : 112/117 places, 201/216 transitions.
[2024-05-24 00:08:40] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:08:40] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:08:40] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-24 00:08:40] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:08:40] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:08:40] [INFO ] Time to serialize gal into /tmp/CTLFireability8853696713915429755.gal : 4 ms
[2024-05-24 00:08:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12841062516488527146.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/CTLFireability8853696713915429755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12841062516488527146.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,25508,2.15882,50728,2,12042,5,135005,6,0,652,145970,0
Converting to forward existential form...Done !
original formula: (AG(AX(EF((((turn_2==1)&&(flag_2_active==1))&&(p25_0_3==1))))) * AF((((AG((E(((flag_1_active==1)&&(p18_2_1==1)) U ((turn_2==1)&&(p37_2_0=...785
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(E(TRUE U (((turn_2==1)&&(flag_2_active==1))&&(p25_0_3==1)))))] = FALSE * [FwdG(Init,!...907
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t32, t33, t34, t35, t42, t43, t44, t45,...691
(forward)formula 0,1,18.5386,424268,1,0,600,2.50937e+06,451,280,4379,1.22656e+06,592
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 115 transition count 214
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 4 place count 115 transition count 185
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 62 place count 86 transition count 185
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 80 transition count 167
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 80 transition count 167
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 74 transition count 161
Applied a total of 86 rules in 23 ms. Remains 74 /117 variables (removed 43) and now considering 161/216 (removed 55) transitions.
[2024-05-24 00:08:59] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
// Phase 1: matrix 98 rows 74 cols
[2024-05-24 00:08:59] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 00:08:59] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-24 00:08:59] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 00:08:59] [INFO ] Invariant cache hit.
[2024-05-24 00:09:00] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:09:00] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-05-24 00:09:00] [INFO ] Redundant transitions in 5 ms returned []
Running 158 sub problems to find dead transitions.
[2024-05-24 00:09:00] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 00:09:00] [INFO ] Invariant cache hit.
[2024-05-24 00:09:00] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:09:00] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
[2024-05-24 00:09:00] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:09:01] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:09:01] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:09:01] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 00:09:01] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-24 00:09:01] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:09:01] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:09:01] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:09:01] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 00:09:01] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:09:01] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:09:01] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:09:01] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:09:02] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:09:02] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:09:03] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:09:03] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 98/172 variables, 74/102 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 44/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:09:05] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:09:05] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-24 00:09:05] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 149 constraints, problems are : Problem set: 0 solved, 158 unsolved in 7711 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 98/172 variables, 74/105 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 44/149 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 158/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:09:09] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:09:12] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:09:12] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/172 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (OVERLAPS) 0/172 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 310 constraints, problems are : Problem set: 0 solved, 158 unsolved in 8455 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 24/24 constraints]
After SMT, in 16223ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 16225ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/117 places, 161/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16869 ms. Remains : 74/117 places, 161/216 transitions.
[2024-05-24 00:09:16] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:09:16] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:09:16] [INFO ] Input system was already deterministic with 161 transitions.
[2024-05-24 00:09:16] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:09:16] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:09:16] [INFO ] Time to serialize gal into /tmp/CTLFireability11010571123782715900.gal : 1 ms
[2024-05-24 00:09:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8155680227477376411.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/CTLFireability11010571123782715900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8155680227477376411.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,6260,1.07271,33044,2,7484,5,79660,6,0,460,79667,0
Converting to forward existential form...Done !
original formula: E((p19_0_0==1) U EF((((turn_2==1)&&(flag_2_active==1))&&(p25_0_3==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(p19_0_0==1)),TRUE) * (((turn_2==1)&&(flag_2_active==1))&&(p25_0_3==1)))] != FALSE
Hit Full ! (commute/partial/dont) 159/0/2
(forward)formula 0,1,1.7388,34364,1,0,7,80246,16,1,914,79667,6
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 2 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
[2024-05-24 00:09:18] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-05-24 00:09:18] [INFO ] Computed 10 invariants in 6 ms
[2024-05-24 00:09:18] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-24 00:09:18] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:09:18] [INFO ] Invariant cache hit.
[2024-05-24 00:09:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:09:18] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-24 00:09:18] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:09:18] [INFO ] Invariant cache hit.
[2024-05-24 00:09:18] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:09:19] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:09:19] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:09:19] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:09:19] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:09:19] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:09:20] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-24 00:09:20] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:09:20] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-05-24 00:09:20] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-24 00:09:20] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-24 00:09:20] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-24 00:09:20] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-24 00:09:20] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-24 00:09:20] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-24 00:09:20] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2024-05-24 00:09:21] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-05-24 00:09:21] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-24 00:09:21] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-24 00:09:21] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-24 00:09:21] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:09:21] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:09:21] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:09:21] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-24 00:09:21] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
[2024-05-24 00:09:22] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:09:22] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-24 00:09:22] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:09:26] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-05-24 00:09:26] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12763 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:09:32] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:09:34] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-24 00:09:34] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-05-24 00:09:34] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:09:36] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 10645 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 23468ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 23471ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 198/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23796 ms. Remains : 111/117 places, 198/216 transitions.
[2024-05-24 00:09:42] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:09:42] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:09:42] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-24 00:09:42] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:09:42] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:09:42] [INFO ] Time to serialize gal into /tmp/CTLFireability14492645317140585043.gal : 2 ms
[2024-05-24 00:09:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9703951464897264478.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/CTLFireability14492645317140585043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9703951464897264478.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,24617,1.95944,48704,2,11856,5,129101,6,0,645,141739,0
Converting to forward existential form...Done !
original formula: AG(EF(EX(E((((turn_0==1)&&(flag_0_active==1))&&(p25_2_1==1)) U (((turn_2==1)&&(flag_2_active==1))&&(p25_2_3==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX(E((((turn_0==1)&&(flag_0_active==1))&&(p25_2_1==1)) U (((turn_2==1)&&(flag_2_a...194
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t42, t43,...683
(forward)formula 0,1,16.9088,328352,1,0,534,1.76271e+06,421,235,4199,849115,497
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 204
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 204
Applied a total of 8 rules in 3 ms. Remains 113 /117 variables (removed 4) and now considering 204/216 (removed 12) transitions.
[2024-05-24 00:09:59] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
// Phase 1: matrix 141 rows 113 cols
[2024-05-24 00:09:59] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 00:09:59] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-24 00:09:59] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2024-05-24 00:09:59] [INFO ] Invariant cache hit.
[2024-05-24 00:09:59] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 00:09:59] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-24 00:09:59] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2024-05-24 00:09:59] [INFO ] Invariant cache hit.
[2024-05-24 00:09:59] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-24 00:10:00] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-24 00:10:00] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:10:00] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:10:00] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:10:00] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:10:00] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:10:00] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-24 00:10:01] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:10:01] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:10:01] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-24 00:10:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-24 00:10:01] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:10:01] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
[2024-05-24 00:10:01] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:10:01] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-24 00:10:02] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 00:10:02] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-24 00:10:03] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 141/254 variables, 113/141 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 48/189 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/254 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 189 constraints, problems are : Problem set: 0 solved, 201 unsolved in 11604 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 141/254 variables, 113/141 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 48/189 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 201/390 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-24 00:10:13] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:10:13] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:10:13] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-24 00:10:14] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:10:15] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-24 00:10:17] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-24 00:10:18] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-24 00:10:23] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/254 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (OVERLAPS) 0/254 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 398 constraints, problems are : Problem set: 0 solved, 201 unsolved in 19763 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 26/26 constraints]
After SMT, in 31410ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 31414ms
Starting structural reductions in LTL mode, iteration 1 : 113/117 places, 204/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31711 ms. Remains : 113/117 places, 204/216 transitions.
[2024-05-24 00:10:30] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:10:30] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:10:31] [INFO ] Input system was already deterministic with 204 transitions.
[2024-05-24 00:10:31] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:10:31] [INFO ] Flatten gal took : 19 ms
[2024-05-24 00:10:31] [INFO ] Time to serialize gal into /tmp/CTLFireability2775652459009400642.gal : 1 ms
[2024-05-24 00:10:31] [INFO ] Time to serialize properties into /tmp/CTLFireability607709117735829819.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/CTLFireability2775652459009400642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability607709117735829819.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,27409,2.26481,59332,2,12773,5,152105,6,0,659,170142,0
Converting to forward existential form...Done !
original formula: E((AX(EF(((((p19_2_0==1)&&(turn_0==1))&&((flag_0_waiting==1)&&(p25_1_2==1)))&&(!((turn_0==1)&&(p07_0==1)))))) * E(E(((((turn_1==1)&&(flag...582
=> equivalent forward existential formula: [FwdG(((FwdU(Init,(!(EX(!(E(TRUE U ((((p19_2_0==1)&&(turn_0==1))&&((flag_0_waiting==1)&&(p25_1_2==1)))&&(!((turn...671
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t42, t44,...707
Detected timeout of ITS tools.
[2024-05-24 00:11:01] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:11:01] [INFO ] Applying decomposition
[2024-05-24 00:11:01] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12886440389870861704.txt' '-o' '/tmp/graph12886440389870861704.bin' '-w' '/tmp/graph12886440389870861704.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12886440389870861704.bin' '-l' '-1' '-v' '-w' '/tmp/graph12886440389870861704.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:11:01] [INFO ] Decomposing Gal with order
[2024-05-24 00:11:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:11:01] [INFO ] Removed a total of 236 redundant transitions.
[2024-05-24 00:11:01] [INFO ] Flatten gal took : 56 ms
[2024-05-24 00:11:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 12 ms.
[2024-05-24 00:11:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13189802936797697050.gal : 14 ms
[2024-05-24 00:11:01] [INFO ] Time to serialize properties into /tmp/CTLFireability17439160690183525941.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/CTLFireability13189802936797697050.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17439160690183525941.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,27409,1.33442,28212,1568,231,29191,860,691,122495,94,4998,0
Converting to forward existential form...Done !
original formula: E((AX(EF(((((i9.i0.u23.p19_2_0==1)&&(i8.u2.turn_0==1))&&((i5.i0.u1.flag_0_waiting==1)&&(i5.i0.u1.p25_1_2==1)))&&(!((i8.u2.turn_0==1)&&(i2...802
=> equivalent forward existential formula: [FwdG(((FwdU(Init,(!(EX(!(E(TRUE U ((((i9.i0.u23.p19_2_0==1)&&(i8.u2.turn_0==1))&&((i5.i0.u1.flag_0_waiting==1)&...891
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t42, t44,...679
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
(forward)formula 0,1,6.4502,137772,1,0,204162,3623,3795,666341,386,16181,601472
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 2 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
[2024-05-24 00:11:07] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-05-24 00:11:07] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 00:11:07] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-24 00:11:07] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:11:07] [INFO ] Invariant cache hit.
[2024-05-24 00:11:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:11:08] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-24 00:11:08] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:11:08] [INFO ] Invariant cache hit.
[2024-05-24 00:11:08] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:11:09] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:11:09] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-24 00:11:09] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-24 00:11:09] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-24 00:11:09] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:11:09] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-24 00:11:09] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-24 00:11:09] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:11:09] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 00:11:10] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-24 00:11:10] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-24 00:11:10] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:11:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 00:11:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 00:11:10] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-05-24 00:11:10] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-24 00:11:10] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-24 00:11:10] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-24 00:11:10] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:11:10] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:11:11] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:11:11] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-24 00:11:11] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-24 00:11:11] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-24 00:11:11] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:11:12] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-24 00:11:12] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:11:15] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-24 00:11:15] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12776 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:11:22] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:11:24] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:11:24] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-05-24 00:11:24] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:11:25] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 10724 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 23537ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 23540ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 198/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23935 ms. Remains : 111/117 places, 198/216 transitions.
[2024-05-24 00:11:31] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:11:31] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:11:31] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-24 00:11:31] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:11:31] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:11:31] [INFO ] Time to serialize gal into /tmp/CTLFireability8850921900898359833.gal : 11 ms
[2024-05-24 00:11:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2724478813243405641.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/CTLFireability8850921900898359833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2724478813243405641.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,24617,1.89263,48836,2,11856,5,129101,6,0,645,141739,0
Converting to forward existential form...Done !
original formula: EX((p08_1_2==0))
=> equivalent forward existential formula: [(EY(Init) * (p08_1_2==0))] != FALSE
(forward)formula 0,1,1.90176,48836,1,0,8,129101,8,1,932,141739,2
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 2 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
[2024-05-24 00:11:33] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2024-05-24 00:11:33] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 00:11:33] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-24 00:11:33] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-05-24 00:11:33] [INFO ] Invariant cache hit.
[2024-05-24 00:11:33] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-24 00:11:34] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-24 00:11:34] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-05-24 00:11:34] [INFO ] Invariant cache hit.
[2024-05-24 00:11:34] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:11:34] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:11:34] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:11:35] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2024-05-24 00:11:35] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-24 00:11:35] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:11:35] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:11:35] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:11:35] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 14 ms to minimize.
[2024-05-24 00:11:35] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-05-24 00:11:35] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-05-24 00:11:36] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:11:36] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-24 00:11:36] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:11:36] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-24 00:11:36] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2024-05-24 00:11:36] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-24 00:11:36] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-05-24 00:11:36] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 2 ms to minimize.
[2024-05-24 00:11:37] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-24 00:11:37] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:11:37] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-24 00:11:37] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-05-24 00:11:37] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2024-05-24 00:11:37] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
[2024-05-24 00:11:38] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-24 00:11:38] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2024-05-24 00:11:38] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:11:38] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:11:38] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:11:38] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-24 00:11:38] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/153 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:11:42] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 200 constraints, problems are : Problem set: 0 solved, 198 unsolved in 13764 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:11:48] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/155 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/201 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 198/399 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:11:51] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-24 00:11:51] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:11:53] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-24 00:11:59] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/250 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (OVERLAPS) 0/250 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 403 constraints, problems are : Problem set: 0 solved, 198 unsolved in 18268 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 37/37 constraints]
After SMT, in 32099ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 32101ms
Starting structural reductions in LTL mode, iteration 1 : 112/117 places, 201/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32435 ms. Remains : 112/117 places, 201/216 transitions.
[2024-05-24 00:12:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:12:06] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:12:06] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-24 00:12:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:12:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:12:06] [INFO ] Time to serialize gal into /tmp/CTLFireability872061974449148563.gal : 1 ms
[2024-05-24 00:12:06] [INFO ] Time to serialize properties into /tmp/CTLFireability3910298645136425376.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/CTLFireability872061974449148563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3910298645136425376.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,25508,1.96003,50704,2,12042,5,135005,6,0,652,145970,0
Converting to forward existential form...Done !
original formula: AF(((((turn_2==1)&&(flag_2_active==1))&&(p25_0_3==1)) + (((AX(AF((((turn_1==1)&&(flag_1_active==1))&&(p25_0_2==1)))) * EG(((turn_1==0)||(...224
=> equivalent forward existential formula: [FwdG(Init,!(((((turn_2==1)&&(flag_2_active==1))&&(p25_0_3==1)) + (((!(EX(!(!(EG(!((((turn_1==1)&&(flag_1_active...281
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t32, t33, t34, t35, t42, t43, t44, t45,...691
(forward)formula 0,0,16.3395,367932,1,0,629,1.39023e+06,437,359,4203,1.50735e+06,577
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 4 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
[2024-05-24 00:12:22] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-05-24 00:12:22] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 00:12:22] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-24 00:12:22] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:12:22] [INFO ] Invariant cache hit.
[2024-05-24 00:12:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:12:23] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-24 00:12:23] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:12:23] [INFO ] Invariant cache hit.
[2024-05-24 00:12:23] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:12:23] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:12:23] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:12:24] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-24 00:12:24] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:12:24] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-05-24 00:12:24] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-24 00:12:24] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-24 00:12:24] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-05-24 00:12:24] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-24 00:12:24] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-24 00:12:24] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-24 00:12:25] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:12:25] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:12:25] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 00:12:25] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
[2024-05-24 00:12:25] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-05-24 00:12:25] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-24 00:12:25] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-24 00:12:25] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-24 00:12:25] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:12:25] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-24 00:12:25] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:12:26] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-24 00:12:26] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-24 00:12:26] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 1 ms to minimize.
[2024-05-24 00:12:26] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-24 00:12:27] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:12:30] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:12:30] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12773 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:12:36] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:12:39] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-24 00:12:39] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-05-24 00:12:39] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-05-24 00:12:40] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 10821 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 23637ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 23639ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 198/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23977 ms. Remains : 111/117 places, 198/216 transitions.
[2024-05-24 00:12:46] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:12:46] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:12:46] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-24 00:12:46] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:12:46] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:12:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15328023913642432454.gal : 2 ms
[2024-05-24 00:12:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6586050960053623062.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/CTLFireability15328023913642432454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6586050960053623062.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,24617,1.90377,48772,2,11856,5,129101,6,0,645,141739,0
Converting to forward existential form...Done !
original formula: EX(EG(((((turn_2==0)||(flag_2_idle==0))||(p25_1_3==0))&&((((p08_1_1==1)||(turn_1==0))||((flag_1_waiting==0)||(p25_0_1==0)))||(((flag_2_ac...307
=> equivalent forward existential formula: [FwdG(EY(Init),((((turn_2==0)||(flag_2_idle==0))||(p25_1_3==0))&&((((p08_1_1==1)||(turn_1==0))||((flag_1_waiting...350
Hit Full ! (commute/partial/dont) 65/22/133
(forward)formula 0,1,9.89469,216704,1,0,9,880228,19,2,3391,632446,9
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2024-05-24 00:12:56] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:12:56] [INFO ] Flatten gal took : 6 ms
Total runtime 670663 ms.
BK_STOP 1716509576779
--------------------
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="EisenbergMcGuire-PT-03"
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 EisenbergMcGuire-PT-03, 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 r158-smll-171636266300146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-03.tgz
mv EisenbergMcGuire-PT-03 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 ;