About the Execution of ITS-Tools for CloudDeployment-PT-5b
| 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 | ?F??TFFFTFT?F?F? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027700058.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 CloudDeployment-PT-5b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854027700058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.5M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2023-12
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2023-13
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2023-14
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2023-15
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2025-00
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2025-01
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2025-02
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2025-03
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2025-04
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2025-05
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2025-06
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2025-07
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2025-08
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2025-09
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2025-10
FORMULA_NAME CloudDeployment-PT-5b-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748557912762
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-5b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-29 22:31:53] [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-05-29 22:31:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 22:31:54] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2025-05-29 22:31:54] [INFO ] Transformed 1525 places.
[2025-05-29 22:31:54] [INFO ] Transformed 3132 transitions.
[2025-05-29 22:31:54] [INFO ] Found NUPN structural information;
[2025-05-29 22:31:54] [INFO ] Parsed PT model containing 1525 places and 3132 transitions and 24760 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 91 out of 1525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1525/1525 places, 3132/3132 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1520 transition count 3132
Discarding 393 places :
Symmetric choice reduction at 1 with 393 rule applications. Total rules 398 place count 1127 transition count 2739
Iterating global reduction 1 with 393 rules applied. Total rules applied 791 place count 1127 transition count 2739
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 938 place count 980 transition count 2592
Iterating global reduction 1 with 147 rules applied. Total rules applied 1085 place count 980 transition count 2592
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1103 place count 980 transition count 2574
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1116 place count 967 transition count 2561
Iterating global reduction 2 with 13 rules applied. Total rules applied 1129 place count 967 transition count 2561
Applied a total of 1129 rules in 347 ms. Remains 967 /1525 variables (removed 558) and now considering 2561/3132 (removed 571) transitions.
// Phase 1: matrix 2561 rows 967 cols
[2025-05-29 22:31:54] [INFO ] Computed 16 invariants in 67 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:31:55] [INFO ] Implicit Places using invariants in 452 ms returned []
[2025-05-29 22:31:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:31:56] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
Running 2560 sub problems to find dead transitions.
[2025-05-29 22:31:56] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/966 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 966/3528 variables, and 16 constraints, problems are : Problem set: 0 solved, 2560 unsolved in 30082 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/967 constraints, PredecessorRefiner: 2560/1235 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2560 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/966 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 966/3528 variables, and 16 constraints, problems are : Problem set: 0 solved, 2560 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/967 constraints, PredecessorRefiner: 1325/1235 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63737ms problems are : Problem set: 0 solved, 2560 unsolved
Search for dead transitions found 0 dead transitions in 63773ms
Starting structural reductions in LTL mode, iteration 1 : 967/1525 places, 2561/3132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65927 ms. Remains : 967/1525 places, 2561/3132 transitions.
Support contains 91 out of 967 places after structural reductions.
[2025-05-29 22:33:01] [INFO ] Flatten gal took : 415 ms
[2025-05-29 22:33:01] [INFO ] Flatten gal took : 266 ms
[2025-05-29 22:33:01] [INFO ] Input system was already deterministic with 2561 transitions.
RANDOM walk for 40000 steps (248 resets) in 1675 ms. (23 steps per ms) remains 46/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
[2025-05-29 22:33:02] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 181/244 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1760/2004 variables, 244/260 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2004 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 6 (OVERLAPS) 543/2547 variables, 224/484 constraints. Problems are: Problem set: 23 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2547 variables, 0/484 constraints. Problems are: Problem set: 23 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 472/3019 variables, 217/701 constraints. Problems are: Problem set: 23 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3019 variables, 0/701 constraints. Problems are: Problem set: 23 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 354/3373 variables, 175/876 constraints. Problems are: Problem set: 23 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3373/3528 variables, and 876 constraints, problems are : Problem set: 23 solved, 23 unsolved in 5019 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 860/967 constraints, PredecessorRefiner: 46/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 23 solved, 23 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 23 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 23 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 182/239 variables, 15/16 constraints. Problems are: Problem set: 23 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/16 constraints. Problems are: Problem set: 23 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 1751/1990 variables, 239/255 constraints. Problems are: Problem set: 23 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1990 variables, 1/256 constraints. Problems are: Problem set: 23 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1990 variables, 0/256 constraints. Problems are: Problem set: 23 solved, 23 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 7 (OVERLAPS) 526/2516 variables, 218/474 constraints. Problems are: Problem set: 29 solved, 17 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/2516 variables, 11/485 constraints. Problems are: Problem set: 30 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2516 variables, 0/485 constraints. Problems are: Problem set: 30 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 461/2977 variables, 210/695 constraints. Problems are: Problem set: 30 solved, 16 unsolved
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 2977/3528 variables, and 695 constraints, problems are : Problem set: 30 solved, 16 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 667/967 constraints, PredecessorRefiner: 23/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10187ms problems are : Problem set: 30 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 51 out of 967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 2561/2561 transitions.
Graph (trivial) has 936 edges and 967 vertex of which 295 / 967 are part of one of the 32 SCC in 6 ms
Free SCC test removed 263 places
Drop transitions (Empty/Sink Transition effects.) removed 334 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 335 transitions.
Graph (complete) has 2535 edges and 704 vertex of which 703 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 272 rules applied. Total rules applied 274 place count 703 transition count 1954
Reduce places removed 267 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 279 rules applied. Total rules applied 553 place count 436 transition count 1942
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 562 place count 427 transition count 1942
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 562 place count 427 transition count 1878
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 690 place count 363 transition count 1878
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 694 place count 359 transition count 1874
Iterating global reduction 3 with 4 rules applied. Total rules applied 698 place count 359 transition count 1874
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 699 place count 359 transition count 1873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 699 place count 359 transition count 1872
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 701 place count 358 transition count 1872
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 889 place count 264 transition count 1778
Performed 38 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 965 place count 226 transition count 1985
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 996 place count 226 transition count 1954
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 998 place count 225 transition count 1971
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1001 place count 225 transition count 1968
Drop transitions (Redundant composition of simpler transitions.) removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 6 with 64 rules applied. Total rules applied 1065 place count 225 transition count 1904
Free-agglomeration rule applied 34 times with reduction of 2 identical transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1099 place count 225 transition count 1868
Reduce places removed 34 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 6 with 105 rules applied. Total rules applied 1204 place count 191 transition count 1797
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1208 place count 187 transition count 1771
Iterating global reduction 7 with 4 rules applied. Total rules applied 1212 place count 187 transition count 1771
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 7 with 24 rules applied. Total rules applied 1236 place count 187 transition count 1747
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1239 place count 187 transition count 1747
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1242 place count 187 transition count 1744
Applied a total of 1242 rules in 400 ms. Remains 187 /967 variables (removed 780) and now considering 1744/2561 (removed 817) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 187/967 places, 1744/2561 transitions.
RANDOM walk for 40000 steps (790 resets) in 1712 ms. (23 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40003 steps (57 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (56 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (60 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (46 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (50 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (55 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (55 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (61 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (49 resets) in 36 ms. (1081 steps per ms) remains 10/10 properties
[2025-05-29 22:33:13] [INFO ] Flow matrix only has 1553 transitions (discarded 191 similar events)
// Phase 1: matrix 1553 rows 187 cols
[2025-05-29 22:33:14] [INFO ] Computed 21 invariants in 18 ms
[2025-05-29 22:33:14] [INFO ] State equation strengthened by 176 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 147/186 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1553/1739 variables, 186/207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1739 variables, 176/383 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1739 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/1740 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1740 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/1740 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1740/1740 variables, and 384 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2140 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 187/187 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 10/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 147/186 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1553/1739 variables, 186/207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1739 variables, 176/383 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1739 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1739 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/1740 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1740 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/1740 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1740/1740 variables, and 390 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3237 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 187/187 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 10/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5436ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 6 properties in 1046 ms.
Support contains 23 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 1744/1744 transitions.
Graph (trivial) has 96 edges and 187 vertex of which 16 / 187 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 179 transition count 1726
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 177 transition count 1726
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 177 transition count 1724
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 175 transition count 1724
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 170 transition count 1719
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 167 transition count 1732
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 33 place count 167 transition count 1724
Drop transitions (Redundant composition of simpler transitions.) removed 119 transitions
Redundant transition composition rules discarded 119 transitions
Iterating global reduction 3 with 119 rules applied. Total rules applied 152 place count 167 transition count 1605
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 166 transition count 1599
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 166 transition count 1599
Free-agglomeration rule applied 19 times with reduction of 4 identical transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 173 place count 166 transition count 1576
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 3 with 87 rules applied. Total rules applied 260 place count 147 transition count 1508
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 290 place count 147 transition count 1478
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 291 place count 147 transition count 1478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 292 place count 146 transition count 1477
Applied a total of 292 rules in 202 ms. Remains 146 /187 variables (removed 41) and now considering 1477/1744 (removed 267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 146/187 places, 1477/1744 transitions.
RANDOM walk for 40000 steps (1468 resets) in 1035 ms. (38 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (154 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (147 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (143 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (143 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 448273 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 4
Probabilistic random walk after 448273 steps, saw 78221 distinct states, run finished after 3006 ms. (steps per millisecond=149 ) properties seen :0
[2025-05-29 22:33:24] [INFO ] Flow matrix only has 1289 transitions (discarded 188 similar events)
// Phase 1: matrix 1289 rows 146 cols
[2025-05-29 22:33:24] [INFO ] Computed 21 invariants in 17 ms
[2025-05-29 22:33:24] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 123/146 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1289/1435 variables, 146/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1435 variables, 12/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1435 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1435 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1435/1435 variables, and 179 constraints, problems are : Problem set: 0 solved, 4 unsolved in 536 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 123/146 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1289/1435 variables, 146/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1435 variables, 12/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1435 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1435 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1435 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1435/1435 variables, and 182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 818 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1392ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 89 ms.
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1477/1477 transitions.
Graph (trivial) has 67 edges and 146 vertex of which 4 / 146 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 1028 transitions
Reduce isomorphic transitions removed 1028 transitions.
Graph (complete) has 1091 edges and 144 vertex of which 120 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 120 transition count 437
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 119 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 119 transition count 436
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 113 transition count 430
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 429
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 111 transition count 443
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 41 place count 111 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 58 place count 111 transition count 418
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 111 transition count 416
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 71 place count 109 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 86 place count 109 transition count 392
Applied a total of 86 rules in 34 ms. Remains 109 /146 variables (removed 37) and now considering 392/1477 (removed 1085) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 109/146 places, 392/1477 transitions.
RANDOM walk for 40000 steps (619 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (86 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1469062 steps, run timeout after 3001 ms. (steps per millisecond=489 ) properties seen :0 out of 1
Probabilistic random walk after 1469062 steps, saw 207092 distinct states, run finished after 3002 ms. (steps per millisecond=489 ) properties seen :0
[2025-05-29 22:33:28] [INFO ] Flow matrix only has 197 transitions (discarded 195 similar events)
// Phase 1: matrix 197 rows 109 cols
[2025-05-29 22:33:28] [INFO ] Computed 20 invariants in 5 ms
[2025-05-29 22:33:28] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/53 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 111/164 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/173 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 71/244 variables, 27/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/278 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/278 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 28/306 variables, 33/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/306 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/306 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 109/109 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/53 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 111/164 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/173 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 71/244 variables, 27/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:33:30] [INFO ] Deduced a trap composed of 3 places in 2094 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/278 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/278 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/278 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 28/306 variables, 33/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/306 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2261 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 109/109 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2378ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 392/392 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 392/392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 109/109 places, 392/392 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 392/392 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 392/392 (removed 0) transitions.
[2025-05-29 22:33:31] [INFO ] Flow matrix only has 197 transitions (discarded 195 similar events)
[2025-05-29 22:33:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:33:31] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-05-29 22:33:31] [INFO ] Flow matrix only has 197 transitions (discarded 195 similar events)
[2025-05-29 22:33:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:33:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-29 22:33:31] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:33:31] [INFO ] Redundant transitions in 32 ms returned []
Running 367 sub problems to find dead transitions.
[2025-05-29 22:33:31] [INFO ] Flow matrix only has 197 transitions (discarded 195 similar events)
[2025-05-29 22:33:31] [INFO ] Invariant cache hit.
[2025-05-29 22:33:31] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 5/109 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 197/306 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 136 constraints, problems are : Problem set: 0 solved, 367 unsolved in 14096 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 109/109 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 5/109 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 197/306 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 367/503 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 503 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 109/109 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44378ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 44379ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44738 ms. Remains : 109/109 places, 392/392 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 107 edges and 109 vertex of which 40 / 109 are part of one of the 6 SCC in 0 ms
Free SCC test removed 34 places
Drop transitions (Empty/Sink Transition effects.) removed 52 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 247 transitions.
Ensure Unique test removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 66 transition count 134
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 32 place count 55 transition count 134
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 32 place count 55 transition count 126
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 47 transition count 126
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 43 transition count 122
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 43 transition count 122
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 39 transition count 102
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 39 transition count 102
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 92 place count 39 transition count 74
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 104 place count 33 transition count 68
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 114 place count 33 transition count 58
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
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 124 place count 28 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 154 place count 28 transition count 48
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 155 place count 28 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 156 place count 27 transition count 47
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 168 place count 19 transition count 43
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 192 place count 19 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 19 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 194 place count 18 transition count 18
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 199 place count 18 transition count 18
Applied a total of 199 rules in 19 ms. Remains 18 /109 variables (removed 91) and now considering 18/392 (removed 374) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 18 cols
[2025-05-29 22:34:15] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 22:34:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-29 22:34:15] [INFO ] [Real]Absence check using 1 positive and 6 generalized place invariants in 6 ms returned sat
[2025-05-29 22:34:15] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 22:34:15] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-29 22:34:15] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 87 ms.
Successfully simplified 30 atomic propositions for a total of 16 simplifications.
FORMULA CloudDeployment-PT-5b-CTLFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-CTLFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 22:34:16] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-05-29 22:34:16] [INFO ] Flatten gal took : 199 ms
[2025-05-29 22:34:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CloudDeployment-PT-5b-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-CTLFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-CTLFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 22:34:16] [INFO ] Flatten gal took : 218 ms
[2025-05-29 22:34:16] [INFO ] Input system was already deterministic with 2561 transitions.
Support contains 64 out of 967 places (down from 82) after GAL structural reductions.
Computed a total of 152 stabilizing places and 1504 stable transitions
Graph (complete) has 2943 edges and 967 vertex of which 939 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.23 ms
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 2561/2561 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 966 transition count 2561
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 936 transition count 1518
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 936 transition count 1518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 936 transition count 1516
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 69 place count 930 transition count 1510
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 930 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 929 transition count 1509
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 929 transition count 1509
Applied a total of 77 rules in 114 ms. Remains 929 /967 variables (removed 38) and now considering 1509/2561 (removed 1052) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2025-05-29 22:34:16] [INFO ] Computed 15 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:34:16] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-05-29 22:34:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:34:18] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
[2025-05-29 22:34:18] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1242 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/967 places, 1509/2561 transitions.
Applied a total of 0 rules in 24 ms. Remains 928 /928 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1381 ms. Remains : 928/967 places, 1509/2561 transitions.
[2025-05-29 22:34:18] [INFO ] Flatten gal took : 41 ms
[2025-05-29 22:34:18] [INFO ] Flatten gal took : 43 ms
[2025-05-29 22:34:18] [INFO ] Input system was already deterministic with 1509 transitions.
[2025-05-29 22:34:18] [INFO ] Flatten gal took : 43 ms
[2025-05-29 22:34:18] [INFO ] Flatten gal took : 43 ms
[2025-05-29 22:34:18] [INFO ] Time to serialize gal into /tmp/CTLFireability4355533991240847436.gal : 29 ms
[2025-05-29 22:34:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10684249592512382869.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4355533991240847436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10684249592512382869.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-05-29 22:34:48] [INFO ] Flatten gal took : 46 ms
[2025-05-29 22:34:48] [INFO ] Applying decomposition
[2025-05-29 22:34:48] [INFO ] Flatten gal took : 43 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/graph6764291057754202436.txt' '-o' '/tmp/graph6764291057754202436.bin' '-w' '/tmp/graph6764291057754202436.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6764291057754202436.bin' '-l' '-1' '-v' '-w' '/tmp/graph6764291057754202436.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:34:48] [INFO ] Decomposing Gal with order
[2025-05-29 22:34:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:34:49] [INFO ] Removed a total of 1702 redundant transitions.
[2025-05-29 22:34:49] [INFO ] Flatten gal took : 150 ms
[2025-05-29 22:34:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 96 ms.
[2025-05-29 22:34:49] [INFO ] Time to serialize gal into /tmp/CTLFireability14405688199955881999.gal : 23 ms
[2025-05-29 22:34:49] [INFO ] Time to serialize properties into /tmp/CTLFireability653181031206025147.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/CTLFireability14405688199955881999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability653181031206025147.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,2.48839e+23,6.03962,165632,6511,777,312232,11793,2026,629396,220,37062,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 2561/2561 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 948 transition count 2542
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 948 transition count 2542
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 948 transition count 2540
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 942 transition count 2534
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 942 transition count 2534
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 941 transition count 2533
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 941 transition count 2533
Applied a total of 54 rules in 102 ms. Remains 941 /967 variables (removed 26) and now considering 2533/2561 (removed 28) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2025-05-29 22:35:19] [INFO ] Computed 16 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:35:20] [INFO ] Implicit Places using invariants in 579 ms returned []
[2025-05-29 22:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:35:22] [INFO ] Implicit Places using invariants and state equation in 2531 ms returned []
Implicit Place search using SMT with State Equation took 3112 ms to find 0 implicit places.
Running 2532 sub problems to find dead transitions.
[2025-05-29 22:35:22] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 2532/1207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2532 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30046 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 1325/1207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63467ms problems are : Problem set: 0 solved, 2532 unsolved
Search for dead transitions found 0 dead transitions in 63476ms
Starting structural reductions in LTL mode, iteration 1 : 941/967 places, 2533/2561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66706 ms. Remains : 941/967 places, 2533/2561 transitions.
[2025-05-29 22:36:26] [INFO ] Flatten gal took : 185 ms
[2025-05-29 22:36:26] [INFO ] Flatten gal took : 193 ms
[2025-05-29 22:36:26] [INFO ] Input system was already deterministic with 2533 transitions.
[2025-05-29 22:36:27] [INFO ] Flatten gal took : 189 ms
[2025-05-29 22:36:27] [INFO ] Flatten gal took : 190 ms
[2025-05-29 22:36:27] [INFO ] Time to serialize gal into /tmp/CTLFireability2090483761108758137.gal : 31 ms
[2025-05-29 22:36:27] [INFO ] Time to serialize properties into /tmp/CTLFireability8769884775952938396.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/CTLFireability2090483761108758137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8769884775952938396.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-05-29 22:36:57] [INFO ] Flatten gal took : 179 ms
[2025-05-29 22:36:57] [INFO ] Applying decomposition
[2025-05-29 22:36:57] [INFO ] Flatten gal took : 180 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/graph12916358144864624968.txt' '-o' '/tmp/graph12916358144864624968.bin' '-w' '/tmp/graph12916358144864624968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12916358144864624968.bin' '-l' '-1' '-v' '-w' '/tmp/graph12916358144864624968.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:36:58] [INFO ] Decomposing Gal with order
[2025-05-29 22:36:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:36:58] [INFO ] Removed a total of 11548 redundant transitions.
[2025-05-29 22:36:58] [INFO ] Flatten gal took : 573 ms
[2025-05-29 22:36:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2130 labels/synchronizations in 173 ms.
[2025-05-29 22:36:59] [INFO ] Time to serialize gal into /tmp/CTLFireability14768617129426636210.gal : 29 ms
[2025-05-29 22:36:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5345506033873967396.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/CTLFireability14768617129426636210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5345506033873967396.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 967/967 places, 2561/2561 transitions.
Graph (trivial) has 986 edges and 967 vertex of which 349 / 967 are part of one of the 38 SCC in 2 ms
Free SCC test removed 311 places
Ensure Unique test removed 355 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 2530 edges and 656 vertex of which 628 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 266 place count 628 transition count 917
Reduce places removed 264 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 267 rules applied. Total rules applied 533 place count 364 transition count 914
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 535 place count 362 transition count 914
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 535 place count 362 transition count 865
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 633 place count 313 transition count 865
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 641 place count 305 transition count 857
Iterating global reduction 3 with 8 rules applied. Total rules applied 649 place count 305 transition count 857
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 651 place count 305 transition count 855
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 651 place count 305 transition count 853
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 655 place count 303 transition count 853
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 825 place count 218 transition count 768
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 845 place count 218 transition count 748
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 10 rules applied. Total rules applied 855 place count 218 transition count 738
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 865 place count 208 transition count 738
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 875 place count 203 transition count 733
Applied a total of 875 rules in 113 ms. Remains 203 /967 variables (removed 764) and now considering 733/2561 (removed 1828) transitions.
[2025-05-29 22:37:29] [INFO ] Flow matrix only has 601 transitions (discarded 132 similar events)
// Phase 1: matrix 601 rows 203 cols
[2025-05-29 22:37:29] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:29] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-29 22:37:29] [INFO ] Flow matrix only has 601 transitions (discarded 132 similar events)
[2025-05-29 22:37:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:29] [INFO ] State equation strengthened by 194 read => feed constraints.
[2025-05-29 22:37:30] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:37:30] [INFO ] Redundant transitions in 450 ms returned []
Running 732 sub problems to find dead transitions.
[2025-05-29 22:37:30] [INFO ] Flow matrix only has 601 transitions (discarded 132 similar events)
[2025-05-29 22:37:30] [INFO ] Invariant cache hit.
[2025-05-29 22:37:30] [INFO ] State equation strengthened by 194 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (OVERLAPS) 600/802 variables, 202/207 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/802 variables, 193/400 constraints. Problems are: Problem set: 0 solved, 732 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 802/804 variables, and 400 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 202/203 constraints, ReadFeed: 193/194 constraints, PredecessorRefiner: 732/431 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 732 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (OVERLAPS) 600/802 variables, 202/207 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/802 variables, 193/400 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/802 variables, 431/831 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/804 variables, and 831 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 202/203 constraints, ReadFeed: 193/194 constraints, PredecessorRefiner: 732/431 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60794ms problems are : Problem set: 0 solved, 732 unsolved
Search for dead transitions found 0 dead transitions in 60796ms
Starting structural reductions in SI_CTL mode, iteration 1 : 203/967 places, 733/2561 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61964 ms. Remains : 203/967 places, 733/2561 transitions.
[2025-05-29 22:38:31] [INFO ] Flatten gal took : 25 ms
[2025-05-29 22:38:31] [INFO ] Flatten gal took : 21 ms
[2025-05-29 22:38:31] [INFO ] Input system was already deterministic with 733 transitions.
[2025-05-29 22:38:31] [INFO ] Flatten gal took : 21 ms
[2025-05-29 22:38:31] [INFO ] Flatten gal took : 21 ms
[2025-05-29 22:38:31] [INFO ] Time to serialize gal into /tmp/CTLFireability11453317730752528345.gal : 5 ms
[2025-05-29 22:38:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2253528526956805503.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/CTLFireability11453317730752528345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2253528526956805503.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.26725e+15,10.5084,219156,2,30453,5,968906,6,0,1489,849525,0
Converting to forward existential form...Done !
original formula: EG(((((p919==0)||(p957==0))||((p1066==0)||(p1503==0)))||(p1521==0)))
=> equivalent forward existential formula: [FwdG(Init,((((p919==0)||(p957==0))||((p1066==0)||(p1503==0)))||(p1521==0)))] != FALSE
Hit Full ! (commute/partial/dont) 390/0/343
Detected timeout of ITS tools.
[2025-05-29 22:39:01] [INFO ] Flatten gal took : 25 ms
[2025-05-29 22:39:01] [INFO ] Applying decomposition
[2025-05-29 22:39:01] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6239330864232817037.txt' '-o' '/tmp/graph6239330864232817037.bin' '-w' '/tmp/graph6239330864232817037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6239330864232817037.bin' '-l' '-1' '-v' '-w' '/tmp/graph6239330864232817037.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:39:01] [INFO ] Decomposing Gal with order
[2025-05-29 22:39:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:39:01] [INFO ] Removed a total of 1574 redundant transitions.
[2025-05-29 22:39:01] [INFO ] Flatten gal took : 39 ms
[2025-05-29 22:39:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 6 ms.
[2025-05-29 22:39:01] [INFO ] Time to serialize gal into /tmp/CTLFireability5650906282725764016.gal : 2 ms
[2025-05-29 22:39:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14476477511727333585.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/CTLFireability5650906282725764016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14476477511727333585.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,9.26725e+15,0.076282,6600,354,79,3175,689,670,3872,116,1534,0
Converting to forward existential form...Done !
original formula: EG(((((i4.u32.p919==0)||(i4.u33.p957==0))||((i4.u35.p1066==0)||(u63.p1503==0)))||(u63.p1521==0)))
=> equivalent forward existential formula: [FwdG(Init,((((i4.u32.p919==0)||(i4.u33.p957==0))||((i4.u35.p1066==0)||(u63.p1503==0)))||(u63.p1521==0)))] != FA...158
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
(forward)formula 0,1,0.629023,35272,1,0,62770,2990,2919,172465,486,22129,66327
FORMULA CloudDeployment-PT-5b-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 2561/2561 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 948 transition count 2542
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 948 transition count 2542
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 948 transition count 2540
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 943 transition count 2535
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 943 transition count 2535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 942 transition count 2534
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 942 transition count 2534
Applied a total of 52 rules in 99 ms. Remains 942 /967 variables (removed 25) and now considering 2534/2561 (removed 27) transitions.
// Phase 1: matrix 2534 rows 942 cols
[2025-05-29 22:39:02] [INFO ] Computed 16 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:39:02] [INFO ] Implicit Places using invariants in 522 ms returned []
[2025-05-29 22:39:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:39:05] [INFO ] Implicit Places using invariants and state equation in 2572 ms returned []
Implicit Place search using SMT with State Equation took 3096 ms to find 0 implicit places.
Running 2533 sub problems to find dead transitions.
[2025-05-29 22:39:05] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/941 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 941/3476 variables, and 16 constraints, problems are : Problem set: 0 solved, 2533 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/942 constraints, PredecessorRefiner: 2533/1208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/941 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2533 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 941/3476 variables, and 16 constraints, problems are : Problem set: 0 solved, 2533 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/942 constraints, PredecessorRefiner: 1325/1208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63392ms problems are : Problem set: 0 solved, 2533 unsolved
Search for dead transitions found 0 dead transitions in 63402ms
Starting structural reductions in LTL mode, iteration 1 : 942/967 places, 2534/2561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66626 ms. Remains : 942/967 places, 2534/2561 transitions.
[2025-05-29 22:40:09] [INFO ] Flatten gal took : 173 ms
[2025-05-29 22:40:09] [INFO ] Flatten gal took : 182 ms
[2025-05-29 22:40:09] [INFO ] Input system was already deterministic with 2534 transitions.
[2025-05-29 22:40:09] [INFO ] Flatten gal took : 179 ms
[2025-05-29 22:40:09] [INFO ] Flatten gal took : 180 ms
[2025-05-29 22:40:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8238277990551172258.gal : 26 ms
[2025-05-29 22:40:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6215396940002961022.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/CTLFireability8238277990551172258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6215396940002961022.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-05-29 22:40:40] [INFO ] Flatten gal took : 177 ms
[2025-05-29 22:40:40] [INFO ] Applying decomposition
[2025-05-29 22:40:40] [INFO ] Flatten gal took : 177 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/graph17194403635032455445.txt' '-o' '/tmp/graph17194403635032455445.bin' '-w' '/tmp/graph17194403635032455445.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17194403635032455445.bin' '-l' '-1' '-v' '-w' '/tmp/graph17194403635032455445.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:40:40] [INFO ] Decomposing Gal with order
[2025-05-29 22:40:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:40:41] [INFO ] Removed a total of 11538 redundant transitions.
[2025-05-29 22:40:41] [INFO ] Flatten gal took : 450 ms
[2025-05-29 22:40:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2115 labels/synchronizations in 252 ms.
[2025-05-29 22:40:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2197191285016638139.gal : 24 ms
[2025-05-29 22:40:41] [INFO ] Time to serialize properties into /tmp/CTLFireability10232868421780169682.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/CTLFireability2197191285016638139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10232868421780169682.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 2561/2561 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 966 transition count 2561
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 940 transition count 1522
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 940 transition count 1522
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 940 transition count 1520
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 935 transition count 1515
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 935 transition count 1515
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 934 transition count 1514
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 934 transition count 1514
Applied a total of 67 rules in 102 ms. Remains 934 /967 variables (removed 33) and now considering 1514/2561 (removed 1047) transitions.
// Phase 1: matrix 1514 rows 934 cols
[2025-05-29 22:41:11] [INFO ] Computed 15 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:41:12] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-29 22:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:41:13] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned [11, 19, 186, 194, 359, 369, 535, 543, 709, 717]
[2025-05-29 22:41:13] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1313 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 933/967 places, 1514/2561 transitions.
Applied a total of 0 rules in 25 ms. Remains 933 /933 variables (removed 0) and now considering 1514/1514 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1440 ms. Remains : 933/967 places, 1514/2561 transitions.
[2025-05-29 22:41:13] [INFO ] Flatten gal took : 35 ms
[2025-05-29 22:41:13] [INFO ] Flatten gal took : 37 ms
[2025-05-29 22:41:13] [INFO ] Input system was already deterministic with 1514 transitions.
[2025-05-29 22:41:13] [INFO ] Flatten gal took : 37 ms
[2025-05-29 22:41:13] [INFO ] Flatten gal took : 36 ms
[2025-05-29 22:41:13] [INFO ] Time to serialize gal into /tmp/CTLFireability1986145989614911346.gal : 6 ms
[2025-05-29 22:41:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17823424731257252480.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/CTLFireability1986145989614911346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17823424731257252480.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-05-29 22:41:43] [INFO ] Flatten gal took : 37 ms
[2025-05-29 22:41:43] [INFO ] Applying decomposition
[2025-05-29 22:41:43] [INFO ] Flatten gal took : 37 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/graph9309812224129207812.txt' '-o' '/tmp/graph9309812224129207812.bin' '-w' '/tmp/graph9309812224129207812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9309812224129207812.bin' '-l' '-1' '-v' '-w' '/tmp/graph9309812224129207812.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:41:43] [INFO ] Decomposing Gal with order
[2025-05-29 22:41:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:41:43] [INFO ] Removed a total of 1801 redundant transitions.
[2025-05-29 22:41:43] [INFO ] Flatten gal took : 55 ms
[2025-05-29 22:41:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 10 ms.
[2025-05-29 22:41:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13664836458976388175.gal : 8 ms
[2025-05-29 22:41:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5218373185015456107.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/CTLFireability13664836458976388175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5218373185015456107.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,2.99832e+23,9.81882,267256,10265,248,556187,3573,1938,887615,165,12140,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 967/967 places, 2561/2561 transitions.
Graph (trivial) has 978 edges and 967 vertex of which 362 / 967 are part of one of the 40 SCC in 1 ms
Free SCC test removed 322 places
Ensure Unique test removed 367 transitions
Reduce isomorphic transitions removed 367 transitions.
Graph (complete) has 2511 edges and 645 vertex of which 644 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 260 rules applied. Total rules applied 262 place count 643 transition count 1932
Reduce places removed 260 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 262 rules applied. Total rules applied 524 place count 383 transition count 1930
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 526 place count 381 transition count 1930
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 526 place count 381 transition count 1882
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 622 place count 333 transition count 1882
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 627 place count 328 transition count 1877
Iterating global reduction 3 with 5 rules applied. Total rules applied 632 place count 328 transition count 1877
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 633 place count 328 transition count 1876
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 633 place count 328 transition count 1875
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 635 place count 327 transition count 1875
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 805 place count 242 transition count 1790
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 825 place count 242 transition count 1770
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 10 rules applied. Total rules applied 835 place count 242 transition count 1760
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 845 place count 232 transition count 1760
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 855 place count 227 transition count 1755
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 856 place count 226 transition count 1754
Applied a total of 856 rules in 194 ms. Remains 226 /967 variables (removed 741) and now considering 1754/2561 (removed 807) transitions.
[2025-05-29 22:42:14] [INFO ] Flow matrix only has 1615 transitions (discarded 139 similar events)
// Phase 1: matrix 1615 rows 226 cols
[2025-05-29 22:42:14] [INFO ] Computed 16 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:42:14] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-05-29 22:42:14] [INFO ] Flow matrix only has 1615 transitions (discarded 139 similar events)
[2025-05-29 22:42:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:42:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 22:42:14] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:42:15] [INFO ] Redundant transitions in 436 ms returned []
Running 1713 sub problems to find dead transitions.
[2025-05-29 22:42:15] [INFO ] Flow matrix only has 1615 transitions (discarded 139 similar events)
[2025-05-29 22:42:15] [INFO ] Invariant cache hit.
[2025-05-29 22:42:15] [INFO ] State equation strengthened by 25 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1713 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1713 unsolved
At refinement iteration 2 (OVERLAPS) 5/226 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1713 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 226/1841 variables, and 16 constraints, problems are : Problem set: 0 solved, 1713 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/226 constraints, ReadFeed: 0/25 constraints, PredecessorRefiner: 1713/388 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1713 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1713 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1713 unsolved
At refinement iteration 2 (OVERLAPS) 5/226 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1713 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/1841 variables, and 16 constraints, problems are : Problem set: 0 solved, 1713 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/226 constraints, ReadFeed: 0/25 constraints, PredecessorRefiner: 1325/388 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62945ms problems are : Problem set: 0 solved, 1713 unsolved
Search for dead transitions found 0 dead transitions in 62951ms
Starting structural reductions in SI_CTL mode, iteration 1 : 226/967 places, 1754/2561 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64538 ms. Remains : 226/967 places, 1754/2561 transitions.
[2025-05-29 22:43:18] [INFO ] Flatten gal took : 169 ms
[2025-05-29 22:43:18] [INFO ] Flatten gal took : 176 ms
[2025-05-29 22:43:18] [INFO ] Input system was already deterministic with 1754 transitions.
[2025-05-29 22:43:19] [INFO ] Flatten gal took : 171 ms
[2025-05-29 22:43:19] [INFO ] Flatten gal took : 167 ms
[2025-05-29 22:43:19] [INFO ] Time to serialize gal into /tmp/CTLFireability4718828277455550215.gal : 25 ms
[2025-05-29 22:43:19] [INFO ] Time to serialize properties into /tmp/CTLFireability18386582378591611102.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/CTLFireability4718828277455550215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18386582378591611102.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-05-29 22:43:49] [INFO ] Flatten gal took : 165 ms
[2025-05-29 22:43:49] [INFO ] Applying decomposition
[2025-05-29 22:43:49] [INFO ] Flatten gal took : 166 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/graph10364249931795070404.txt' '-o' '/tmp/graph10364249931795070404.bin' '-w' '/tmp/graph10364249931795070404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10364249931795070404.bin' '-l' '-1' '-v' '-w' '/tmp/graph10364249931795070404.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:43:49] [INFO ] Decomposing Gal with order
[2025-05-29 22:43:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:43:50] [INFO ] Removed a total of 16641 redundant transitions.
[2025-05-29 22:43:50] [INFO ] Flatten gal took : 256 ms
[2025-05-29 22:43:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 95 ms.
[2025-05-29 22:43:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7072286883912983927.gal : 12 ms
[2025-05-29 22:43:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4219015401266244592.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/CTLFireability7072286883912983927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4219015401266244592.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.01229e+15,0.284958,16120,379,78,3275,580,1779,4654,121,1471,0
Converting to forward existential form...Done !
original formula: EF((AF(((i2.u11.p339==1)&&(i5.u44.p1209==1))) + (AF((i2.u21.p572==1)) * (((i5.u44.p1198==1)||((((((i2.u14.p12==1)&&(i0.u1.p58==1))&&((i0....848
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!(((i2.u11.p339==1)&&(i5.u44.p1209==1))))))] != FALSE + [((FwdU(Init,TRUE) * (((i5.u44...943
Reverse transition relation is NOT exact ! Due to transitions t317, t1297, t1317, i0.t1298, i0.t1231, i0.t98, i0.u2.t1225, i0.u6.t1227, i0.u6.t1299, i0.u6....611
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 967/967 places, 2561/2561 transitions.
Graph (trivial) has 974 edges and 967 vertex of which 358 / 967 are part of one of the 40 SCC in 3 ms
Free SCC test removed 318 places
Ensure Unique test removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Graph (complete) has 2516 edges and 649 vertex of which 648 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 256 transitions
Trivial Post-agglo rules discarded 256 transitions
Performed 256 trivial Post agglomeration. Transition count delta: 256
Iterating post reduction 0 with 256 rules applied. Total rules applied 258 place count 647 transition count 1941
Reduce places removed 256 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 258 rules applied. Total rules applied 516 place count 391 transition count 1939
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 518 place count 389 transition count 1939
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 518 place count 389 transition count 1891
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 614 place count 341 transition count 1891
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 618 place count 337 transition count 1887
Iterating global reduction 3 with 4 rules applied. Total rules applied 622 place count 337 transition count 1887
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 337 transition count 1886
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 623 place count 337 transition count 1884
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 627 place count 335 transition count 1884
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 795 place count 251 transition count 1800
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 815 place count 251 transition count 1780
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 10 rules applied. Total rules applied 825 place count 251 transition count 1770
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 835 place count 241 transition count 1770
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 845 place count 236 transition count 1765
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 846 place count 235 transition count 1764
Applied a total of 846 rules in 246 ms. Remains 235 /967 variables (removed 732) and now considering 1764/2561 (removed 797) transitions.
[2025-05-29 22:44:20] [INFO ] Flow matrix only has 1625 transitions (discarded 139 similar events)
// Phase 1: matrix 1625 rows 235 cols
[2025-05-29 22:44:20] [INFO ] Computed 16 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:44:21] [INFO ] Implicit Places using invariants in 483 ms returned []
[2025-05-29 22:44:21] [INFO ] Flow matrix only has 1625 transitions (discarded 139 similar events)
[2025-05-29 22:44:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:44:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 22:44:22] [INFO ] Implicit Places using invariants and state equation in 1312 ms returned []
Implicit Place search using SMT with State Equation took 1797 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:44:23] [INFO ] Redundant transitions in 430 ms returned []
Running 1723 sub problems to find dead transitions.
[2025-05-29 22:44:23] [INFO ] Flow matrix only has 1625 transitions (discarded 139 similar events)
[2025-05-29 22:44:23] [INFO ] Invariant cache hit.
[2025-05-29 22:44:23] [INFO ] State equation strengthened by 25 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
At refinement iteration 2 (OVERLAPS) 5/235 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/1860 variables, and 16 constraints, problems are : Problem set: 0 solved, 1723 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/235 constraints, ReadFeed: 0/25 constraints, PredecessorRefiner: 1723/398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1723 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
At refinement iteration 2 (OVERLAPS) 5/235 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/1860 variables, and 16 constraints, problems are : Problem set: 0 solved, 1723 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/235 constraints, ReadFeed: 0/25 constraints, PredecessorRefiner: 1325/398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63342ms problems are : Problem set: 0 solved, 1723 unsolved
Search for dead transitions found 0 dead transitions in 63350ms
Starting structural reductions in SI_CTL mode, iteration 1 : 235/967 places, 1764/2561 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65842 ms. Remains : 235/967 places, 1764/2561 transitions.
[2025-05-29 22:45:26] [INFO ] Flatten gal took : 159 ms
[2025-05-29 22:45:26] [INFO ] Flatten gal took : 165 ms
[2025-05-29 22:45:26] [INFO ] Input system was already deterministic with 1764 transitions.
[2025-05-29 22:45:27] [INFO ] Flatten gal took : 164 ms
[2025-05-29 22:45:27] [INFO ] Flatten gal took : 165 ms
[2025-05-29 22:45:27] [INFO ] Time to serialize gal into /tmp/CTLFireability5981026098380568565.gal : 24 ms
[2025-05-29 22:45:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17240097943391228146.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/CTLFireability5981026098380568565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17240097943391228146.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-05-29 22:45:57] [INFO ] Flatten gal took : 166 ms
[2025-05-29 22:45:57] [INFO ] Applying decomposition
[2025-05-29 22:45:57] [INFO ] Flatten gal took : 169 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/graph3136231238910555881.txt' '-o' '/tmp/graph3136231238910555881.bin' '-w' '/tmp/graph3136231238910555881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3136231238910555881.bin' '-l' '-1' '-v' '-w' '/tmp/graph3136231238910555881.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:45:58] [INFO ] Decomposing Gal with order
[2025-05-29 22:45:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:45:58] [INFO ] Removed a total of 11880 redundant transitions.
[2025-05-29 22:45:58] [INFO ] Flatten gal took : 366 ms
[2025-05-29 22:45:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 104 ms.
[2025-05-29 22:45:58] [INFO ] Time to serialize gal into /tmp/CTLFireability4482664200320238779.gal : 19 ms
[2025-05-29 22:45:58] [INFO ] Time to serialize properties into /tmp/CTLFireability7034269938171097614.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/CTLFireability4482664200320238779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7034269938171097614.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.15248e+16,1.77398,39932,430,94,8256,664,6919,11960,1149,1694,0
Converting to forward existential form...Done !
original formula: AF(((!(A((i5.u59.p1397==1) U (i5.u53.p1259==1))) * A(A(EG((i0.i0.u9.p188==1)) U (i0.i2.u12.p232!=1)) U EG(((i5.u50.p1182==1)||((((((i0.i0...521
=> equivalent forward existential formula: [FwdG(Init,!(((!(!((E(!((i5.u53.p1259==1)) U (!((i5.u59.p1397==1)) * !((i5.u53.p1259==1)))) + EG(!((i5.u53.p1259...1479
Reverse transition relation is NOT exact ! Due to transitions t327, t1308, t1327, u71.t1, i0.t1310, i0.t1242, i0.t108, i0.i0.t100, i0.i0.t1309, i0.i0.u10.t...621
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 967/967 places, 2561/2561 transitions.
Graph (trivial) has 994 edges and 967 vertex of which 355 / 967 are part of one of the 40 SCC in 2 ms
Free SCC test removed 315 places
Ensure Unique test removed 358 transitions
Reduce isomorphic transitions removed 358 transitions.
Graph (complete) has 2522 edges and 652 vertex of which 624 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 263 rules applied. Total rules applied 265 place count 623 transition count 914
Reduce places removed 263 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 265 rules applied. Total rules applied 530 place count 360 transition count 912
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 533 place count 359 transition count 910
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 535 place count 357 transition count 910
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 535 place count 357 transition count 862
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 631 place count 309 transition count 862
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 638 place count 302 transition count 855
Iterating global reduction 4 with 7 rules applied. Total rules applied 645 place count 302 transition count 855
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 647 place count 302 transition count 853
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 647 place count 302 transition count 851
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 651 place count 300 transition count 851
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 5 with 170 rules applied. Total rules applied 821 place count 215 transition count 766
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 841 place count 215 transition count 746
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 5 with 10 rules applied. Total rules applied 851 place count 215 transition count 736
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 861 place count 205 transition count 736
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 871 place count 200 transition count 731
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 872 place count 199 transition count 730
Applied a total of 872 rules in 82 ms. Remains 199 /967 variables (removed 768) and now considering 730/2561 (removed 1831) transitions.
[2025-05-29 22:46:28] [INFO ] Flow matrix only has 591 transitions (discarded 139 similar events)
// Phase 1: matrix 591 rows 199 cols
[2025-05-29 22:46:28] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:46:28] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-05-29 22:46:28] [INFO ] Flow matrix only has 591 transitions (discarded 139 similar events)
[2025-05-29 22:46:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:46:29] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 22:46:29] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:46:29] [INFO ] Redundant transitions in 422 ms returned []
Running 689 sub problems to find dead transitions.
[2025-05-29 22:46:29] [INFO ] Flow matrix only has 591 transitions (discarded 139 similar events)
[2025-05-29 22:46:29] [INFO ] Invariant cache hit.
[2025-05-29 22:46:29] [INFO ] State equation strengthened by 25 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 2 (OVERLAPS) 590/784 variables, 194/199 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/784 variables, 25/224 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/784 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 689 unsolved
SMT process timed out in 30683ms, After SMT, problems are : Problem set: 0 solved, 689 unsolved
Search for dead transitions found 0 dead transitions in 30686ms
Starting structural reductions in SI_CTL mode, iteration 1 : 199/967 places, 730/2561 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31711 ms. Remains : 199/967 places, 730/2561 transitions.
[2025-05-29 22:47:00] [INFO ] Flatten gal took : 21 ms
[2025-05-29 22:47:00] [INFO ] Flatten gal took : 22 ms
[2025-05-29 22:47:00] [INFO ] Input system was already deterministic with 730 transitions.
[2025-05-29 22:47:00] [INFO ] Flatten gal took : 21 ms
[2025-05-29 22:47:00] [INFO ] Flatten gal took : 21 ms
[2025-05-29 22:47:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3379099820355681090.gal : 4 ms
[2025-05-29 22:47:00] [INFO ] Time to serialize properties into /tmp/CTLFireability15957480427868079702.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/CTLFireability3379099820355681090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15957480427868079702.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,6.43786e+15,4.89433,137912,2,16368,5,589861,6,0,1463,528100,0
Converting to forward existential form...Done !
original formula: AF((p1381==1))
=> equivalent forward existential formula: [FwdG(Init,!((p1381==1)))] = FALSE
Hit Full ! (commute/partial/dont) 727/0/3
(forward)formula 0,0,17.4723,394488,1,0,10,2.09654e+06,20,4,11566,1.40517e+06,8
FORMULA CloudDeployment-PT-5b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 2561/2561 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 966 transition count 2561
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 936 transition count 1518
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 936 transition count 1518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 936 transition count 1516
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 69 place count 930 transition count 1510
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 930 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 929 transition count 1509
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 929 transition count 1509
Applied a total of 77 rules in 104 ms. Remains 929 /967 variables (removed 38) and now considering 1509/2561 (removed 1052) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2025-05-29 22:47:18] [INFO ] Computed 15 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:18] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-05-29 22:47:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:19] [INFO ] Implicit Places using invariants and state equation in 995 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
[2025-05-29 22:47:19] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1172 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/967 places, 1509/2561 transitions.
Applied a total of 0 rules in 23 ms. Remains 928 /928 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1299 ms. Remains : 928/967 places, 1509/2561 transitions.
[2025-05-29 22:47:19] [INFO ] Flatten gal took : 35 ms
[2025-05-29 22:47:19] [INFO ] Flatten gal took : 37 ms
[2025-05-29 22:47:19] [INFO ] Input system was already deterministic with 1509 transitions.
[2025-05-29 22:47:19] [INFO ] Flatten gal took : 36 ms
[2025-05-29 22:47:19] [INFO ] Flatten gal took : 36 ms
[2025-05-29 22:47:19] [INFO ] Time to serialize gal into /tmp/CTLFireability4425503626742014163.gal : 6 ms
[2025-05-29 22:47:19] [INFO ] Time to serialize properties into /tmp/CTLFireability13630901685700903838.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/CTLFireability4425503626742014163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13630901685700903838.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-05-29 22:47:49] [INFO ] Flatten gal took : 38 ms
[2025-05-29 22:47:49] [INFO ] Applying decomposition
[2025-05-29 22:47:49] [INFO ] Flatten gal took : 38 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/graph15472879695792631118.txt' '-o' '/tmp/graph15472879695792631118.bin' '-w' '/tmp/graph15472879695792631118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15472879695792631118.bin' '-l' '-1' '-v' '-w' '/tmp/graph15472879695792631118.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:47:49] [INFO ] Decomposing Gal with order
[2025-05-29 22:47:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:47:50] [INFO ] Removed a total of 1818 redundant transitions.
[2025-05-29 22:47:50] [INFO ] Flatten gal took : 56 ms
[2025-05-29 22:47:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 10 ms.
[2025-05-29 22:47:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3712272918020120522.gal : 7 ms
[2025-05-29 22:47:50] [INFO ] Time to serialize properties into /tmp/CTLFireability2646436797982688778.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/CTLFireability3712272918020120522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2646436797982688778.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 2561/2561 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 966 transition count 2561
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 936 transition count 1518
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 936 transition count 1518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 936 transition count 1516
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 69 place count 930 transition count 1510
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 930 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 929 transition count 1509
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 929 transition count 1509
Applied a total of 77 rules in 100 ms. Remains 929 /967 variables (removed 38) and now considering 1509/2561 (removed 1052) transitions.
[2025-05-29 22:48:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:48:20] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-05-29 22:48:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:48:21] [INFO ] Implicit Places using invariants and state equation in 993 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
[2025-05-29 22:48:21] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1162 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/967 places, 1509/2561 transitions.
Applied a total of 0 rules in 25 ms. Remains 928 /928 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1288 ms. Remains : 928/967 places, 1509/2561 transitions.
[2025-05-29 22:48:21] [INFO ] Flatten gal took : 34 ms
[2025-05-29 22:48:21] [INFO ] Flatten gal took : 36 ms
[2025-05-29 22:48:21] [INFO ] Input system was already deterministic with 1509 transitions.
[2025-05-29 22:48:21] [INFO ] Flatten gal took : 36 ms
[2025-05-29 22:48:21] [INFO ] Flatten gal took : 36 ms
[2025-05-29 22:48:21] [INFO ] Time to serialize gal into /tmp/CTLFireability3091150934356242176.gal : 6 ms
[2025-05-29 22:48:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5661720275109442544.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/CTLFireability3091150934356242176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5661720275109442544.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-05-29 22:48:51] [INFO ] Flatten gal took : 36 ms
[2025-05-29 22:48:51] [INFO ] Applying decomposition
[2025-05-29 22:48:51] [INFO ] Flatten gal took : 36 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/graph873937091469304052.txt' '-o' '/tmp/graph873937091469304052.bin' '-w' '/tmp/graph873937091469304052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph873937091469304052.bin' '-l' '-1' '-v' '-w' '/tmp/graph873937091469304052.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:48:51] [INFO ] Decomposing Gal with order
[2025-05-29 22:48:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:48:52] [INFO ] Removed a total of 2204 redundant transitions.
[2025-05-29 22:48:52] [INFO ] Flatten gal took : 55 ms
[2025-05-29 22:48:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 12 ms.
[2025-05-29 22:48:52] [INFO ] Time to serialize gal into /tmp/CTLFireability251583322314922372.gal : 7 ms
[2025-05-29 22:48:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11889947617691793511.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/CTLFireability251583322314922372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11889947617691793511.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.
Detected timeout of ITS tools.
[2025-05-29 22:49:22] [INFO ] Flatten gal took : 177 ms
[2025-05-29 22:49:22] [INFO ] Flatten gal took : 178 ms
[2025-05-29 22:49:22] [INFO ] Applying decomposition
[2025-05-29 22:49:22] [INFO ] Flatten gal took : 175 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/graph7898519899217804994.txt' '-o' '/tmp/graph7898519899217804994.bin' '-w' '/tmp/graph7898519899217804994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7898519899217804994.bin' '-l' '-1' '-v' '-w' '/tmp/graph7898519899217804994.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:49:23] [INFO ] Decomposing Gal with order
[2025-05-29 22:49:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:49:23] [INFO ] Removed a total of 12439 redundant transitions.
[2025-05-29 22:49:23] [INFO ] Flatten gal took : 396 ms
[2025-05-29 22:49:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 114 ms.
[2025-05-29 22:49:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6510076574167105638.gal : 25 ms
[2025-05-29 22:49:23] [INFO ] Time to serialize properties into /tmp/CTLFireability941107577364231172.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/CTLFireability6510076574167105638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability941107577364231172.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.2903e+23,55.7283,1332392,21076,137,2.00516e+06,5526,7323,8.36012e+06,1168,9924,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 23:15:12] [INFO ] Applying decomposition
[2025-05-29 23:15:13] [INFO ] Flatten gal took : 211 ms
[2025-05-29 23:15:13] [INFO ] Decomposing Gal with order
[2025-05-29 23:15:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:15:13] [INFO ] Removed a total of 19223 redundant transitions.
[2025-05-29 23:15:13] [INFO ] Flatten gal took : 303 ms
[2025-05-29 23:15:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 588 labels/synchronizations in 74 ms.
[2025-05-29 23:15:13] [INFO ] Time to serialize gal into /tmp/CTLFireability6967349902764770226.gal : 5 ms
[2025-05-29 23:15:13] [INFO ] Time to serialize properties into /tmp/CTLFireability15873265989429357960.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/CTLFireability6967349902764770226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15873265989429357960.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.2903e+23,3.23508,93628,1890,8465,49686,159270,910,137705,1497,798215,0
Converting to forward existential form...Done !
original formula: E(AX(FALSE) U AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(FALSE)))) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1308, t2142, t2162, t2168, t2179, t2189, u40.t3, u40.t4, i0.t2505, i0.t2498, i0.t2497, i0.t2...2693
(forward)formula 0,0,24.5218,589800,1,0,640014,431729,26400,1.90065e+06,9809,3.01972e+06,1867191
FORMULA CloudDeployment-PT-5b-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(((AX(((i0.i0.i0.i0.i0.i0.u10.p253==1)||((((((i0.i0.i0.i0.i0.i0.i0.u8.p27==1)&&(i0.i0.i0.i0.i0.i0.i0.u9.p58==1))&&((i0.i0.i0.i0.i0.i0.u...662
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !((i0.i0.i0.i0.i0.i1.u15.p571==0))) * !((i0.i0.i1.u30.p1294==0)))) * !(((i0.i0.i0.i0.i0...722
(forward)formula 1,0,24.6879,594792,1,0,644839,442258,26974,1.91191e+06,10474,3.0571e+06,1872521
FORMULA CloudDeployment-PT-5b-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: A(!(AF(AG((i0.i0.i1.u30.p1392==1)))) U (EF((EF(EG((((i0.i0.i0.i0.i0.i1.i0.u13.p301==1)&&(i0.i0.i0.i0.i0.i1.i0.u14.p343==1))&&((i0.i0.i0.i...813
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U (E(TRUE U EG((((i0.i0.i0.i0.i0.i1.i0.u13.p301==1)&&(i0.i0.i0.i0.i0.i1.i0.u14.p343==1)...2454
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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="CloudDeployment-PT-5b"
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 CloudDeployment-PT-5b, 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 r044-tall-174854027700058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-5b.tgz
mv CloudDeployment-PT-5b 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 ;