About the Execution of ITS-Tools for MedleyA-PT-12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1096708.00 | 0.00 | 0.00 | FFTTFFTTTFFFFFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100186.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is MedleyA-PT-12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100186
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 43K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-12-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-12-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-12-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-12-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-12-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-12-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-12-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-12-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-12-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-12-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-12-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-12-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-12-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-12-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-12-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-12-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748865517052
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 11:58:39] [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]
[2025-06-02 11:58:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 11:58:40] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2025-06-02 11:58:40] [INFO ] Transformed 172 places.
[2025-06-02 11:58:40] [INFO ] Transformed 166 transitions.
[2025-06-02 11:58:40] [INFO ] Found NUPN structural information;
[2025-06-02 11:58:40] [INFO ] Parsed PT model containing 172 places and 166 transitions and 466 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Support contains 97 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 168 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 164 transition count 162
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 164 transition count 162
Applied a total of 12 rules in 40 ms. Remains 164 /172 variables (removed 8) and now considering 162/166 (removed 4) transitions.
// Phase 1: matrix 162 rows 164 cols
[2025-06-02 11:58:40] [INFO ] Computed 20 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 11:58:40] [INFO ] Implicit Places using invariants in 368 ms returned []
[2025-06-02 11:58:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 11:58:40] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-02 11:58:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:45] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:45] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:45] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:45] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:45] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:45] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:46] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:46] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:46] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:46] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:46] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:46] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:46] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:47] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:47] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:47] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:47] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:47] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:47] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:47] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:48] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:48] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:48] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 162/326 variables, 164/207 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:58:53] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:00] [INFO ] Deduced a trap along path composed of 4 places in 66 ms of which 14 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/326 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (OVERLAPS) 0/326 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 209 constraints, problems are : Problem set: 0 solved, 161 unsolved in 28982 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 162/326 variables, 164/208 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 161/369 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:12] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:12] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:13] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:16] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:17] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:17] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:20] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:31] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:38] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 379 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 59144ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 59169ms
Starting structural reductions in LTL mode, iteration 1 : 164/172 places, 162/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59971 ms. Remains : 164/172 places, 162/166 transitions.
Support contains 97 out of 164 places after structural reductions.
[2025-06-02 11:59:40] [INFO ] Flatten gal took : 61 ms
[2025-06-02 11:59:40] [INFO ] Flatten gal took : 27 ms
[2025-06-02 11:59:40] [INFO ] Input system was already deterministic with 162 transitions.
RANDOM walk for 40000 steps (816 resets) in 2404 ms. (16 steps per ms) remains 12/86 properties
BEST_FIRST walk for 40003 steps (212 resets) in 343 ms. (116 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (233 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (198 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (222 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (176 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (215 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (181 resets) in 113 ms. (350 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (259 resets) in 136 ms. (291 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (221 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (185 resets) in 163 ms. (243 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (171 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
[2025-06-02 11:59:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 1 (OVERLAPS) 110/132 variables, 12/12 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:42] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:42] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:42] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 3/15 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 4 (OVERLAPS) 32/164 variables, 8/23 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:42] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:43] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:43] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:43] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:43] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 9 ms to minimize.
Problem AtomicPropp29 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 5/28 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/28 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 162/326 variables, 164/192 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:43] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:43] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 2/194 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/194 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/326 variables, 0/194 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 194 constraints, problems are : Problem set: 6 solved, 3 unsolved in 1916 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/56 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 73/129 variables, 9/12 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 4/16 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/16 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 35/164 variables, 8/24 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 6/30 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:44] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:44] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:44] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:44] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:44] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 5/35 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/35 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 162/326 variables, 164/199 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 3/202 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:44] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 1/203 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/203 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/203 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 203 constraints, problems are : Problem set: 6 solved, 3 unsolved in 1236 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 3/9 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3185ms problems are : Problem set: 6 solved, 3 unsolved
Parikh walk visited 0 properties in 690 ms.
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 162/162 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 163 transition count 137
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 138 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 137 transition count 135
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 54 place count 137 transition count 109
Deduced a syphon composed of 26 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 107 place count 110 transition count 109
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 109 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 108 transition count 108
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 121 place count 97 transition count 97
Iterating global reduction 5 with 11 rules applied. Total rules applied 132 place count 97 transition count 97
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 132 place count 97 transition count 94
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 138 place count 94 transition count 94
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 93 transition count 93
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 93 transition count 93
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 141 place count 92 transition count 92
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 92 transition count 92
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 91 transition count 91
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 91 transition count 91
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 190 place count 68 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 202 place count 62 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 62 transition count 78
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 210 place count 62 transition count 71
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 217 place count 55 transition count 71
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 220 place count 55 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 223 place count 52 transition count 68
Applied a total of 223 rules in 83 ms. Remains 52 /164 variables (removed 112) and now considering 68/162 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 52/164 places, 68/162 transitions.
RANDOM walk for 40000 steps (3697 resets) in 743 ms. (53 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (1037 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1042 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
// Phase 1: matrix 68 rows 52 cols
[2025-06-02 11:59:46] [INFO ] Computed 17 invariants in 4 ms
[2025-06-02 11:59:46] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/38 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/52 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 68/120 variables, 52/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 81 constraints, problems are : Problem set: 0 solved, 2 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/38 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:59:46] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/52 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 68/120 variables, 52/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/120 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 84 constraints, problems are : Problem set: 0 solved, 2 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 421ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 68/68 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 52 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 67
Applied a total of 2 rules in 8 ms. Remains 51 /52 variables (removed 1) and now considering 67/68 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 51/52 places, 67/68 transitions.
RANDOM walk for 40000 steps (4004 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1058 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1041 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 12734 steps, run visited all 2 properties in 70 ms. (steps per millisecond=181 )
Probabilistic random walk after 12734 steps, saw 3663 distinct states, run finished after 76 ms. (steps per millisecond=167 ) properties seen :2
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-12-CTLFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 11:59:47] [INFO ] Flatten gal took : 14 ms
[2025-06-02 11:59:47] [INFO ] Flatten gal took : 15 ms
[2025-06-02 11:59:47] [INFO ] Input system was already deterministic with 162 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 162
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 152 transition count 151
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 152 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 151 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 151 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 150 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 150 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 149 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 149 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 148 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 148 transition count 147
Applied a total of 31 rules in 21 ms. Remains 148 /164 variables (removed 16) and now considering 147/162 (removed 15) transitions.
// Phase 1: matrix 147 rows 148 cols
[2025-06-02 11:59:47] [INFO ] Computed 19 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 11:59:47] [INFO ] Implicit Places using invariants in 121 ms returned [32, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 124 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/164 places, 147/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 146/164 places, 147/162 transitions.
[2025-06-02 11:59:47] [INFO ] Flatten gal took : 11 ms
[2025-06-02 11:59:47] [INFO ] Flatten gal took : 11 ms
[2025-06-02 11:59:47] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-02 11:59:47] [INFO ] Flatten gal took : 11 ms
[2025-06-02 11:59:47] [INFO ] Flatten gal took : 11 ms
[2025-06-02 11:59:47] [INFO ] Time to serialize gal into /tmp/CTLFireability13632173825312640924.gal : 6 ms
[2025-06-02 11:59:47] [INFO ] Time to serialize properties into /tmp/CTLFireability10303057231870018704.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13632173825312640924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10303057231870018704.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,7.98332e+08,1.90402,45204,2,8865,5,169460,6,0,733,215975,0
Converting to forward existential form...Done !
original formula: AX((AX(AX(A((p2==1) U (((p26==1)&&(p34==1))&&((p38==1)&&(p48==1)))))) + AG(EF((((p43==1)&&(p112==1))&&(((p25==0)||(p33==0))||((p39==0)||(...169
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(!(EX(!(!(EX(!(!((E(!((((p26==1)&&(p34==1))&&((p38==1)&&(p48==1)))) U (!((p2==1)) * !((((p26...361
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t19, t35, t50, t52, t59...298
Detected timeout of ITS tools.
[2025-06-02 12:00:17] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:00:17] [INFO ] Applying decomposition
[2025-06-02 12:00:17] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12166577801696526702.txt' '-o' '/tmp/graph12166577801696526702.bin' '-w' '/tmp/graph12166577801696526702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12166577801696526702.bin' '-l' '-1' '-v' '-w' '/tmp/graph12166577801696526702.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:00:17] [INFO ] Decomposing Gal with order
[2025-06-02 12:00:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:00:17] [INFO ] Removed a total of 19 redundant transitions.
[2025-06-02 12:00:17] [INFO ] Flatten gal took : 73 ms
[2025-06-02 12:00:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-02 12:00:17] [INFO ] Time to serialize gal into /tmp/CTLFireability14404900452143430035.gal : 12 ms
[2025-06-02 12:00:17] [INFO ] Time to serialize properties into /tmp/CTLFireability1641779444449489979.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14404900452143430035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1641779444449489979.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,7.98332e+08,0.670359,25768,674,424,21161,18083,439,63648,96,176990,0
Converting to forward existential form...Done !
original formula: AX((AX(AX(A((i0.u2.p2==1) U (((i3.u12.p26==1)&&(i3.u12.p34==1))&&((i3.u12.p38==1)&&(i3.u12.p48==1)))))) + AG(EF((((i4.i1.u14.p43==1)&&(i4...251
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(!(EX(!(!(EX(!(!((E(!((((i3.u12.p26==1)&&(i3.u12.p34==1))&&((i3.u12.p38==1)&&(i3.u12.p48==1)...499
Reverse transition relation is NOT exact ! Due to transitions t19, t35, t52, t65, i1.u1.t103, i3.u12.t0, i3.u12.t1, i3.u12.t2, i3.u12.t3, i3.u12.t4, i3.u12...488
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,15.225,289340,1,0,392462,32856,2976,1.3947e+06,729,270331,504895
FORMULA MedleyA-PT-12-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 162 transition count 139
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 140 transition count 137
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 139 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 137 transition count 135
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 52 place count 137 transition count 109
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 104 place count 111 transition count 109
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 107 place count 109 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 108 place count 108 transition count 108
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 123 place count 93 transition count 82
Iterating global reduction 6 with 15 rules applied. Total rules applied 138 place count 93 transition count 82
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 138 place count 93 transition count 78
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 146 place count 89 transition count 78
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 147 place count 88 transition count 77
Iterating global reduction 6 with 1 rules applied. Total rules applied 148 place count 88 transition count 77
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 149 place count 87 transition count 76
Iterating global reduction 6 with 1 rules applied. Total rules applied 150 place count 87 transition count 76
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 151 place count 86 transition count 75
Iterating global reduction 6 with 1 rules applied. Total rules applied 152 place count 86 transition count 75
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 194 place count 65 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 195 place count 64 transition count 53
Applied a total of 195 rules in 36 ms. Remains 64 /164 variables (removed 100) and now considering 53/162 (removed 109) transitions.
// Phase 1: matrix 53 rows 64 cols
[2025-06-02 12:00:33] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:00:33] [INFO ] Implicit Places using invariants in 83 ms returned [8, 13, 18, 31, 35, 39]
[2025-06-02 12:00:33] [INFO ] Actually due to overlaps returned [35, 8, 13, 18, 39]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 85 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/164 places, 53/162 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 59 transition count 50
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 56 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 56 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 55 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 53 transition count 47
Applied a total of 12 rules in 7 ms. Remains 53 /59 variables (removed 6) and now considering 47/53 (removed 6) transitions.
// Phase 1: matrix 47 rows 53 cols
[2025-06-02 12:00:33] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:00:33] [INFO ] Implicit Places using invariants in 59 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 52/164 places, 47/162 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 46
Applied a total of 2 rules in 7 ms. Remains 51 /52 variables (removed 1) and now considering 46/47 (removed 1) transitions.
// Phase 1: matrix 46 rows 51 cols
[2025-06-02 12:00:33] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:00:33] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-02 12:00:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:00:33] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 51/164 places, 46/162 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 367 ms. Remains : 51/164 places, 46/162 transitions.
[2025-06-02 12:00:33] [INFO ] Flatten gal took : 17 ms
[2025-06-02 12:00:33] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:00:33] [INFO ] Input system was already deterministic with 46 transitions.
[2025-06-02 12:00:33] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:00:33] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:00:33] [INFO ] Time to serialize gal into /tmp/CTLFireability18373999550516650811.gal : 1 ms
[2025-06-02 12:00:33] [INFO ] Time to serialize properties into /tmp/CTLFireability16822613656035803747.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18373999550516650811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16822613656035803747.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,214827,0.02876,4224,2,466,5,2562,6,0,253,1986,0
Converting to forward existential form...Done !
original formula: AF(AG(!(A((p169==1) U (p78==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(!((E(!((p78==1)) U (!((p169==1)) * !((p78==1)))) + EG(!((p78==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,4.89393,125800,1,0,375,844042,126,222,1527,697227,499
FORMULA MedleyA-PT-12-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 162
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 152 transition count 151
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 152 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 151 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 151 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 150 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 150 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 149 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 149 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 148 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 148 transition count 147
Applied a total of 31 rules in 35 ms. Remains 148 /164 variables (removed 16) and now considering 147/162 (removed 15) transitions.
// Phase 1: matrix 147 rows 148 cols
[2025-06-02 12:00:38] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:00:38] [INFO ] Implicit Places using invariants in 156 ms returned [32, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 157 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/164 places, 147/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 198 ms. Remains : 146/164 places, 147/162 transitions.
[2025-06-02 12:00:38] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:00:38] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:00:38] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-02 12:00:38] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:00:38] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:00:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8121239634183064962.gal : 4 ms
[2025-06-02 12:00:38] [INFO ] Time to serialize properties into /tmp/CTLFireability2358746400623725413.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8121239634183064962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2358746400623725413.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.98332e+08,1.86913,45380,2,8865,5,169460,6,0,733,215975,0
Converting to forward existential form...Done !
original formula: (AX(((p78==1) + AG((((p141==0)&&(p54==0)) + !(E((p2==1) U (((p25==1)&&(p34==1))&&((p39==1)&&(p47==1))))))))) + EF(((AG((p37==1)) + AX((p1...224
=> equivalent forward existential formula: [(FwdU((FwdU((EY((Init * !(E(TRUE U ((!(E(TRUE U !((p37==1)))) + !(EX(!((p130==1))))) + ((!(E(TRUE U !(((p45==0)...330
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t19, t35, t50, t52, t59...298
Detected timeout of ITS tools.
[2025-06-02 12:01:08] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:01:08] [INFO ] Applying decomposition
[2025-06-02 12:01:08] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18073497193585586452.txt' '-o' '/tmp/graph18073497193585586452.bin' '-w' '/tmp/graph18073497193585586452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18073497193585586452.bin' '-l' '-1' '-v' '-w' '/tmp/graph18073497193585586452.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:01:08] [INFO ] Decomposing Gal with order
[2025-06-02 12:01:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:01:08] [INFO ] Removed a total of 19 redundant transitions.
[2025-06-02 12:01:08] [INFO ] Flatten gal took : 30 ms
[2025-06-02 12:01:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-02 12:01:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16651313939194956197.gal : 9 ms
[2025-06-02 12:01:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6997923396912387423.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16651313939194956197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6997923396912387423.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,7.98332e+08,1.08672,25468,858,423,24703,14649,423,61902,92,150685,0
Converting to forward existential form...Done !
original formula: (AX(((i5.i1.u26.p78==1) + AG((((i4.i0.u17.p141==0)&&(i4.i0.u17.p54==0)) + !(E((i0.u4.p2==1) U (((i2.u12.p25==1)&&(i2.u12.p34==1))&&((i2.u...338
=> equivalent forward existential formula: [(FwdU((FwdU((EY((Init * !(E(TRUE U ((!(E(TRUE U !((i2.u14.p37==1)))) + !(EX(!((i8.i0.u45.p130==1))))) + ((!(E(T...444
Reverse transition relation is NOT exact ! Due to transitions t19, t35, t65, i2.u12.t0, i2.u12.t1, i2.u12.t2, i2.u12.t3, i2.u12.t4, i2.u12.t5, i2.u12.t6, i...491
(forward)formula 0,1,2.71488,53628,1,0,92738,14649,2381,183205,661,150685,222514
FORMULA MedleyA-PT-12-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 162
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 152 transition count 151
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 152 transition count 151
Applied a total of 23 rules in 7 ms. Remains 152 /164 variables (removed 12) and now considering 151/162 (removed 11) transitions.
// Phase 1: matrix 151 rows 152 cols
[2025-06-02 12:01:11] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:01:11] [INFO ] Implicit Places using invariants in 102 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/164 places, 151/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 151/164 places, 151/162 transitions.
[2025-06-02 12:01:11] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:01:11] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:01:11] [INFO ] Input system was already deterministic with 151 transitions.
[2025-06-02 12:01:11] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:01:11] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:01:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5995398371999848084.gal : 2 ms
[2025-06-02 12:01:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15865718485276586906.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5995398371999848084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15865718485276586906.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.48802e+08,2.51658,55956,2,10592,5,207616,6,0,757,276606,0
Converting to forward existential form...Done !
original formula: (AG(((((((((EX((p79==1)) * (p27==0)) * ((p23==1)&&(p171==1))) * ((p70==0)||(p81==0))) + (((p25==1)&&(p34==1))&&((p39==1)&&(p48==1)))) + A...546
=> equivalent forward existential formula: [(((FwdU((Init * !(!(E(TRUE U !(((((((((EX((p79==1)) * (p27==0)) * ((p23==1)&&(p171==1))) * ((p70==0)||(p81==0))...762
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t19, t35, t50, t52, t59...293
Detected timeout of ITS tools.
[2025-06-02 12:01:41] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:01:41] [INFO ] Applying decomposition
[2025-06-02 12:01:41] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1441219258331346249.txt' '-o' '/tmp/graph1441219258331346249.bin' '-w' '/tmp/graph1441219258331346249.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1441219258331346249.bin' '-l' '-1' '-v' '-w' '/tmp/graph1441219258331346249.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:01:42] [INFO ] Decomposing Gal with order
[2025-06-02 12:01:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:01:42] [INFO ] Removed a total of 23 redundant transitions.
[2025-06-02 12:01:42] [INFO ] Flatten gal took : 17 ms
[2025-06-02 12:01:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2025-06-02 12:01:42] [INFO ] Time to serialize gal into /tmp/CTLFireability1705471667428902319.gal : 4 ms
[2025-06-02 12:01:42] [INFO ] Time to serialize properties into /tmp/CTLFireability4709942048961765609.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1705471667428902319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4709942048961765609.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.48802e+08,0.208023,10620,1025,423,10951,2245,464,27812,98,13520,0
Converting to forward existential form...Done !
original formula: (AG(((((((((EX((i5.u24.p79==1)) * (i1.i0.u6.p27==0)) * ((i1.i1.u8.p23==1)&&(i9.u59.p171==1))) * ((i5.u21.p70==0)||(i5.u26.p81==0))) + (((...901
=> equivalent forward existential formula: [(((FwdU((Init * !(!(E(TRUE U !(((((((((EX((i5.u24.p79==1)) * (i1.i0.u6.p27==0)) * ((i1.i1.u8.p23==1)&&(i9.u59.p...1189
Reverse transition relation is NOT exact ! Due to transitions t19, t35, t52, i0.i1.u0.t105, i1.i0.u6.t0, i1.i0.u6.t1, i1.i0.u6.t2, i1.i0.u6.t3, i1.i0.u6.t4...503
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,25.0171,564804,1,0,1.06882e+06,13459,3617,1.84282e+06,804,66810,1293243
FORMULA MedleyA-PT-12-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 148 transition count 136
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 148 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 147 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 147 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 146 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 146 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 145 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 145 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 144 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 144 transition count 132
Applied a total of 39 rules in 22 ms. Remains 144 /164 variables (removed 20) and now considering 132/162 (removed 30) transitions.
// Phase 1: matrix 132 rows 144 cols
[2025-06-02 12:02:07] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:02:07] [INFO ] Implicit Places using invariants in 168 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 169 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/164 places, 132/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 194 ms. Remains : 143/164 places, 132/162 transitions.
[2025-06-02 12:02:07] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:02:07] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:02:07] [INFO ] Input system was already deterministic with 132 transitions.
[2025-06-02 12:02:07] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:02:07] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:02:07] [INFO ] Time to serialize gal into /tmp/CTLFireability4486482665419636153.gal : 2 ms
[2025-06-02 12:02:07] [INFO ] Time to serialize properties into /tmp/CTLFireability5924085824897069296.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4486482665419636153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5924085824897069296.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,5.29132e+08,1.24681,30028,2,8958,5,94212,6,0,706,147963,0
Converting to forward existential form...Done !
original formula: AG((!(E(AX(((p42==1)&&(p114==1))) U ((p135==1)||(p166==1)))) + EF(((p49==0)||(p27==0)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(E(TRUE U ((p49==0)||(p27==0))))),!(EX(!(((p42==1)&&(p114==1)))))) * ((p135==1)||(p16...171
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t8, t19, t21, t36, t38, t45, t50, t56, t59, t62, t63, t65, t73, t74, t77, t80, t83, t...264
(forward)formula 0,1,6.59348,143948,1,0,262,710817,292,132,3926,605764,283
FORMULA MedleyA-PT-12-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 162
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 149 transition count 137
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 149 transition count 137
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 148 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 148 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 147 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 147 transition count 135
Applied a total of 33 rules in 15 ms. Remains 147 /164 variables (removed 17) and now considering 135/162 (removed 27) transitions.
// Phase 1: matrix 135 rows 147 cols
[2025-06-02 12:02:14] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:02:14] [INFO ] Implicit Places using invariants in 159 ms returned [29, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 161 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/164 places, 135/162 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 182 ms. Remains : 145/164 places, 135/162 transitions.
[2025-06-02 12:02:14] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:02:14] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:02:14] [INFO ] Input system was already deterministic with 135 transitions.
[2025-06-02 12:02:14] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:02:14] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:02:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17805986851036246878.gal : 2 ms
[2025-06-02 12:02:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12227056132714454580.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17805986851036246878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12227056132714454580.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,5.70659e+08,1.14174,28036,2,5714,5,90344,6,0,717,131181,0
Converting to forward existential form...Done !
original formula: AG(((AF(AX((p85==1))) + AG((AX((p101==1)) * EX((p80==1))))) + EX((AX((p67==0)) * (((p145==0)||(p157==0))||(p73==0))))))
=> equivalent forward existential formula: ([(EY(FwdU(((FwdU(Init,TRUE) * !(EX((!(EX(!((p67==0)))) * (((p145==0)||(p157==0))||(p73==0)))))) * !(!(EG(!(!(EX...371
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t35, t37, t42, t45, t50, t56, t57, t60, t67, t75, t79, t82, t85, t91, Intersection ...241
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 12:02:44] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:02:44] [INFO ] Applying decomposition
[2025-06-02 12:02:44] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph976024266685976611.txt' '-o' '/tmp/graph976024266685976611.bin' '-w' '/tmp/graph976024266685976611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph976024266685976611.bin' '-l' '-1' '-v' '-w' '/tmp/graph976024266685976611.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:02:44] [INFO ] Decomposing Gal with order
[2025-06-02 12:02:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:02:44] [INFO ] Removed a total of 18 redundant transitions.
[2025-06-02 12:02:44] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:02:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 12:02:44] [INFO ] Time to serialize gal into /tmp/CTLFireability2630611893056421866.gal : 3 ms
[2025-06-02 12:02:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11468327663533863988.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2630611893056421866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11468327663533863988.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,5.70659e+08,0.068044,5844,406,26,3640,269,427,3979,54,497,0
Converting to forward existential form...Done !
original formula: AG(((AF(AX((i8.u29.p85==1))) + AG((AX((i10.i1.u36.p101==1)) * EX((i8.u25.p80==1))))) + EX((AX((i8.u21.p67==0)) * (((i6.i0.u52.p145==0)||(...196
=> equivalent forward existential formula: ([(EY(FwdU(((FwdU(Init,TRUE) * !(EX((!(EX(!((i8.u21.p67==0)))) * (((i6.i0.u52.p145==0)||(i6.i1.u55.p157==0))||(i...471
Reverse transition relation is NOT exact ! Due to transitions t20, t37, i0.i0.u0.t91, i3.u9.t85, i4.u14.t75, i5.i0.u40.t35, i6.t4, i7.u12.t82, i7.u20.t67, ...343
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,4.4655,106324,1,0,210051,432,2504,287433,249,1029,267189
FORMULA MedleyA-PT-12-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 149 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 149 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 148 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 148 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 147 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 147 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 146 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 146 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 145 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 145 transition count 132
Applied a total of 38 rules in 11 ms. Remains 145 /164 variables (removed 19) and now considering 132/162 (removed 30) transitions.
// Phase 1: matrix 132 rows 145 cols
[2025-06-02 12:02:49] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:02:49] [INFO ] Implicit Places using invariants in 114 ms returned [30, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 128 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/164 places, 132/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 143 /143 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 143/164 places, 132/162 transitions.
[2025-06-02 12:02:49] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:02:49] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:02:49] [INFO ] Input system was already deterministic with 132 transitions.
[2025-06-02 12:02:49] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:02:49] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:02:49] [INFO ] Time to serialize gal into /tmp/CTLFireability14345476479504276001.gal : 1 ms
[2025-06-02 12:02:49] [INFO ] Time to serialize properties into /tmp/CTLFireability13873988358087557883.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14345476479504276001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13873988358087557883.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,5.57454e+08,0.777584,24764,2,5039,5,79291,6,0,706,114110,0
Converting to forward existential form...Done !
original formula: AF((((E(!(A(((p41==1)&&(p94==1)) U (p108==1))) U EX((p160!=1))) * EX((p113==1))) * (AX((p2==1)) * AG((((p30==1)&&(p154==1))&&(p162==1))))...204
=> equivalent forward existential formula: [FwdG(Init,!((((E(!(!((E(!((p108==1)) U (!(((p41==1)&&(p94==1))) * !((p108==1)))) + EG(!((p108==1)))))) U EX((p1...314
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t35, t37, t44, t49, t55, t58, t61, t62, t64, t72, t76, t79, t82, t88, Intersection ...241
Detected timeout of ITS tools.
[2025-06-02 12:03:19] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:03:19] [INFO ] Applying decomposition
[2025-06-02 12:03:19] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12279469305291703582.txt' '-o' '/tmp/graph12279469305291703582.bin' '-w' '/tmp/graph12279469305291703582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12279469305291703582.bin' '-l' '-1' '-v' '-w' '/tmp/graph12279469305291703582.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:03:19] [INFO ] Decomposing Gal with order
[2025-06-02 12:03:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:03:19] [INFO ] Removed a total of 19 redundant transitions.
[2025-06-02 12:03:19] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:03:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 12:03:19] [INFO ] Time to serialize gal into /tmp/CTLFireability7472154816447467649.gal : 3 ms
[2025-06-02 12:03:19] [INFO ] Time to serialize properties into /tmp/CTLFireability6456619987658928691.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7472154816447467649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6456619987658928691.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.57454e+08,0.053228,5416,339,28,2808,181,402,3112,52,331,0
Converting to forward existential form...Done !
original formula: AF((((E(!(A(((i9.i0.u14.p41==1)&&(i9.i1.u15.p94==1)) U (i10.i1.u37.p108==1))) U EX((i12.u56.p160!=1))) * EX((i9.i0.u40.p113==1))) * (AX((...303
=> equivalent forward existential formula: [FwdG(Init,!((((E(!(!((E(!((i10.i1.u37.p108==1)) U (!(((i9.i0.u14.p41==1)&&(i9.i1.u15.p94==1))) * !((i10.i1.u37....435
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t37, i3.u11.t82, i4.i0.u0.t88, i4.i1.u18.t72, i6.u13.t79, i6.u22.t64, i7.i0.t62, i7....348
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,2.40686,85544,1,0,185937,369,2780,219979,259,890,219526
FORMULA MedleyA-PT-12-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 162
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 154 transition count 153
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 154 transition count 153
Applied a total of 19 rules in 4 ms. Remains 154 /164 variables (removed 10) and now considering 153/162 (removed 9) transitions.
// Phase 1: matrix 153 rows 154 cols
[2025-06-02 12:03:21] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:03:22] [INFO ] Implicit Places using invariants in 172 ms returned [31, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 173 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/164 places, 153/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 152/164 places, 153/162 transitions.
[2025-06-02 12:03:22] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:03:22] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:03:22] [INFO ] Input system was already deterministic with 153 transitions.
[2025-06-02 12:03:22] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:03:22] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:03:22] [INFO ] Time to serialize gal into /tmp/CTLFireability9276836510364465050.gal : 1 ms
[2025-06-02 12:03:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15681929035015608010.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9276836510364465050.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15681929035015608010.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06719e+09,3.27256,62316,2,19698,5,225295,6,0,763,316507,0
Converting to forward existential form...Done !
original formula: EG(((AG(((p126==0)&&((p123==0)||(p136==0)))) * EX((p166==0))) * !(E((p152==1) U ((((p25==1)&&(p34==1))&&((p38==1)&&(p48==1)))||(p59==1)))...158
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(((p126==0)&&((p123==0)||(p136==0)))))) * EX((p166==0))) * !(E((p152==1) U ((((p25==1)&...213
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t19, t20, t23, t31, t35...313
Detected timeout of ITS tools.
[2025-06-02 12:03:52] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:03:52] [INFO ] Applying decomposition
[2025-06-02 12:03:52] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10922831300708923902.txt' '-o' '/tmp/graph10922831300708923902.bin' '-w' '/tmp/graph10922831300708923902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10922831300708923902.bin' '-l' '-1' '-v' '-w' '/tmp/graph10922831300708923902.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:03:52] [INFO ] Decomposing Gal with order
[2025-06-02 12:03:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:03:52] [INFO ] Removed a total of 22 redundant transitions.
[2025-06-02 12:03:52] [INFO ] Flatten gal took : 18 ms
[2025-06-02 12:03:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2025-06-02 12:03:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2714706232078182730.gal : 3 ms
[2025-06-02 12:03:52] [INFO ] Time to serialize properties into /tmp/CTLFireability3058883751600125110.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2714706232078182730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3058883751600125110.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06719e+09,0.796398,24500,1571,652,22474,4794,466,132492,109,60895,0
Converting to forward existential form...Done !
original formula: EG(((AG(((i7.u43.p126==0)&&((i8.i1.u42.p123==0)||(i8.i1.u47.p136==0)))) * EX((i10.u57.p166==0))) * !(E((i9.u49.p152==1) U ((((i2.i0.u6.p2...243
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(((i7.u43.p126==0)&&((i8.i1.u42.p123==0)||(i8.i1.u47.p136==0)))))) * EX((i10.u57.p166==...298
Reverse transition relation is NOT exact ! Due to transitions t19, t37, t67, i0.i1.u0.t107, i2.i0.u6.t0, i2.i0.u6.t1, i2.i0.u6.t2, i2.i0.u6.t3, i2.i0.u6.t4...550
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,5.50889,146868,1,0,237504,19647,2805,718162,750,126652,402917
FORMULA MedleyA-PT-12-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 162
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 152 transition count 151
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 152 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 151 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 151 transition count 150
Applied a total of 25 rules in 4 ms. Remains 151 /164 variables (removed 13) and now considering 150/162 (removed 12) transitions.
// Phase 1: matrix 150 rows 151 cols
[2025-06-02 12:03:57] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:03:57] [INFO ] Implicit Places using invariants in 118 ms returned [31, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 149/164 places, 150/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 149 /149 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 149/164 places, 150/162 transitions.
[2025-06-02 12:03:57] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:03:57] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:03:57] [INFO ] Input system was already deterministic with 150 transitions.
[2025-06-02 12:03:57] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:03:57] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:03:57] [INFO ] Time to serialize gal into /tmp/CTLFireability15027301446662054966.gal : 1 ms
[2025-06-02 12:03:57] [INFO ] Time to serialize properties into /tmp/CTLFireability7092638055035004600.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15027301446662054966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7092638055035004600.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.05994e+08,1.85894,50336,2,13250,5,185942,6,0,748,249216,0
Converting to forward existential form...Done !
original formula: E(AX(((E((((p25==1)&&(p33==1))&&((p38==1)&&(p48==1))) U (p24==1)) + AF((p8==1))) + ((p27==1) + ((A(((p96==1)&&(p102==1)) U (p111==1)) * (...392
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,!(EX(!(((E((((p25==1)&&(p33==1))&&((p38==1)&&(p48==1))) U (p24==1)) + !(EG(!((p8==1))))) + (...1074
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t19, t20, t23, t34, t36...303
Detected timeout of ITS tools.
[2025-06-02 12:04:28] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:04:28] [INFO ] Applying decomposition
[2025-06-02 12:04:28] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1130454291579481661.txt' '-o' '/tmp/graph1130454291579481661.bin' '-w' '/tmp/graph1130454291579481661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1130454291579481661.bin' '-l' '-1' '-v' '-w' '/tmp/graph1130454291579481661.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:04:28] [INFO ] Decomposing Gal with order
[2025-06-02 12:04:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:04:28] [INFO ] Removed a total of 22 redundant transitions.
[2025-06-02 12:04:28] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:04:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-06-02 12:04:28] [INFO ] Time to serialize gal into /tmp/CTLFireability1614853519451443957.gal : 3 ms
[2025-06-02 12:04:28] [INFO ] Time to serialize properties into /tmp/CTLFireability4525254355615201416.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1614853519451443957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4525254355615201416.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.05994e+08,0.508498,17192,1175,595,20159,7448,436,47403,100,46106,0
Converting to forward existential form...Done !
original formula: E(AX(((E((((i2.u10.p25==1)&&(i2.u10.p33==1))&&((i2.u10.p38==1)&&(i2.u10.p48==1))) U (i2.u9.p24==1)) + AF((i0.u3.p8==1))) + ((i2.u10.p27==...615
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,!(EX(!(((E((((i2.u10.p25==1)&&(i2.u10.p33==1))&&((i2.u10.p38==1)&&(i2.u10.p48==1))) U (i2.u9...1591
Reverse transition relation is NOT exact ! Due to transitions t19, t36, t53, t66, i2.u10.t0, i2.u10.t1, i2.u10.t2, i2.u10.t3, i2.u10.t4, i2.u10.t5, i2.u10....503
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 148 transition count 136
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 148 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 147 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 147 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 146 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 146 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 145 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 145 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 144 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 144 transition count 132
Applied a total of 39 rules in 10 ms. Remains 144 /164 variables (removed 20) and now considering 132/162 (removed 30) transitions.
// Phase 1: matrix 132 rows 144 cols
[2025-06-02 12:04:58] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:04:58] [INFO ] Implicit Places using invariants in 101 ms returned [29, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 112 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/164 places, 132/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 142 /142 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 142/164 places, 132/162 transitions.
[2025-06-02 12:04:58] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:04:58] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:04:58] [INFO ] Input system was already deterministic with 132 transitions.
[2025-06-02 12:04:58] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:04:58] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:04:58] [INFO ] Time to serialize gal into /tmp/CTLFireability12271335482783812559.gal : 1 ms
[2025-06-02 12:04:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1190539225759150039.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12271335482783812559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1190539225759150039.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,5.03363e+08,0.680102,25376,2,5141,5,80707,6,0,702,117540,0
Converting to forward existential form...Done !
original formula: EF(EX(EF(((p101==0) * E(((p92==1)&&(p109==1)) U (p151==1))))))
=> equivalent forward existential formula: [(FwdU((FwdU(EY(FwdU(Init,TRUE)),TRUE) * (p101==0)),((p92==1)&&(p109==1))) * (p151==1))] != FALSE
Hit Full ! (commute/partial/dont) 128/3/4
(forward)formula 0,1,0.82258,25632,1,0,11,80707,17,2,1502,117540,8
FORMULA MedleyA-PT-12-CTLFireability-2025-10 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 : 164/164 places, 162/162 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 162 transition count 144
Reduce places removed 17 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 23 rules applied. Total rules applied 41 place count 145 transition count 138
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 49 place count 139 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 138 transition count 136
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 50 place count 138 transition count 113
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 47 rules applied. Total rules applied 97 place count 114 transition count 113
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 99 place count 113 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 100 place count 112 transition count 112
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 110 place count 102 transition count 102
Iterating global reduction 6 with 10 rules applied. Total rules applied 120 place count 102 transition count 102
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 120 place count 102 transition count 99
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 126 place count 99 transition count 99
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 127 place count 98 transition count 98
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 98 transition count 98
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 129 place count 97 transition count 97
Iterating global reduction 6 with 1 rules applied. Total rules applied 130 place count 97 transition count 97
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 131 place count 96 transition count 96
Iterating global reduction 6 with 1 rules applied. Total rules applied 132 place count 96 transition count 96
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 162 place count 81 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 80 transition count 80
Applied a total of 163 rules in 50 ms. Remains 80 /164 variables (removed 84) and now considering 80/162 (removed 82) transitions.
// Phase 1: matrix 80 rows 80 cols
[2025-06-02 12:04:59] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:04:59] [INFO ] Implicit Places using invariants in 101 ms returned [16, 28, 40, 45, 49]
[2025-06-02 12:04:59] [INFO ] Actually due to overlaps returned [45, 16, 28, 49]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 114 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 76/164 places, 80/162 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 75 transition count 79
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 75 transition count 77
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 73 transition count 77
Applied a total of 6 rules in 7 ms. Remains 73 /76 variables (removed 3) and now considering 77/80 (removed 3) transitions.
// Phase 1: matrix 77 rows 73 cols
[2025-06-02 12:04:59] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:04:59] [INFO ] Implicit Places using invariants in 85 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 72/164 places, 77/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 72 /72 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 262 ms. Remains : 72/164 places, 77/162 transitions.
[2025-06-02 12:04:59] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:04:59] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:04:59] [INFO ] Input system was already deterministic with 77 transitions.
[2025-06-02 12:04:59] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:04:59] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:04:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1962052371529107120.gal : 0 ms
[2025-06-02 12:04:59] [INFO ] Time to serialize properties into /tmp/CTLFireability10807892239606117749.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1962052371529107120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10807892239606117749.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,907662,0.131916,6984,2,2519,5,15543,6,0,367,15150,0
Converting to forward existential form...Done !
original formula: !(A(((p108==1) + A(((p24==1) + E((p146==1) U (p17==1))) U ((!((p154==1)&&(p162==1)))||(((((p26==1)&&(p34==1))&&((p39==1)&&(p47==1)))&&(((...273
=> equivalent forward existential formula: (([((((FwdU((FwdU(Init,!(!((E(!((p134==1)) U (!(((E(TRUE U (p131==1)) + (p142==1)) + (p8==1))) * !((p134==1)))) ...1565
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t11, t13, t19, t43, t44, t45, t46, t47, t48, t49, t50, I...251
Hit Full ! (commute/partial/dont) 75/0/2
(forward)formula 0,1,19.6142,500312,1,0,1023,3.49907e+06,210,511,2499,2.6486e+06,1201
FORMULA MedleyA-PT-12-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 163 transition count 139
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 140 transition count 137
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 139 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 137 transition count 135
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 54 place count 137 transition count 111
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 49 rules applied. Total rules applied 103 place count 112 transition count 111
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 112 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 105 place count 111 transition count 110
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 116 place count 100 transition count 99
Iterating global reduction 6 with 11 rules applied. Total rules applied 127 place count 100 transition count 99
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 127 place count 100 transition count 96
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 133 place count 97 transition count 96
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 134 place count 96 transition count 95
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 96 transition count 95
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 136 place count 95 transition count 94
Iterating global reduction 6 with 1 rules applied. Total rules applied 137 place count 95 transition count 94
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 177 place count 75 transition count 74
Applied a total of 177 rules in 39 ms. Remains 75 /164 variables (removed 89) and now considering 74/162 (removed 88) transitions.
// Phase 1: matrix 74 rows 75 cols
[2025-06-02 12:05:19] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:05:19] [INFO ] Implicit Places using invariants in 147 ms returned [15, 21, 28, 42, 46, 50]
[2025-06-02 12:05:19] [INFO ] Actually due to overlaps returned [46, 15, 21, 28, 50]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 150 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 70/164 places, 74/162 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 70 transition count 71
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 67 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 67 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 66 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 65 transition count 69
Applied a total of 10 rules in 9 ms. Remains 65 /70 variables (removed 5) and now considering 69/74 (removed 5) transitions.
// Phase 1: matrix 69 rows 65 cols
[2025-06-02 12:05:19] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:05:19] [INFO ] Implicit Places using invariants in 109 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 64/164 places, 69/162 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 63 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 63 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 62 transition count 67
Applied a total of 4 rules in 5 ms. Remains 62 /64 variables (removed 2) and now considering 67/69 (removed 2) transitions.
// Phase 1: matrix 67 rows 62 cols
[2025-06-02 12:05:19] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:05:19] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 12:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:05:19] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 62/164 places, 67/162 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 567 ms. Remains : 62/164 places, 67/162 transitions.
[2025-06-02 12:05:19] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:05:19] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:05:19] [INFO ] Input system was already deterministic with 67 transitions.
[2025-06-02 12:05:19] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:05:19] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:05:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9191138407384300297.gal : 1 ms
[2025-06-02 12:05:19] [INFO ] Time to serialize properties into /tmp/CTLFireability12700603394415464233.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9191138407384300297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12700603394415464233.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01082e+06,0.186003,7804,2,2609,5,19850,6,0,317,18706,0
Converting to forward existential form...Done !
original formula: AF(((EG(((p67==1)&&(p30==1))) + EG(((p1==1)&&(p31==1)))) + (((p25==1)&&(p34==1))&&((p38==1)&&(p48==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((EG(((p67==1)&&(p30==1))) + EG(((p1==1)&&(p31==1)))) + (((p25==1)&&(p34==1))&&((p38==1)&&(p48==1))...168
Reverse transition relation is NOT exact ! Due to transitions t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,3.2648,87868,1,0,440,482543,164,268,2126,449154,610
FORMULA MedleyA-PT-12-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 162
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 151 transition count 150
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 151 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 150 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 150 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 149 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 149 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 148 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 148 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 147 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 147 transition count 146
Applied a total of 33 rules in 11 ms. Remains 147 /164 variables (removed 17) and now considering 146/162 (removed 16) transitions.
// Phase 1: matrix 146 rows 147 cols
[2025-06-02 12:05:23] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:05:23] [INFO ] Implicit Places using invariants in 144 ms returned [31, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 156 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/164 places, 146/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 170 ms. Remains : 145/164 places, 146/162 transitions.
[2025-06-02 12:05:23] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:05:23] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:05:23] [INFO ] Input system was already deterministic with 146 transitions.
[2025-06-02 12:05:23] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:05:23] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:05:23] [INFO ] Time to serialize gal into /tmp/CTLFireability12124529920952255822.gal : 2 ms
[2025-06-02 12:05:23] [INFO ] Time to serialize properties into /tmp/CTLFireability10728819897798147510.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12124529920952255822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10728819897798147510.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,7.25637e+08,1.9868,45008,2,8798,5,167916,6,0,728,214206,0
Converting to forward existential form...Done !
original formula: EG(((AF(EX((p171==1))) * AF((p124==1))) * AF((((EG((p171==0)) * (p26==1)) * ((p33==1)&&(p38==1))) * (p48==1)))))
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!(EX((p171==1))))) * !(EG(!((p124==1))))) * !(EG(!((((EG((p171==0)) * (p26==1)) * ((p33==1)&&(...191
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t19, t35, t50, t52, t59...298
Detected timeout of ITS tools.
[2025-06-02 12:05:53] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:05:53] [INFO ] Applying decomposition
[2025-06-02 12:05:53] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17948548859592036941.txt' '-o' '/tmp/graph17948548859592036941.bin' '-w' '/tmp/graph17948548859592036941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17948548859592036941.bin' '-l' '-1' '-v' '-w' '/tmp/graph17948548859592036941.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:05:53] [INFO ] Decomposing Gal with order
[2025-06-02 12:05:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:05:53] [INFO ] Removed a total of 18 redundant transitions.
[2025-06-02 12:05:53] [INFO ] Flatten gal took : 21 ms
[2025-06-02 12:05:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 12:05:53] [INFO ] Time to serialize gal into /tmp/CTLFireability8402135089923815912.gal : 4 ms
[2025-06-02 12:05:53] [INFO ] Time to serialize properties into /tmp/CTLFireability471357478282161330.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8402135089923815912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability471357478282161330.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.25637e+08,0.422973,12156,1113,401,16147,2447,446,27831,95,10528,0
Converting to forward existential form...Done !
original formula: EG(((AF(EX((i9.u58.p171==1))) * AF((i7.i1.u43.p124==1))) * AF((((EG((i9.u58.p171==0)) * (i3.u5.p26==1)) * ((i3.u5.p33==1)&&(i3.u5.p38==1)...178
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!(EX((i9.u58.p171==1))))) * !(EG(!((i7.i1.u43.p124==1))))) * !(EG(!((((EG((i9.u58.p171==0)) * ...239
Reverse transition relation is NOT exact ! Due to transitions t19, t35, t52, t65, i0.i1.u0.t103, i1.i0.u18.t79, i3.u5.t0, i3.u5.t1, i3.u5.t2, i3.u5.t3, i3....475
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 162 transition count 136
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 137 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 136 transition count 134
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 54 place count 136 transition count 107
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 109 place count 108 transition count 107
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 107 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 112 place count 106 transition count 106
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 126 place count 92 transition count 81
Iterating global reduction 5 with 14 rules applied. Total rules applied 140 place count 92 transition count 81
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 140 place count 92 transition count 77
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 148 place count 88 transition count 77
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 87 transition count 76
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 87 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 86 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 86 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 153 place count 85 transition count 74
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 85 transition count 74
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 194 place count 65 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 64 transition count 53
Applied a total of 195 rules in 33 ms. Remains 64 /164 variables (removed 100) and now considering 53/162 (removed 109) transitions.
// Phase 1: matrix 53 rows 64 cols
[2025-06-02 12:06:23] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:06:23] [INFO ] Implicit Places using invariants in 84 ms returned [8, 13, 18, 30, 34, 38]
[2025-06-02 12:06:23] [INFO ] Actually due to overlaps returned [34, 8, 13, 18, 38]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 86 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/164 places, 53/162 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 59 transition count 50
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 56 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 56 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 55 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 53 transition count 47
Applied a total of 12 rules in 4 ms. Remains 53 /59 variables (removed 6) and now considering 47/53 (removed 6) transitions.
// Phase 1: matrix 47 rows 53 cols
[2025-06-02 12:06:23] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:06:23] [INFO ] Implicit Places using invariants in 57 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 52/164 places, 47/162 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 46
Applied a total of 2 rules in 4 ms. Remains 51 /52 variables (removed 1) and now considering 46/47 (removed 1) transitions.
// Phase 1: matrix 46 rows 51 cols
[2025-06-02 12:06:23] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:06:23] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-02 12:06:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:06:23] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 51/164 places, 46/162 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 407 ms. Remains : 51/164 places, 46/162 transitions.
[2025-06-02 12:06:23] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:06:23] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:06:23] [INFO ] Input system was already deterministic with 46 transitions.
[2025-06-02 12:06:23] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:06:23] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:06:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6939634390056958515.gal : 1 ms
[2025-06-02 12:06:23] [INFO ] Time to serialize properties into /tmp/CTLFireability18406563476911843183.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6939634390056958515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18406563476911843183.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,244008,0.033145,4296,2,458,5,2577,6,0,253,2012,0
Converting to forward existential form...Done !
original formula: EG(EF((p146==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p146==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,1.19325,32688,1,0,170,173390,117,118,1504,203001,187
FORMULA MedleyA-PT-12-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 162/162 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 148 transition count 136
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 148 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 147 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 147 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 146 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 146 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 145 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 145 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 144 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 144 transition count 132
Applied a total of 39 rules in 20 ms. Remains 144 /164 variables (removed 20) and now considering 132/162 (removed 30) transitions.
// Phase 1: matrix 132 rows 144 cols
[2025-06-02 12:06:25] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:06:25] [INFO ] Implicit Places using invariants in 121 ms returned [29, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 133 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/164 places, 132/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 156 ms. Remains : 142/164 places, 132/162 transitions.
[2025-06-02 12:06:25] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:06:25] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:06:25] [INFO ] Input system was already deterministic with 132 transitions.
[2025-06-02 12:06:25] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:06:25] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:06:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8004922526605097962.gal : 1 ms
[2025-06-02 12:06:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9221730096307271069.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8004922526605097962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9221730096307271069.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,5.03363e+08,1.06821,25112,2,5055,5,80234,6,0,702,115808,0
Converting to forward existential form...Done !
original formula: (EG(AX(EG(((p131==0)&&((p28==0)||(p144==0)))))) * EG((p132==0)))
=> equivalent forward existential formula: [FwdG((Init * EG(!(EX(!(EG(((p131==0)&&((p28==0)||(p144==0))))))))),(p132==0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t21, t27, t36, t38, t45, t50, t56, t59, t62, t63, t65, t73, t77, t80, t83, t89, Int...251
Detected timeout of ITS tools.
[2025-06-02 12:06:55] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:06:55] [INFO ] Applying decomposition
[2025-06-02 12:06:55] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3588039447246636397.txt' '-o' '/tmp/graph3588039447246636397.bin' '-w' '/tmp/graph3588039447246636397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3588039447246636397.bin' '-l' '-1' '-v' '-w' '/tmp/graph3588039447246636397.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:06:55] [INFO ] Decomposing Gal with order
[2025-06-02 12:06:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:06:55] [INFO ] Removed a total of 17 redundant transitions.
[2025-06-02 12:06:55] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:06:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 12:06:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8667780307807864248.gal : 2 ms
[2025-06-02 12:06:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1888690084129511365.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8667780307807864248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1888690084129511365.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.03363e+08,0.082904,5856,391,29,3774,290,404,4477,54,679,0
Converting to forward existential form...Done !
original formula: (EG(AX(EG(((i10.i0.u47.p131==0)&&((i3.u10.p28==0)||(i11.u51.p144==0)))))) * EG((i10.i1.u50.p132==0)))
=> equivalent forward existential formula: [FwdG((Init * EG(!(EX(!(EG(((i10.i0.u47.p131==0)&&((i3.u10.p28==0)||(i11.u51.p144==0))))))))),(i10.i1.u50.p132==...168
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t38, i0.u1.t89, i3.u9.t83, i4.u13.t73, i5.u11.t80, i5.u18.t65, i6.i0.t63, i6.i0.u20....372
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,7.51275,178784,1,0,335408,513,2696,421270,278,1505,421725
FORMULA MedleyA-PT-12-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
[2025-06-02 12:07:03] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:07:03] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:07:03] [INFO ] Applying decomposition
[2025-06-02 12:07:03] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6614662791508927883.txt' '-o' '/tmp/graph6614662791508927883.bin' '-w' '/tmp/graph6614662791508927883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6614662791508927883.bin' '-l' '-1' '-v' '-w' '/tmp/graph6614662791508927883.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:07:03] [INFO ] Decomposing Gal with order
[2025-06-02 12:07:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:07:03] [INFO ] Removed a total of 17 redundant transitions.
[2025-06-02 12:07:03] [INFO ] Flatten gal took : 23 ms
[2025-06-02 12:07:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 12:07:03] [INFO ] Time to serialize gal into /tmp/CTLFireability5974609546510611867.gal : 4 ms
[2025-06-02 12:07:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16378815515150996922.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5974609546510611867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16378815515150996922.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.30296e+09,1.18619,28952,2936,683,48748,4544,492,80290,111,28443,0
Converting to forward existential form...Done !
original formula: E(AX(((E((((i1.u6.p25==1)&&(i1.u6.p33==1))&&((i1.u6.p38==1)&&(i1.u6.p48==1))) U (i2.i0.u11.p24==1)) + AF((i0.u4.p8==1))) + ((i1.u6.p27==1...602
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,!(EX(!(((E((((i1.u6.p25==1)&&(i1.u6.p33==1))&&((i1.u6.p38==1)&&(i1.u6.p48==1))) U (i2.i0.u11...1572
Reverse transition relation is NOT exact ! Due to transitions t19, t38, t57, i1.u6.t0, i1.u6.t1, i1.u6.t2, i1.u6.t3, i1.u6.t4, i1.u6.t5, i1.u6.t6, i1.u6.t7...649
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,325.319,2433228,1,0,4.39433e+06,23087,1743,4.34446e+06,359,130078,3675361
FORMULA MedleyA-PT-12-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EG(((AF(EX((i9.u58.p171==1))) * AF((i7.i1.u43.p124==1))) * AF((((EG((i9.u58.p171==0)) * (i1.u6.p26==1)) * ((i1.u6.p33==1)&&(i1.u6.p38==1)...178
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!(EX((i9.u58.p171==1))))) * !(EG(!((i7.i1.u43.p124==1))))) * !(EG(!((((EG((i9.u58.p171==0)) * ...239
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 1,0,588.789,2949580,1,0,5.60651e+06,23087,1110,5.70256e+06,314,130078,4401480
FORMULA MedleyA-PT-12-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1094012 ms.
BK_STOP 1748866613760
--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-12"
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-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-12, 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 r128-smll-174876524100186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-12.tgz
mv MedleyA-PT-12 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.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 ;