About the Execution of ITS-Tools for Champagne-PT-H07T1U
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FT?TF?TF??FTF?FT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339200082.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 Champagne-PT-H07T1U, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339200082
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 9.4K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Jun 6 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 6 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 144K Jun 5 20:08 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 Champagne-PT-H07T1U-CTLFireability-2025-00
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-01
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-02
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-03
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-04
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-05
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-06
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-07
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-08
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-09
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-10
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-11
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-12
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-13
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-14
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749323561662
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H07T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 19:12:42] [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-07 19:12:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 19:12:43] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2025-06-07 19:12:43] [INFO ] Transformed 701 places.
[2025-06-07 19:12:43] [INFO ] Transformed 931 transitions.
[2025-06-07 19:12:43] [INFO ] Found NUPN structural information;
[2025-06-07 19:12:43] [INFO ] Parsed PT model containing 701 places and 931 transitions and 2312 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 111 out of 701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 701/701 places, 931/931 transitions.
Discarding 132 places :
Symmetric choice reduction at 0 with 132 rule applications. Total rules 132 place count 569 transition count 799
Iterating global reduction 0 with 132 rules applied. Total rules applied 264 place count 569 transition count 799
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 335 place count 498 transition count 728
Iterating global reduction 0 with 71 rules applied. Total rules applied 406 place count 498 transition count 728
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 440 place count 464 transition count 694
Iterating global reduction 0 with 34 rules applied. Total rules applied 474 place count 464 transition count 694
Applied a total of 474 rules in 123 ms. Remains 464 /701 variables (removed 237) and now considering 694/931 (removed 237) transitions.
// Phase 1: matrix 694 rows 464 cols
[2025-06-07 19:12:43] [INFO ] Computed 27 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:12:43] [INFO ] Implicit Places using invariants in 343 ms returned []
[2025-06-07 19:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:12:43] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 693 sub problems to find dead transitions.
[2025-06-07 19:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/464 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:00] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:00] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:00] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:00] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:01] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:01] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:02] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:02] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:02] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:02] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/1158 variables, and 37 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/464 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 693 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/464 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 694/1158 variables, 464/501 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1158 variables, 693/1194 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:30] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:30] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:31] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:32] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:32] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:33] [INFO ] Deduced a trap composed of 76 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-07 19:13:33] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:34] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:34] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:34] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1158 variables, 10/1204 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1158/1158 variables, and 1204 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 464/464 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60257ms problems are : Problem set: 0 solved, 693 unsolved
Search for dead transitions found 0 dead transitions in 60270ms
Starting structural reductions in LTL mode, iteration 1 : 464/701 places, 694/931 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61078 ms. Remains : 464/701 places, 694/931 transitions.
Support contains 111 out of 464 places after structural reductions.
[2025-06-07 19:13:44] [INFO ] Flatten gal took : 61 ms
[2025-06-07 19:13:44] [INFO ] Flatten gal took : 33 ms
[2025-06-07 19:13:44] [INFO ] Input system was already deterministic with 694 transitions.
Support contains 106 out of 464 places (down from 111) after GAL structural reductions.
RANDOM walk for 40000 steps (91 resets) in 1758 ms. (22 steps per ms) remains 6/71 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
[2025-06-07 19:13:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 194/210 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 254/464 variables, 16/27 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 694/1158 variables, 464/491 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1158 variables, 0/491 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1158 variables, 0/491 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1158/1158 variables, and 491 constraints, problems are : Problem set: 1 solved, 4 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 464/464 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 196/210 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:13:45] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 254/464 variables, 16/28 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 694/1158 variables, 464/492 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1158 variables, 4/496 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1158 variables, 0/496 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1158 variables, 0/496 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1158/1158 variables, and 496 constraints, problems are : Problem set: 1 solved, 4 unsolved in 817 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 464/464 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1202ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 3 properties in 320 ms.
Support contains 10 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 694/694 transitions.
Graph (trivial) has 457 edges and 464 vertex of which 198 / 464 are part of one of the 25 SCC in 4 ms
Free SCC test removed 173 places
Drop transitions (Empty/Sink Transition effects.) removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 291 transition count 411
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
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 1 with 119 rules applied. Total rules applied 189 place count 222 transition count 361
Reduce places removed 25 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 28 rules applied. Total rules applied 217 place count 197 transition count 358
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 220 place count 194 transition count 358
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 220 place count 194 transition count 355
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 226 place count 191 transition count 355
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 250 place count 167 transition count 309
Iterating global reduction 4 with 24 rules applied. Total rules applied 274 place count 167 transition count 309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 280 place count 167 transition count 303
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 280 place count 167 transition count 301
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 284 place count 165 transition count 301
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 412 place count 101 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 413 place count 101 transition count 236
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 420 place count 94 transition count 202
Iterating global reduction 6 with 7 rules applied. Total rules applied 427 place count 94 transition count 202
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 434 place count 94 transition count 195
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 442 place count 90 transition count 205
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 451 place count 90 transition count 196
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 452 place count 89 transition count 191
Iterating global reduction 8 with 1 rules applied. Total rules applied 453 place count 89 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 454 place count 89 transition count 190
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 458 place count 89 transition count 186
Free-agglomeration rule applied 41 times.
Iterating global reduction 9 with 41 rules applied. Total rules applied 499 place count 89 transition count 145
Reduce places removed 41 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 9 with 110 rules applied. Total rules applied 609 place count 48 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 620 place count 48 transition count 65
Applied a total of 620 rules in 87 ms. Remains 48 /464 variables (removed 416) and now considering 65/694 (removed 629) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 48/464 places, 65/694 transitions.
RANDOM walk for 30093 steps (6 resets) in 455 ms. (65 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-07 19:13:47] [INFO ] Flatten gal took : 27 ms
[2025-06-07 19:13:47] [INFO ] Flatten gal took : 33 ms
[2025-06-07 19:13:47] [INFO ] Input system was already deterministic with 694 transitions.
Computed a total of 43 stabilizing places and 43 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 419 transition count 649
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 419 transition count 649
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 118 place count 391 transition count 621
Iterating global reduction 0 with 28 rules applied. Total rules applied 146 place count 391 transition count 621
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 159 place count 378 transition count 608
Iterating global reduction 0 with 13 rules applied. Total rules applied 172 place count 378 transition count 608
Applied a total of 172 rules in 32 ms. Remains 378 /464 variables (removed 86) and now considering 608/694 (removed 86) transitions.
// Phase 1: matrix 608 rows 378 cols
[2025-06-07 19:13:47] [INFO ] Computed 27 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:13:47] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-07 19:13:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:13:47] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 607 sub problems to find dead transitions.
[2025-06-07 19:13:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 3 (OVERLAPS) 608/986 variables, 378/405 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 405 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 607/607 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 3 (OVERLAPS) 608/986 variables, 378/405 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/986 variables, 607/1012 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:14:40] [INFO ] Deduced a trap along path composed of 13 places in 40 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1013 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 607/607 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 607 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 378/464 places, 608/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60494 ms. Remains : 378/464 places, 608/694 transitions.
[2025-06-07 19:14:47] [INFO ] Flatten gal took : 21 ms
[2025-06-07 19:14:47] [INFO ] Flatten gal took : 22 ms
[2025-06-07 19:14:47] [INFO ] Input system was already deterministic with 608 transitions.
[2025-06-07 19:14:47] [INFO ] Flatten gal took : 19 ms
[2025-06-07 19:14:47] [INFO ] Flatten gal took : 18 ms
[2025-06-07 19:14:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16912388614151009966.gal : 13 ms
[2025-06-07 19:14:47] [INFO ] Time to serialize properties into /tmp/CTLFireability18054181328910629870.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/CTLFireability16912388614151009966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18054181328910629870.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.
Detected timeout of ITS tools.
[2025-06-07 19:15:18] [INFO ] Flatten gal took : 19 ms
[2025-06-07 19:15:18] [INFO ] Applying decomposition
[2025-06-07 19:15:18] [INFO ] Flatten gal took : 17 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/graph10433979340278547625.txt' '-o' '/tmp/graph10433979340278547625.bin' '-w' '/tmp/graph10433979340278547625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10433979340278547625.bin' '-l' '-1' '-v' '-w' '/tmp/graph10433979340278547625.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:15:18] [INFO ] Decomposing Gal with order
[2025-06-07 19:15:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:15:18] [INFO ] Removed a total of 506 redundant transitions.
[2025-06-07 19:15:18] [INFO ] Flatten gal took : 75 ms
[2025-06-07 19:15:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 12 ms.
[2025-06-07 19:15:18] [INFO ] Time to serialize gal into /tmp/CTLFireability11378540129790225825.gal : 8 ms
[2025-06-07 19:15:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11367392342696685991.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/CTLFireability11378540129790225825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11367392342696685991.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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26999e+30,0.935392,39304,8594,22,52351,527,776,131780,62,964,0
Converting to forward existential form...Done !
original formula: EF((((i11.u55.p268==1) * ((i1.u9.p50!=1) + (EG((i7.i0.i1.u39.p185==1)) * ((i4.u23.p111==1)||((i9.u48.p234==1)&&(i15.u76.p377==1)))))) * (...314
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * ((i11.u55.p268==1) * ((i1.u9.p50!=1) + (EG((i7.i0.i1.u39.p185==1)) * ((i4.u23.p111==1)||(...620
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t64, t108, t167, t228, i0.t401, i1.t385, i2.t371, i3.t356, i4.t340, i5.t325, i6.t310...452
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
(forward)formula 0,0,15.8978,332936,1,0,674166,527,5154,1.2121e+06,312,964,1394859
FORMULA Champagne-PT-H07T1U-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 422 transition count 652
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 422 transition count 652
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 110 place count 396 transition count 626
Iterating global reduction 0 with 26 rules applied. Total rules applied 136 place count 396 transition count 626
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 147 place count 385 transition count 615
Iterating global reduction 0 with 11 rules applied. Total rules applied 158 place count 385 transition count 615
Applied a total of 158 rules in 27 ms. Remains 385 /464 variables (removed 79) and now considering 615/694 (removed 79) transitions.
// Phase 1: matrix 615 rows 385 cols
[2025-06-07 19:15:34] [INFO ] Computed 27 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:15:34] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-07 19:15:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:15:34] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 614 sub problems to find dead transitions.
[2025-06-07 19:15:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (OVERLAPS) 1/385 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:15:46] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:15:46] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:15:46] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:15:47] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:15:48] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 615/1000 variables, 385/417 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 417 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 614 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (OVERLAPS) 1/385 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 615/1000 variables, 385/417 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 614/1031 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:17] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:17] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:18] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:19] [INFO ] Deduced a trap composed of 71 places in 144 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:20] [INFO ] Deduced a trap composed of 67 places in 161 ms of which 28 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 5/1036 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:27] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1037 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 614 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 385/464 places, 615/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60502 ms. Remains : 385/464 places, 615/694 transitions.
[2025-06-07 19:16:34] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:16:34] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:16:34] [INFO ] Input system was already deterministic with 615 transitions.
[2025-06-07 19:16:34] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:16:35] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:16:35] [INFO ] Time to serialize gal into /tmp/CTLFireability5118820259375222357.gal : 3 ms
[2025-06-07 19:16:35] [INFO ] Time to serialize properties into /tmp/CTLFireability18163773441009666656.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/CTLFireability5118820259375222357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18163773441009666656.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.
Detected timeout of ITS tools.
[2025-06-07 19:17:05] [INFO ] Flatten gal took : 14 ms
[2025-06-07 19:17:05] [INFO ] Applying decomposition
[2025-06-07 19:17:05] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7330925989487215104.txt' '-o' '/tmp/graph7330925989487215104.bin' '-w' '/tmp/graph7330925989487215104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7330925989487215104.bin' '-l' '-1' '-v' '-w' '/tmp/graph7330925989487215104.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:17:05] [INFO ] Decomposing Gal with order
[2025-06-07 19:17:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:17:05] [INFO ] Removed a total of 488 redundant transitions.
[2025-06-07 19:17:05] [INFO ] Flatten gal took : 29 ms
[2025-06-07 19:17:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 8 ms.
[2025-06-07 19:17:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15078620495344834039.gal : 5 ms
[2025-06-07 19:17:05] [INFO ] Time to serialize properties into /tmp/CTLFireability452770241110827127.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/CTLFireability15078620495344834039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability452770241110827127.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.97924e+30,0.880564,38452,8360,21,51384,688,897,135834,59,1466,0
Converting to forward existential form...Done !
original formula: (EG(EX(EF((i11.i1.u57.p276==1)))) + AG((EX(!(E((i26.u125.p646==1) U (i12.i1.u63.p304==1)))) * AG((((((i9.i1.u44.p218==1)&&(i3.i0.u15.p69=...278
=> equivalent forward existential formula: ([(FwdU((Init * !(EG(EX(E(TRUE U (i11.i1.u57.p276==1)))))),TRUE) * !(EX(!(E((i26.u125.p646==1) U (i12.i1.u63.p30...427
Reverse transition relation is NOT exact ! Due to transitions t6, t38, t67, t82, t111, t145, t174, t205, t234, t283, t315, t390, i0.t365, i1.i1.t409, i2.i1...590
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
(forward)formula 0,1,28.805,550324,1,0,1.23874e+06,688,5950,1.51558e+06,307,1466,1796839
FORMULA Champagne-PT-H07T1U-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 419 transition count 649
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 419 transition count 649
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 120 place count 389 transition count 619
Iterating global reduction 0 with 30 rules applied. Total rules applied 150 place count 389 transition count 619
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 163 place count 376 transition count 606
Iterating global reduction 0 with 13 rules applied. Total rules applied 176 place count 376 transition count 606
Applied a total of 176 rules in 23 ms. Remains 376 /464 variables (removed 88) and now considering 606/694 (removed 88) transitions.
// Phase 1: matrix 606 rows 376 cols
[2025-06-07 19:17:34] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:17:34] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-07 19:17:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:17:34] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2025-06-07 19:17:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:17:46] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:17:47] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 4 (OVERLAPS) 606/982 variables, 376/405 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 982/982 variables, and 405 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 4 (OVERLAPS) 606/982 variables, 376/405 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/982 variables, 605/1010 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:18:16] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:18:16] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:18:17] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:18:17] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:18:19] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:18:19] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/982 variables, 6/1016 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:18:26] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:18:28] [INFO ] Deduced a trap composed of 42 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-07 19:18:31] [INFO ] Deduced a trap composed of 79 places in 187 ms of which 26 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/982 variables, and 1019 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 376/464 places, 606/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60526 ms. Remains : 376/464 places, 606/694 transitions.
[2025-06-07 19:18:34] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:18:34] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:18:34] [INFO ] Input system was already deterministic with 606 transitions.
[2025-06-07 19:18:34] [INFO ] Flatten gal took : 11 ms
[2025-06-07 19:18:34] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:18:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12726004356627710096.gal : 3 ms
[2025-06-07 19:18:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15645887121640850112.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/CTLFireability12726004356627710096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15645887121640850112.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.
Detected timeout of ITS tools.
[2025-06-07 19:19:04] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:19:04] [INFO ] Applying decomposition
[2025-06-07 19:19:04] [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/graph4988892253345917170.txt' '-o' '/tmp/graph4988892253345917170.bin' '-w' '/tmp/graph4988892253345917170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4988892253345917170.bin' '-l' '-1' '-v' '-w' '/tmp/graph4988892253345917170.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:19:04] [INFO ] Decomposing Gal with order
[2025-06-07 19:19:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:19:04] [INFO ] Removed a total of 488 redundant transitions.
[2025-06-07 19:19:04] [INFO ] Flatten gal took : 23 ms
[2025-06-07 19:19:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2025-06-07 19:19:05] [INFO ] Time to serialize gal into /tmp/CTLFireability17574494132314106617.gal : 4 ms
[2025-06-07 19:19:05] [INFO ] Time to serialize properties into /tmp/CTLFireability15248285751314140704.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/CTLFireability17574494132314106617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15248285751314140704.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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09755e+30,0.857326,38092,8353,23,50079,642,888,133738,59,1378,0
Converting to forward existential form...Done !
original formula: !(A(E((EG(!(((i19.i1.u91.p467==1)&&(i24.u113.p584==1)))) + EX((i24.u114.p593!=1))) U (((AF(((i13.i0.u67.p338==1)&&(i18.u86.p431==1))) * E...312
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,!(!((E(TRUE U (i3.i1.u22.p83==1)) + ((i22.i1.u97.p501==1) * !(EG(!((i1.i0.u10.p40==1))))))))...943
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t64, t79, t108, t126, t141, t170, t200, t229, t275, t304, t380, i0.i1.t400, i1.i1.u1...552
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Graph (trivial) has 460 edges and 464 vertex of which 197 / 464 are part of one of the 24 SCC in 1 ms
Free SCC test removed 173 places
Ensure Unique test removed 190 transitions
Reduce isomorphic transitions removed 190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 290 transition count 439
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 113 rules applied. Total rules applied 178 place count 226 transition count 390
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 204 place count 202 transition count 388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 200 transition count 388
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 206 place count 200 transition count 383
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 216 place count 195 transition count 383
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 239 place count 172 transition count 338
Iterating global reduction 4 with 23 rules applied. Total rules applied 262 place count 172 transition count 338
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 268 place count 172 transition count 332
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 400 place count 106 transition count 266
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 409 place count 97 transition count 224
Iterating global reduction 5 with 9 rules applied. Total rules applied 418 place count 97 transition count 224
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 427 place count 97 transition count 215
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 429 place count 95 transition count 213
Applied a total of 429 rules in 67 ms. Remains 95 /464 variables (removed 369) and now considering 213/694 (removed 481) transitions.
[2025-06-07 19:19:35] [INFO ] Flow matrix only has 121 transitions (discarded 92 similar events)
// Phase 1: matrix 121 rows 95 cols
[2025-06-07 19:19:35] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:19:35] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-07 19:19:35] [INFO ] Flow matrix only has 121 transitions (discarded 92 similar events)
[2025-06-07 19:19:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:19:35] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:19:35] [INFO ] Redundant transitions in 7 ms returned []
Running 140 sub problems to find dead transitions.
[2025-06-07 19:19:35] [INFO ] Flow matrix only has 121 transitions (discarded 92 similar events)
[2025-06-07 19:19:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 4/95 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 120/215 variables, 95/122 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/215 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/216 variables, and 122 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3764 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 4/95 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 120/215 variables, 95/122 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 140/262 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/215 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/216 variables, and 262 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3780 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7564ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 7565ms
Starting structural reductions in SI_CTL mode, iteration 1 : 95/464 places, 213/694 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7815 ms. Remains : 95/464 places, 213/694 transitions.
[2025-06-07 19:19:42] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:19:42] [INFO ] Flatten gal took : 5 ms
[2025-06-07 19:19:42] [INFO ] Input system was already deterministic with 213 transitions.
[2025-06-07 19:19:42] [INFO ] Flatten gal took : 5 ms
[2025-06-07 19:19:42] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:19:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4638452381279160478.gal : 1 ms
[2025-06-07 19:19:42] [INFO ] Time to serialize properties into /tmp/CTLFireability985756393808732468.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/CTLFireability4638452381279160478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability985756393808732468.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.46333e+13,0.029256,5204,2,164,5,2303,6,0,572,1264,0
Converting to forward existential form...Done !
original formula: AG(EF(((AG(((p209==0)||(p371==0))) + !(E((p383==1) U (p407==1)))) + ((p554==0)||(((p552==1)&&(p100==1))&&((p17==1)||((p595==1)&&(p636==1)...162
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(E(TRUE U !(((p209==0)||(p371==0))))) + !(E((p383==1) U (p407==1)))) + ((p554=...234
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 211/0/2
(forward)formula 0,1,0.156032,7764,1,0,16,23018,24,5,2646,14509,12
FORMULA Champagne-PT-H07T1U-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Graph (trivial) has 465 edges and 464 vertex of which 205 / 464 are part of one of the 25 SCC in 1 ms
Free SCC test removed 180 places
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 283 transition count 431
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 113 rules applied. Total rules applied 179 place count 218 transition count 383
Reduce places removed 24 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 27 rules applied. Total rules applied 206 place count 194 transition count 380
Reduce places removed 3 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 3 with 5 rules applied. Total rules applied 211 place count 191 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 190 transition count 378
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 212 place count 190 transition count 374
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 220 place count 186 transition count 374
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 249 place count 157 transition count 321
Iterating global reduction 5 with 29 rules applied. Total rules applied 278 place count 157 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 284 place count 157 transition count 315
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 285 place count 156 transition count 310
Iterating global reduction 6 with 1 rules applied. Total rules applied 286 place count 156 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 287 place count 156 transition count 309
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 7 with 118 rules applied. Total rules applied 405 place count 97 transition count 250
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 414 place count 88 transition count 209
Iterating global reduction 7 with 9 rules applied. Total rules applied 423 place count 88 transition count 209
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 432 place count 88 transition count 200
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 434 place count 86 transition count 198
Applied a total of 434 rules in 78 ms. Remains 86 /464 variables (removed 378) and now considering 198/694 (removed 496) transitions.
[2025-06-07 19:19:43] [INFO ] Flow matrix only has 103 transitions (discarded 95 similar events)
// Phase 1: matrix 103 rows 86 cols
[2025-06-07 19:19:43] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:19:43] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-07 19:19:43] [INFO ] Flow matrix only has 103 transitions (discarded 95 similar events)
[2025-06-07 19:19:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:19:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-07 19:19:43] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:19:43] [INFO ] Redundant transitions in 6 ms returned []
Running 136 sub problems to find dead transitions.
[2025-06-07 19:19:43] [INFO ] Flow matrix only has 103 transitions (discarded 95 similar events)
[2025-06-07 19:19:43] [INFO ] Invariant cache hit.
[2025-06-07 19:19:43] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 3/86 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 102/188 variables, 86/113 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/189 variables, and 115 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3320 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 86/86 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 3/86 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 102/188 variables, 86/113 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 136/251 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:19:48] [INFO ] Deduced a trap along path composed of 4 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:19:48] [INFO ] Deduced a trap along path composed of 4 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:19:48] [INFO ] Deduced a trap along path composed of 4 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:19:48] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:19:49] [INFO ] Deduced a trap along path composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 5/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/189 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5168 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 86/86 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 8504ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 8504ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/464 places, 198/694 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8728 ms. Remains : 86/464 places, 198/694 transitions.
[2025-06-07 19:19:51] [INFO ] Flatten gal took : 5 ms
[2025-06-07 19:19:51] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:19:51] [INFO ] Input system was already deterministic with 198 transitions.
[2025-06-07 19:19:51] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:19:51] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:19:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11538255357924126127.gal : 1 ms
[2025-06-07 19:19:51] [INFO ] Time to serialize properties into /tmp/CTLFireability16384733137232691698.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/CTLFireability11538255357924126127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16384733137232691698.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.13114e+12,0.02655,4980,2,155,5,1768,6,0,519,915,0
Converting to forward existential form...Done !
original formula: EG((AG(((((p413==0)||(p475==0))||((p308==0)||(p62==1)))||(p650==1))) * EF(((p467==1)&&(p584==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(((((p413==0)||(p475==0))||((p308==0)||(p62==1)))||(p650==1))))) * E(TRUE U ((p467==1)&&...178
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.127136,7796,1,0,13,24033,22,5,2569,14569,10
FORMULA Champagne-PT-H07T1U-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 416 transition count 646
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 416 transition count 646
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 126 place count 386 transition count 616
Iterating global reduction 0 with 30 rules applied. Total rules applied 156 place count 386 transition count 616
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 170 place count 372 transition count 602
Iterating global reduction 0 with 14 rules applied. Total rules applied 184 place count 372 transition count 602
Applied a total of 184 rules in 19 ms. Remains 372 /464 variables (removed 92) and now considering 602/694 (removed 92) transitions.
// Phase 1: matrix 602 rows 372 cols
[2025-06-07 19:19:52] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:19:52] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-07 19:19:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:19:52] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2025-06-07 19:19:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (OVERLAPS) 602/974 variables, 372/399 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 974/974 variables, and 399 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (OVERLAPS) 602/974 variables, 372/399 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/974 variables, 601/1000 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:20:44] [INFO ] Deduced a trap along path composed of 13 places in 33 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 974/974 variables, and 1001 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 372/464 places, 602/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60483 ms. Remains : 372/464 places, 602/694 transitions.
[2025-06-07 19:20:52] [INFO ] Flatten gal took : 11 ms
[2025-06-07 19:20:52] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:20:52] [INFO ] Input system was already deterministic with 602 transitions.
[2025-06-07 19:20:52] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:20:52] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:20:52] [INFO ] Time to serialize gal into /tmp/CTLFireability9126394367822976902.gal : 2 ms
[2025-06-07 19:20:52] [INFO ] Time to serialize properties into /tmp/CTLFireability9060545089775266562.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/CTLFireability9126394367822976902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9060545089775266562.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.
Detected timeout of ITS tools.
[2025-06-07 19:21:22] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:21:22] [INFO ] Applying decomposition
[2025-06-07 19:21:22] [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/graph7407396356814715057.txt' '-o' '/tmp/graph7407396356814715057.bin' '-w' '/tmp/graph7407396356814715057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7407396356814715057.bin' '-l' '-1' '-v' '-w' '/tmp/graph7407396356814715057.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:21:22] [INFO ] Decomposing Gal with order
[2025-06-07 19:21:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:21:22] [INFO ] Removed a total of 493 redundant transitions.
[2025-06-07 19:21:22] [INFO ] Flatten gal took : 23 ms
[2025-06-07 19:21:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2025-06-07 19:21:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10826194890365332180.gal : 17 ms
[2025-06-07 19:21:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1936486249958777599.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/CTLFireability10826194890365332180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1936486249958777599.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,8.21165e+29,0.813791,37756,8384,20,50446,478,746,129528,60,1041,0
Converting to forward existential form...Done !
original formula: (!(E(EF((((i22.u97.p513==1)&&(i15.u73.p388==1))&&(i21.u90.p475==1))) U ((i13.u65.p338==1)&&(i22.u97.p500==1)))) * (EX(((i11.u57.p284==1)&...202
=> equivalent forward existential formula: ([(FwdU(Init,E(TRUE U (((i22.u97.p513==1)&&(i15.u73.p388==1))&&(i21.u90.p475==1)))) * ((i13.u65.p338==1)&&(i22.u...281
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t64, t109, t169, t228, i0.t396, i1.t382, i2.t367, i3.t352, i4.t337, i5.t322, i6.t307...447
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Graph (trivial) has 476 edges and 464 vertex of which 214 / 464 are part of one of the 26 SCC in 1 ms
Free SCC test removed 188 places
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 275 transition count 420
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
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 1 with 117 rules applied. Total rules applied 185 place count 208 transition count 370
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 210 place count 183 transition count 370
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 210 place count 183 transition count 369
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 182 transition count 369
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 240 place count 154 transition count 314
Iterating global reduction 3 with 28 rules applied. Total rules applied 268 place count 154 transition count 314
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 274 place count 154 transition count 308
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 275 place count 153 transition count 303
Iterating global reduction 4 with 1 rules applied. Total rules applied 276 place count 153 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 277 place count 153 transition count 302
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 401 place count 91 transition count 240
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 412 place count 80 transition count 190
Iterating global reduction 5 with 11 rules applied. Total rules applied 423 place count 80 transition count 190
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 434 place count 80 transition count 179
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 436 place count 78 transition count 177
Applied a total of 436 rules in 32 ms. Remains 78 /464 variables (removed 386) and now considering 177/694 (removed 517) transitions.
[2025-06-07 19:21:52] [INFO ] Flow matrix only has 79 transitions (discarded 98 similar events)
// Phase 1: matrix 79 rows 78 cols
[2025-06-07 19:21:52] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:21:52] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-07 19:21:52] [INFO ] Flow matrix only has 79 transitions (discarded 98 similar events)
[2025-06-07 19:21:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:21:53] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:21:53] [INFO ] Redundant transitions in 1 ms returned []
Running 104 sub problems to find dead transitions.
[2025-06-07 19:21:53] [INFO ] Flow matrix only has 79 transitions (discarded 98 similar events)
[2025-06-07 19:21:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 78/156 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/156 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/157 variables, and 105 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2267 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 78/156 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 104/209 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/156 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/157 variables, and 209 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2409 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4687ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 4687ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/464 places, 177/694 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4933 ms. Remains : 78/464 places, 177/694 transitions.
[2025-06-07 19:21:57] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:21:57] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:21:57] [INFO ] Input system was already deterministic with 177 transitions.
[2025-06-07 19:21:57] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 147 steps (2 resets) in 7 ms. (18 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H07T1U-CTLFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 19:21:57] [INFO ] Flatten gal took : 5 ms
[2025-06-07 19:21:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality834675539368810179.gal : 1 ms
[2025-06-07 19:21:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2181875947461239978.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality834675539368810179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2181875947461239978.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 416 transition count 646
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 416 transition count 646
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 127 place count 385 transition count 615
Iterating global reduction 0 with 31 rules applied. Total rules applied 158 place count 385 transition count 615
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 172 place count 371 transition count 601
Iterating global reduction 0 with 14 rules applied. Total rules applied 186 place count 371 transition count 601
Applied a total of 186 rules in 21 ms. Remains 371 /464 variables (removed 93) and now considering 601/694 (removed 93) transitions.
// Phase 1: matrix 601 rows 371 cols
[2025-06-07 19:21:57] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:21:57] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-07 19:21:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:21:58] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-07 19:21:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 601/972 variables, 371/398 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 972/972 variables, and 398 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 601/972 variables, 371/398 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 600/998 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:22:50] [INFO ] Deduced a trap along path composed of 13 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 999 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 371/464 places, 601/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60492 ms. Remains : 371/464 places, 601/694 transitions.
[2025-06-07 19:22:58] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:22:58] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:22:58] [INFO ] Input system was already deterministic with 601 transitions.
[2025-06-07 19:22:58] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:22:58] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:22:58] [INFO ] Time to serialize gal into /tmp/CTLFireability3420503733433708617.gal : 2 ms
[2025-06-07 19:22:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11340940619465926898.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/CTLFireability3420503733433708617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11340940619465926898.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.
Detected timeout of ITS tools.
[2025-06-07 19:23:28] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:23:28] [INFO ] Applying decomposition
[2025-06-07 19:23:28] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9117513008952583446.txt' '-o' '/tmp/graph9117513008952583446.bin' '-w' '/tmp/graph9117513008952583446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9117513008952583446.bin' '-l' '-1' '-v' '-w' '/tmp/graph9117513008952583446.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:23:28] [INFO ] Decomposing Gal with order
[2025-06-07 19:23:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:23:28] [INFO ] Removed a total of 491 redundant transitions.
[2025-06-07 19:23:28] [INFO ] Flatten gal took : 22 ms
[2025-06-07 19:23:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 7 ms.
[2025-06-07 19:23:28] [INFO ] Time to serialize gal into /tmp/CTLFireability6008489389443762667.gal : 4 ms
[2025-06-07 19:23:28] [INFO ] Time to serialize properties into /tmp/CTLFireability16829781099983756734.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/CTLFireability6008489389443762667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16829781099983756734.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.66579e+29,0.796423,37768,8292,20,49052,619,841,131739,60,1316,0
Converting to forward existential form...Done !
original formula: AG((AX((AX((i1.u8.p37==0)) * EG(((i12.i1.u61.p309==0)||(i13.i1.u66.p327==0))))) + AX((i11.i1.u54.p274==0))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(!(EX(!((!(EX(!((i1.u8.p37==0)))) * EG(((i12.i1.u61.p309==0)||(i13.i1.u66.p327==0))))))...195
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t64, t108, t167, t226, i0.i1.t394, i1.u10.t380, i2.i1.t365, i3.i1.t350, i4.i1.t335, ...467
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
(forward)formula 0,0,18.4417,419848,1,0,960033,619,5517,1.31271e+06,291,1316,1546897
FORMULA Champagne-PT-H07T1U-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 419 transition count 649
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 419 transition count 649
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 117 place count 392 transition count 622
Iterating global reduction 0 with 27 rules applied. Total rules applied 144 place count 392 transition count 622
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 155 place count 381 transition count 611
Iterating global reduction 0 with 11 rules applied. Total rules applied 166 place count 381 transition count 611
Applied a total of 166 rules in 27 ms. Remains 381 /464 variables (removed 83) and now considering 611/694 (removed 83) transitions.
// Phase 1: matrix 611 rows 381 cols
[2025-06-07 19:23:47] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:23:47] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-07 19:23:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:23:47] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 610 sub problems to find dead transitions.
[2025-06-07 19:23:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (OVERLAPS) 611/992 variables, 381/408 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 992/992 variables, and 408 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 610 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (OVERLAPS) 611/992 variables, 381/408 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/992 variables, 610/1018 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:24:40] [INFO ] Deduced a trap along path composed of 13 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 992/992 variables, and 1019 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 381/464 places, 611/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60504 ms. Remains : 381/464 places, 611/694 transitions.
[2025-06-07 19:24:47] [INFO ] Flatten gal took : 16 ms
[2025-06-07 19:24:47] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:24:47] [INFO ] Input system was already deterministic with 611 transitions.
[2025-06-07 19:24:47] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:24:47] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:24:47] [INFO ] Time to serialize gal into /tmp/CTLFireability2345105767943354677.gal : 2 ms
[2025-06-07 19:24:47] [INFO ] Time to serialize properties into /tmp/CTLFireability8027875941606774699.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/CTLFireability2345105767943354677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8027875941606774699.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.
Detected timeout of ITS tools.
[2025-06-07 19:25:17] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:25:17] [INFO ] Applying decomposition
[2025-06-07 19:25:17] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5594420585112890907.txt' '-o' '/tmp/graph5594420585112890907.bin' '-w' '/tmp/graph5594420585112890907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5594420585112890907.bin' '-l' '-1' '-v' '-w' '/tmp/graph5594420585112890907.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:25:17] [INFO ] Decomposing Gal with order
[2025-06-07 19:25:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:25:17] [INFO ] Removed a total of 474 redundant transitions.
[2025-06-07 19:25:17] [INFO ] Flatten gal took : 23 ms
[2025-06-07 19:25:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2025-06-07 19:25:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8333084199124082616.gal : 4 ms
[2025-06-07 19:25:17] [INFO ] Time to serialize properties into /tmp/CTLFireability1561356790171850925.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/CTLFireability8333084199124082616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1561356790171850925.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.58326e+30,0.326653,19008,3191,20,21353,563,913,48453,57,1239,0
Converting to forward existential form...Done !
original formula: E((((A(!(AG(((i19.i1.u96.p487==1)||(i20.i0.u100.p517==1)))) U ((EF((i25.i2.u131.p663==1)) * A((i6.i0.u34.p163==1) U ((i10.i0.u52.p259==1)...575
=> equivalent forward existential formula: [FwdG(FwdU(Init,(((!((E(!(((E(TRUE U (i25.i2.u131.p663==1)) * !((E(!(((i10.i0.u52.p259==1)&&(i16.i1.u79.p402==1)...1315
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t66, t110, t171, t230, i0.t373, i1.i1.t403, i2.i1.t388, i3.i1.t358, i4.i1.t343, i5.i...500
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 423 transition count 653
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 423 transition count 653
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 109 place count 396 transition count 626
Iterating global reduction 0 with 27 rules applied. Total rules applied 136 place count 396 transition count 626
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 149 place count 383 transition count 613
Iterating global reduction 0 with 13 rules applied. Total rules applied 162 place count 383 transition count 613
Applied a total of 162 rules in 21 ms. Remains 383 /464 variables (removed 81) and now considering 613/694 (removed 81) transitions.
// Phase 1: matrix 613 rows 383 cols
[2025-06-07 19:25:47] [INFO ] Computed 27 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:25:48] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-07 19:25:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:25:48] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 612 sub problems to find dead transitions.
[2025-06-07 19:25:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 1 (OVERLAPS) 1/383 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 3 (OVERLAPS) 613/996 variables, 383/410 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 996/996 variables, and 410 constraints, problems are : Problem set: 0 solved, 612 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 612/612 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 1 (OVERLAPS) 1/383 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 3 (OVERLAPS) 613/996 variables, 383/410 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/996 variables, 612/1022 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:26:41] [INFO ] Deduced a trap along path composed of 13 places in 46 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 996/996 variables, and 1023 constraints, problems are : Problem set: 0 solved, 612 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 612/612 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 612 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 383/464 places, 613/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60495 ms. Remains : 383/464 places, 613/694 transitions.
[2025-06-07 19:26:48] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:26:48] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:26:48] [INFO ] Input system was already deterministic with 613 transitions.
[2025-06-07 19:26:48] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:26:48] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:26:48] [INFO ] Time to serialize gal into /tmp/CTLFireability13557985687249329224.gal : 2 ms
[2025-06-07 19:26:48] [INFO ] Time to serialize properties into /tmp/CTLFireability10242770189804704669.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/CTLFireability13557985687249329224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10242770189804704669.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,1.81605e+30,23.5293,604308,2,68128,5,3.03189e+06,6,0,2147,2.30427e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-07 19:27:18] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:27:18] [INFO ] Applying decomposition
[2025-06-07 19:27:18] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph527012276446524099.txt' '-o' '/tmp/graph527012276446524099.bin' '-w' '/tmp/graph527012276446524099.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph527012276446524099.bin' '-l' '-1' '-v' '-w' '/tmp/graph527012276446524099.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:27:18] [INFO ] Decomposing Gal with order
[2025-06-07 19:27:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:27:18] [INFO ] Removed a total of 480 redundant transitions.
[2025-06-07 19:27:18] [INFO ] Flatten gal took : 22 ms
[2025-06-07 19:27:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2025-06-07 19:27:18] [INFO ] Time to serialize gal into /tmp/CTLFireability12329071211650821261.gal : 4 ms
[2025-06-07 19:27:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9453577158961837955.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/CTLFireability12329071211650821261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9453577158961837955.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,1.81605e+30,0.775822,38040,8406,20,49531,623,899,132358,58,1296,0
Converting to forward existential form...Done !
original formula: !(E(AX(((((!((i22.i0.u105.p552==1)&&(i23.i1.u113.p582==1)))||((i7.i1.u36.p179==1)&&(i12.i1.u60.p298==1)))||((i13.i0.u64.p339==1)||(i23.i0...416
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(EX(!(((((!((i22.i0.u105.p552==1)&&(i23.i1.u113.p582==1)))||((i7.i1.u36.p179==1)&&(i12.i1.u60...949
Reverse transition relation is NOT exact ! Due to transitions t6, t36, t66, t113, t173, t235, i1.u16.t376, i2.i1.t406, i3.i1.t392, i4.i1.t361, i5.i1.t346, ...517
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Graph (trivial) has 464 edges and 464 vertex of which 211 / 464 are part of one of the 26 SCC in 3 ms
Free SCC test removed 185 places
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 278 transition count 433
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 108 rules applied. Total rules applied 168 place count 219 transition count 384
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 194 place count 195 transition count 382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 196 place count 193 transition count 382
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 196 place count 193 transition count 377
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 206 place count 188 transition count 377
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 233 place count 161 transition count 322
Iterating global reduction 4 with 27 rules applied. Total rules applied 260 place count 161 transition count 322
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 267 place count 161 transition count 315
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 268 place count 160 transition count 310
Iterating global reduction 5 with 1 rules applied. Total rules applied 269 place count 160 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 270 place count 160 transition count 309
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 388 place count 101 transition count 250
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 399 place count 90 transition count 204
Iterating global reduction 6 with 11 rules applied. Total rules applied 410 place count 90 transition count 204
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 421 place count 90 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 422 place count 90 transition count 192
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 424 place count 88 transition count 190
Applied a total of 424 rules in 45 ms. Remains 88 /464 variables (removed 376) and now considering 190/694 (removed 504) transitions.
[2025-06-07 19:27:48] [INFO ] Flow matrix only has 105 transitions (discarded 85 similar events)
// Phase 1: matrix 105 rows 88 cols
[2025-06-07 19:27:48] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:27:48] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-07 19:27:48] [INFO ] Flow matrix only has 105 transitions (discarded 85 similar events)
[2025-06-07 19:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:27:48] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:27:48] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2025-06-07 19:27:48] [INFO ] Flow matrix only has 105 transitions (discarded 85 similar events)
[2025-06-07 19:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 3/88 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:27:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 104/192 variables, 88/116 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/193 variables, and 116 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3128 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 3/88 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 104/192 variables, 88/116 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 116/232 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:27:54] [INFO ] Deduced a trap along path composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/192 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/193 variables, and 233 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5393 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8534ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 8534ms
Starting structural reductions in SI_CTL mode, iteration 1 : 88/464 places, 190/694 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8750 ms. Remains : 88/464 places, 190/694 transitions.
[2025-06-07 19:27:57] [INFO ] Flatten gal took : 5 ms
[2025-06-07 19:27:57] [INFO ] Flatten gal took : 5 ms
[2025-06-07 19:27:57] [INFO ] Input system was already deterministic with 190 transitions.
[2025-06-07 19:27:57] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:27:57] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:27:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2147416159234710956.gal : 0 ms
[2025-06-07 19:27:57] [INFO ] Time to serialize properties into /tmp/CTLFireability12827889604632992655.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/CTLFireability2147416159234710956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12827889604632992655.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.65299e+13,0.038346,5020,2,206,5,3559,6,0,518,2439,0
Converting to forward existential form...Done !
original formula: AG((EG(E((p173!=1) U (p438==1))) + ((p317==0) * ((AG(((p29==0)||(p217==0))) + AG((p408==0))) + !(A((p30==1) U (p16==1)))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(E((p173!=1) U (p438==1))))) * !((p317==0)))] = FALSE * [(FwdU((((FwdU(Init,TRUE) * !(...338
Reverse transition relation is NOT exact ! Due to transitions t43, t67, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.40839,89680,1,0,889,453895,402,453,3551,685513,991
FORMULA Champagne-PT-H07T1U-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 415 transition count 645
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 415 transition count 645
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 129 place count 384 transition count 614
Iterating global reduction 0 with 31 rules applied. Total rules applied 160 place count 384 transition count 614
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 174 place count 370 transition count 600
Iterating global reduction 0 with 14 rules applied. Total rules applied 188 place count 370 transition count 600
Applied a total of 188 rules in 19 ms. Remains 370 /464 variables (removed 94) and now considering 600/694 (removed 94) transitions.
// Phase 1: matrix 600 rows 370 cols
[2025-06-07 19:27:59] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:28:00] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-07 19:28:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:28:00] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2025-06-07 19:28:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/970 variables, 370/397 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 970/970 variables, and 397 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/970 variables, 370/397 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/970 variables, 599/996 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:28:51] [INFO ] Deduced a trap along path composed of 13 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 970/970 variables, and 997 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 370/464 places, 600/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60433 ms. Remains : 370/464 places, 600/694 transitions.
[2025-06-07 19:29:00] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:29:00] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:29:00] [INFO ] Input system was already deterministic with 600 transitions.
[2025-06-07 19:29:00] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:29:00] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:29:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11857046634170480954.gal : 2 ms
[2025-06-07 19:29:00] [INFO ] Time to serialize properties into /tmp/CTLFireability3102172614760716709.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/CTLFireability11857046634170480954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3102172614760716709.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.
Detected timeout of ITS tools.
[2025-06-07 19:29:30] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:29:30] [INFO ] Applying decomposition
[2025-06-07 19:29:30] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6244073338473165485.txt' '-o' '/tmp/graph6244073338473165485.bin' '-w' '/tmp/graph6244073338473165485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6244073338473165485.bin' '-l' '-1' '-v' '-w' '/tmp/graph6244073338473165485.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:29:30] [INFO ] Decomposing Gal with order
[2025-06-07 19:29:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:29:30] [INFO ] Removed a total of 480 redundant transitions.
[2025-06-07 19:29:30] [INFO ] Flatten gal took : 19 ms
[2025-06-07 19:29:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2025-06-07 19:29:30] [INFO ] Time to serialize gal into /tmp/CTLFireability2494791046814710527.gal : 4 ms
[2025-06-07 19:29:30] [INFO ] Time to serialize properties into /tmp/CTLFireability9981193868920593297.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/CTLFireability2494791046814710527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9981193868920593297.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,7.08021e+29,0.107258,7828,442,20,5432,574,856,5546,59,1218,0
Converting to forward existential form...Done !
original formula: AX(EF((i3.i0.u19.p93==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (i3.i0.u19.p93==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t64, t108, t167, t226, i0.i1.t365, i1.i1.t394, i2.i1.t380, i3.i1.t350, i4.i1.t335, i...462
(forward)formula 0,1,0.835736,39572,1,0,93859,574,5482,96745,288,1218,181066
FORMULA Champagne-PT-H07T1U-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Graph (trivial) has 479 edges and 464 vertex of which 221 / 464 are part of one of the 27 SCC in 2 ms
Free SCC test removed 194 places
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 269 transition count 417
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
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 1 with 114 rules applied. Total rules applied 179 place count 205 transition count 367
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 204 place count 180 transition count 367
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 232 place count 152 transition count 311
Iterating global reduction 3 with 28 rules applied. Total rules applied 260 place count 152 transition count 311
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 267 place count 152 transition count 304
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 268 place count 151 transition count 299
Iterating global reduction 4 with 1 rules applied. Total rules applied 269 place count 151 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 270 place count 151 transition count 298
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 392 place count 90 transition count 237
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 403 place count 79 transition count 189
Iterating global reduction 5 with 11 rules applied. Total rules applied 414 place count 79 transition count 189
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 425 place count 79 transition count 178
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 427 place count 77 transition count 176
Applied a total of 427 rules in 28 ms. Remains 77 /464 variables (removed 387) and now considering 176/694 (removed 518) transitions.
[2025-06-07 19:29:31] [INFO ] Flow matrix only has 73 transitions (discarded 103 similar events)
// Phase 1: matrix 73 rows 77 cols
[2025-06-07 19:29:31] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:29:31] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-07 19:29:31] [INFO ] Flow matrix only has 73 transitions (discarded 103 similar events)
[2025-06-07 19:29:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:29:31] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:29:31] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-07 19:29:31] [INFO ] Flow matrix only has 73 transitions (discarded 103 similar events)
[2025-06-07 19:29:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 72/149 variables, 77/104 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/149 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/150 variables, and 104 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2168 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 72/149 variables, 77/104 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/150 variables, and 205 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2306 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4518ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 4518ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/464 places, 176/694 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4827 ms. Remains : 77/464 places, 176/694 transitions.
[2025-06-07 19:29:36] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:29:36] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:29:36] [INFO ] Input system was already deterministic with 176 transitions.
[2025-06-07 19:29:36] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:29:36] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:29:36] [INFO ] Time to serialize gal into /tmp/CTLFireability11308741495847349293.gal : 1 ms
[2025-06-07 19:29:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4184207451179033301.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/CTLFireability11308741495847349293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4184207451179033301.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,8.92617e+11,0.02325,4824,2,128,5,1514,6,0,460,770,0
Converting to forward existential form...Done !
original formula: AF(AG((p325==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p325==0))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.231274,13144,1,0,63,49091,21,62,2219,64710,69
FORMULA Champagne-PT-H07T1U-CTLFireability-2025-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 417 transition count 647
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 417 transition count 647
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 123 place count 388 transition count 618
Iterating global reduction 0 with 29 rules applied. Total rules applied 152 place count 388 transition count 618
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 165 place count 375 transition count 605
Iterating global reduction 0 with 13 rules applied. Total rules applied 178 place count 375 transition count 605
Applied a total of 178 rules in 21 ms. Remains 375 /464 variables (removed 89) and now considering 605/694 (removed 89) transitions.
// Phase 1: matrix 605 rows 375 cols
[2025-06-07 19:29:36] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:29:36] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-06-07 19:29:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:29:36] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2025-06-07 19:29:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (OVERLAPS) 605/980 variables, 375/402 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 402 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (OVERLAPS) 605/980 variables, 375/402 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/980 variables, 604/1006 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:30:29] [INFO ] Deduced a trap along path composed of 13 places in 41 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 1)
(t4 1)
(t5 1)
(t6 1)
(t7 3)
(t8 1)
(t9 1)
(t10 0)
(t11 1)
(t12 1)
(t13 1)
(t14 2)
(t15 2)
(t16 1)
(t17 1)
(t18 4)
(t19 1)
(t20 4)
(t21 0)
(t22 0)
(t23 0)
(t24 0)
(t25 0)
(t26 0)
(t27 0)
(t28 0)
(t29 0)
(t30 0)
(t31 0)
(t32 0)
(t33 0)
(t34 0)
(t35 1)
(t36 3)
(t37 0)
(t38 0)
(t39 1)
(t40 1)
(t41 1)
(t42 2)
(t43 3)
(t44 3)
(t45 1)
(t46 1)
(t47 4)
(t48 1)
(t49 4)
(t50 3)
(t51 1)
(t52 1)
(t53 0)
(t54 1)
(t55 1)
(t56 0)
(t57 1)
(t58 1)
(t59 1)
(t60 3)
(t61 6)
(t62 1)
(t63 6)
(t64 1)
(t65 4)
(t66 1)
(t67 1)
(t68 1)
(t69 2)
(t70 1)
(t71 0)
(t72 1)
(t73 1)
(t74 1)
(t75 2)
(t76 6)
(t77 1)
(t78 6)
(t79 1)
(t80 4)
(t81 1)
(t82 1)
(t83 1)
(t84 2)
(t85 2)
(t86 1)
(t87 2)
(t88 2)
(t89 1)
(t90 1)
(t91 5)
(t92 0)
(t93 5)
(t94 4)
(t95 2)
(t96 2)
(t97 0)
(t98 2)
(t99 1)
(t100 2)
(t101 3)
(t102 3)
(t103 1)
(t104 0)
(t105 4)
(t106 1)
(t107 4)
(t108 1)
(t109 2)
(t110 0)
(t111 0)
(t112 0)
(t113 0)
(t114 1)
(t115 0)
(t116 1)
(t117 1)
(t118 1)
(t119 0)
(t120 2)
(t121 0)
(t122 2)
(t123 1)
(t124 1)
(t125 0)
(t126 0)
(t127 0)
(t128 0)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 2)
(t134 2)
(t135 2)
(t136 0)
(t137 0)
(t138 1)
(t139 1)
(t140 1)
(t141 1)
(t142 5)
(t143 1)
(t144 1)
(t145 2)
(t146 3)
(t147 1)
(t148 0)
(t149 1)
(t150 1)
(t151 1)
(t152 1)
(t153 6)
(t154 1)
(t155 6)
(t156 4)
(t157 1)
(t158 1)
(t159 1)
(t160 2)
(t161 1)
(t162 0)
(t163 1)
(t164 1)
(t165 1)
(t166 3)
(t167 7)
(t168 1)
(t169 7)
(t170 1)
(t171 4)
(t172 1)
(t173 1)
(t174 1)
(t175 2)
(t176 2)
(t177 1)
(t178 2)
(t179 2)
(t180 1)
(t181 0)
(t182 4)
(t183 0)
(t184 4)
(t185 1)
(t186 3)
(t187 1)
(t188 1)
(t189 1)
(t190 2)
(t191 0)
(t192 1)
(t193 1)
(t194 1)
(t195 0)
(t196 1)
(t197 3)
(t198 0)
(t199 3)
(t200 1)
(t201 4)
(t202 1)
(t203 1)
(t204 1)
(t205 2)
(t206 2)
(t207 1)
(t208 2)
(t209 2)
(t210 1)
(t211 0)
(t212 4)
(t213 0)
(t214 4)
(t215 1)
(t216 0)
(t217 0)
(t218 0)
(t219 0)
(t220 1)
(t221 1)
(t222 1)
(t223 1)
(t224 0)
(t225 0)
(t226 1)
(t227 0)
(t228 1)
(t229 1)
(t230 1)
(t231 0)
(t232 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1007 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 375/464 places, 605/694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60626 ms. Remains : 375/464 places, 605/694 transitions.
[2025-06-07 19:30:37] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:30:37] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:30:37] [INFO ] Input system was already deterministic with 605 transitions.
[2025-06-07 19:30:37] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:30:37] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:30:37] [INFO ] Time to serialize gal into /tmp/CTLFireability3429485595180305352.gal : 2 ms
[2025-06-07 19:30:37] [INFO ] Time to serialize properties into /tmp/CTLFireability9841815119384237569.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/CTLFireability3429485595180305352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9841815119384237569.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.
Detected timeout of ITS tools.
[2025-06-07 19:31:07] [INFO ] Flatten gal took : 11 ms
[2025-06-07 19:31:07] [INFO ] Applying decomposition
[2025-06-07 19:31:07] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11766792600700876850.txt' '-o' '/tmp/graph11766792600700876850.bin' '-w' '/tmp/graph11766792600700876850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11766792600700876850.bin' '-l' '-1' '-v' '-w' '/tmp/graph11766792600700876850.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:31:07] [INFO ] Decomposing Gal with order
[2025-06-07 19:31:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:31:07] [INFO ] Removed a total of 497 redundant transitions.
[2025-06-07 19:31:07] [INFO ] Flatten gal took : 19 ms
[2025-06-07 19:31:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 3 ms.
[2025-06-07 19:31:07] [INFO ] Time to serialize gal into /tmp/CTLFireability12225671074201635478.gal : 3 ms
[2025-06-07 19:31:07] [INFO ] Time to serialize properties into /tmp/CTLFireability7270389627429014598.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/CTLFireability12225671074201635478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7270389627429014598.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,1.01653e+30,0.164931,11188,1793,20,12508,619,827,10477,57,1292,0
Converting to forward existential form...Done !
original formula: AF(E(!((!(((i19.u89.p467==1)&&(i23.i0.u111.p578==1))) * AX(AX(((i2.i1.u13.p54==1)&&(i9.i1.u47.p217==1)))))) U (EF((i7.i0.u37.p170==1)) * ...178
=> equivalent forward existential formula: [FwdG(Init,!(E(!((!(((i19.u89.p467==1)&&(i23.i0.u111.p578==1))) * !(EX(!(!(EX(!(((i2.i1.u13.p54==1)&&(i9.i1.u47....241
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t64, t108, t170, t229, i1.i1.t399, i2.i1.t385, i3.i1.t370, i4.i1.t355, i5.i1.t340, i...468
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Graph (trivial) has 476 edges and 464 vertex of which 214 / 464 are part of one of the 26 SCC in 0 ms
Free SCC test removed 188 places
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 275 transition count 421
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
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 1 with 116 rules applied. Total rules applied 183 place count 209 transition count 371
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 208 place count 184 transition count 371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 208 place count 184 transition count 370
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 210 place count 183 transition count 370
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 238 place count 155 transition count 318
Iterating global reduction 3 with 28 rules applied. Total rules applied 266 place count 155 transition count 318
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 272 place count 155 transition count 312
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 273 place count 154 transition count 307
Iterating global reduction 4 with 1 rules applied. Total rules applied 274 place count 154 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 275 place count 154 transition count 306
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 401 place count 91 transition count 243
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 412 place count 80 transition count 194
Iterating global reduction 5 with 11 rules applied. Total rules applied 423 place count 80 transition count 194
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 434 place count 80 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 436 place count 78 transition count 181
Applied a total of 436 rules in 43 ms. Remains 78 /464 variables (removed 386) and now considering 181/694 (removed 513) transitions.
[2025-06-07 19:31:37] [INFO ] Flow matrix only has 81 transitions (discarded 100 similar events)
// Phase 1: matrix 81 rows 78 cols
[2025-06-07 19:31:37] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:31:37] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-07 19:31:37] [INFO ] Flow matrix only has 81 transitions (discarded 100 similar events)
[2025-06-07 19:31:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:31:37] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:31:37] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2025-06-07 19:31:37] [INFO ] Flow matrix only has 81 transitions (discarded 100 similar events)
[2025-06-07 19:31:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 80/158 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/158 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/159 variables, and 105 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2349 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 80/158 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 108/213 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/158 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/159 variables, and 213 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2408 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4806ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 4807ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/464 places, 181/694 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5039 ms. Remains : 78/464 places, 181/694 transitions.
[2025-06-07 19:31:42] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:31:42] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:31:42] [INFO ] Input system was already deterministic with 181 transitions.
[2025-06-07 19:31:42] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:31:42] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:31:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3142196704235791196.gal : 1 ms
[2025-06-07 19:31:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9447488004396707018.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/CTLFireability3142196704235791196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9447488004396707018.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,1.19016e+12,0.021951,4864,2,130,5,1528,6,0,470,777,0
Converting to forward existential form...Done !
original formula: AG(EF(((p363==1)&&(p475==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p363==1)&&(p475==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.073482,6144,1,0,9,13603,14,3,2099,7746,5
FORMULA Champagne-PT-H07T1U-CTLFireability-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 464/464 places, 694/694 transitions.
Graph (trivial) has 459 edges and 464 vertex of which 190 / 464 are part of one of the 25 SCC in 1 ms
Free SCC test removed 165 places
Ensure Unique test removed 179 transitions
Reduce isomorphic transitions removed 179 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 298 transition count 444
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
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 1 with 120 rules applied. Total rules applied 191 place count 228 transition count 394
Reduce places removed 25 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 28 rules applied. Total rules applied 219 place count 203 transition count 391
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 222 place count 200 transition count 391
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 222 place count 200 transition count 388
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 228 place count 197 transition count 388
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 254 place count 171 transition count 334
Iterating global reduction 4 with 26 rules applied. Total rules applied 280 place count 171 transition count 334
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 287 place count 171 transition count 327
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 287 place count 171 transition count 326
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 289 place count 170 transition count 326
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 417 place count 106 transition count 262
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 425 place count 98 transition count 231
Iterating global reduction 5 with 8 rules applied. Total rules applied 433 place count 98 transition count 231
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 441 place count 98 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 442 place count 98 transition count 222
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 444 place count 96 transition count 220
Applied a total of 444 rules in 23 ms. Remains 96 /464 variables (removed 368) and now considering 220/694 (removed 474) transitions.
[2025-06-07 19:31:42] [INFO ] Flow matrix only has 110 transitions (discarded 110 similar events)
// Phase 1: matrix 110 rows 96 cols
[2025-06-07 19:31:42] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:31:42] [INFO ] Implicit Places using invariants in 319 ms returned []
[2025-06-07 19:31:42] [INFO ] Flow matrix only has 110 transitions (discarded 110 similar events)
[2025-06-07 19:31:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:31:42] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:31:42] [INFO ] Redundant transitions in 1 ms returned []
Running 154 sub problems to find dead transitions.
[2025-06-07 19:31:42] [INFO ] Flow matrix only has 110 transitions (discarded 110 similar events)
[2025-06-07 19:31:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 6/96 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 109/205 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/205 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/206 variables, and 123 constraints, problems are : Problem set: 0 solved, 154 unsolved in 3979 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 6/96 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 109/205 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 154/277 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:31:50] [INFO ] Deduced a trap along path composed of 7 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:31:50] [INFO ] Deduced a trap along path composed of 4 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:31:50] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/205 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/206 variables, and 280 constraints, problems are : Problem set: 0 solved, 154 unsolved in 7116 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 11111ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 11113ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/464 places, 220/694 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11554 ms. Remains : 96/464 places, 220/694 transitions.
[2025-06-07 19:31:54] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:31:54] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:31:54] [INFO ] Input system was already deterministic with 220 transitions.
[2025-06-07 19:31:54] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:31:54] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:31:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2491699321193420973.gal : 1 ms
[2025-06-07 19:31:54] [INFO ] Time to serialize properties into /tmp/CTLFireability15150849318142893482.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/CTLFireability2491699321193420973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15150849318142893482.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,8.55737e+13,0.029143,5244,2,170,5,2108,6,0,580,1087,0
Converting to forward existential form...Done !
original formula: EF((AG(((p226==1)&&((p316==1)||((p179==1)&&(p267==1))))) + A(E((p369==1) U (p146==1)) U (AF((p427==1)) * ((p545==1)||(p390==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(((p226==1)&&((p316==1)||((p179==1)&&(p267==1))))))))] != FALSE + [((FwdU(Init,...374
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 218/0/2
Hit Full ! (commute/partial/dont) 218/0/2
Using saturation style SCC detection
(forward)formula 0,1,0.570908,26120,1,0,145,129530,40,99,2978,148670,108
FORMULA Champagne-PT-H07T1U-CTLFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2025-06-07 19:31:54] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:31:54] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:31:54] [INFO ] Applying decomposition
[2025-06-07 19:31:54] [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/graph3276475595820968772.txt' '-o' '/tmp/graph3276475595820968772.bin' '-w' '/tmp/graph3276475595820968772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3276475595820968772.bin' '-l' '-1' '-v' '-w' '/tmp/graph3276475595820968772.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:31:54] [INFO ] Decomposing Gal with order
[2025-06-07 19:31:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:31:54] [INFO ] Removed a total of 497 redundant transitions.
[2025-06-07 19:31:54] [INFO ] Flatten gal took : 22 ms
[2025-06-07 19:31:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2025-06-07 19:31:54] [INFO ] Time to serialize gal into /tmp/CTLFireability5068296176870134543.gal : 4 ms
[2025-06-07 19:31:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7784736799460321605.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/CTLFireability5068296176870134543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7784736799460321605.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.21752e+32,0.621319,22452,3978,33,35127,832,1090,58007,84,1982,0
Converting to forward existential form...Done !
original formula: !(A(E((EG(!(((i19.u116.p467==1)&&(i25.i1.u143.p584==1)))) + EX((i25.i0.u145.p593!=1))) U (((AF(((i14.i1.u86.p338==1)&&(i18.i0.u108.p431==...315
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,!(!((E(TRUE U (i3.i0.u26.p83==1)) + ((i21.i0.u124.p501==1) * !(EG(!((i1.u12.p40==1))))))))) ...945
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t71, t88, t162, t274, t329, t362, i0.i1.t474, i0.i1.t479, i1.t459, i1.u11.t456, i2.t...875
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
[2025-06-07 19:58:18] [INFO ] Applying decomposition
[2025-06-07 19:58:18] [INFO ] Flatten gal took : 17 ms
[2025-06-07 19:58:18] [INFO ] Decomposing Gal with order
[2025-06-07 19:58:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:58:18] [INFO ] Removed a total of 307 redundant transitions.
[2025-06-07 19:58:18] [INFO ] Flatten gal took : 16 ms
[2025-06-07 19:58:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 25 ms.
[2025-06-07 19:58:18] [INFO ] Time to serialize gal into /tmp/CTLFireability8572829959006474727.gal : 2 ms
[2025-06-07 19:58:18] [INFO ] Time to serialize properties into /tmp/CTLFireability12348784613496647965.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/CTLFireability8572829959006474727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12348784613496647965.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.21752e+32,0.174133,10764,713,453,10654,3079,601,25068,317,14821,0
Converting to forward existential form...Done !
original formula: !(A(E((EG(!(((i1.i1.i1.i0.i0.i0.u37.p467==1)&&(i1.i1.i1.i1.i0.u45.p584==1)))) + EX((i1.i1.i1.i1.i0.u45.p593!=1))) U (((AF(((i1.i1.i0.i0.i...402
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,!(!((E(TRUE U (i0.i0.i0.i0.u10.p83==1)) + ((i1.i1.i1.i0.u39.p501==1) * !(EG(!((i0.i0.i0.i0.i...1167
Reverse transition relation is NOT exact ! Due to transitions i0.t362, i0.u13.t368, i0.i0.u12.t390, i0.i0.i0.u11.t406, i0.i0.i0.i0.u10.t421, i0.i0.i0.i0.u1...1534
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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="Champagne-PT-H07T1U"
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 Champagne-PT-H07T1U, 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 r254-tall-174931339200082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H07T1U.tgz
mv Champagne-PT-H07T1U 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 ;