About the Execution of ITS-Tools for MedleyA-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1207440.00 | 0.00 | 0.00 | TTTTFFFTFTFTFTTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524000154.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is MedleyA-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524000154
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 90K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-08-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-08-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-08-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-08-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-08-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-08-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-08-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-08-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-08-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-08-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-08-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-08-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748850234271
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 07:43:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 07:43:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 07:43:57] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2025-06-02 07:43:57] [INFO ] Transformed 147 places.
[2025-06-02 07:43:57] [INFO ] Transformed 312 transitions.
[2025-06-02 07:43:57] [INFO ] Found NUPN structural information;
[2025-06-02 07:43:57] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Support contains 82 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 312/312 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 312
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 125 transition count 290
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 125 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 125 transition count 288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 124 transition count 287
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 124 transition count 287
Applied a total of 46 rules in 86 ms. Remains 124 /147 variables (removed 23) and now considering 287/312 (removed 25) transitions.
// Phase 1: matrix 287 rows 124 cols
[2025-06-02 07:43:57] [INFO ] Computed 10 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:43:57] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-06-02 07:43:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:43:58] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-06-02 07:43:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/124 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:04] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:04] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:04] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:04] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:05] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:05] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 6/16 constraints. Problems are: Problem set: 48 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:08] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:08] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:08] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/19 constraints. Problems are: Problem set: 48 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:09] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:10] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:10] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 3/22 constraints. Problems are: Problem set: 48 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/22 constraints. Problems are: Problem set: 48 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 287/411 variables, 124/146 constraints. Problems are: Problem set: 48 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:16] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:18] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 2/148 constraints. Problems are: Problem set: 48 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:19] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 19 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 1/149 constraints. Problems are: Problem set: 48 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:24] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:24] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 2/151 constraints. Problems are: Problem set: 48 solved, 238 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 0.0)
(t2 1.0)
(t3 0.0)
(t4 1.0)
(t5 1.0)
(t6 1.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 1.0)
(t11 0.0)
(t12 0.0)
(t13 1.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 1.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 1.0)
(t23 1.0)
(t24 1.0)
(t25 1.0)
(t26 0.0)
(t27 1.0)
(t28 1.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 1.0)
(t55 0.0)
(t56 1.0)
(t57 1.0)
(t58 0.0)
(t59 1.0)
(t60 1.0)
(t61 0.0)
(t62 0.0)
(t63 1.0)
(t64 1.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 1.0)
(t69 0.0)
(t70 2.0)
(t71 2.0)
(t72 1.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 2.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 2.0)
(t101 2.0)
(t102 2.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 2.0)
(t120 2.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 1.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 1.0)
(t141 0.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 0.0)
(t154 0.0)
(t155 1.0)
(t156 0.0)
(t157 0.0)
(t158 1.0)
(t159 0.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/411 variables, and 151 constraints, problems are : Problem set: 48 solved, 238 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 48 solved, 238 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 6/6 constraints. Problems are: Problem set: 48 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 48 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 15/25 constraints. Problems are: Problem set: 48 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 48 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 287/411 variables, 124/149 constraints. Problems are: Problem set: 48 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 238/387 constraints. Problems are: Problem set: 48 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:35] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 1/388 constraints. Problems are: Problem set: 48 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:40] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:41] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:41] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:42] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:42] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:44:44] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 6/394 constraints. Problems are: Problem set: 48 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 2/396 constraints. Problems are: Problem set: 48 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 396 constraints, problems are : Problem set: 48 solved, 238 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 238/286 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60729ms problems are : Problem set: 48 solved, 238 unsolved
Search for dead transitions found 48 dead transitions in 60761ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 124/147 places, 239/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61693 ms. Remains : 124/147 places, 239/312 transitions.
Support contains 82 out of 124 places after structural reductions.
[2025-06-02 07:44:59] [INFO ] Flatten gal took : 69 ms
[2025-06-02 07:44:59] [INFO ] Flatten gal took : 41 ms
[2025-06-02 07:44:59] [INFO ] Input system was already deterministic with 239 transitions.
Support contains 81 out of 124 places (down from 82) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 81 to 80
RANDOM walk for 40000 steps (1997 resets) in 2817 ms. (14 steps per ms) remains 58/80 properties
BEST_FIRST walk for 4003 steps (52 resets) in 37 ms. (105 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (54 resets) in 31 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (57 resets) in 42 ms. (93 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (50 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (53 resets) in 48 ms. (81 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (45 resets) in 63 ms. (62 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (49 resets) in 84 ms. (47 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (49 resets) in 79 ms. (50 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (51 resets) in 46 ms. (85 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (55 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (49 resets) in 21 ms. (181 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (52 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (53 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (53 resets) in 21 ms. (182 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (51 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (50 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (50 resets) in 35 ms. (111 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (49 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (49 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (54 resets) in 46 ms. (85 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (58 resets) in 39 ms. (100 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (55 resets) in 27 ms. (142 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (54 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (45 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (49 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (48 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (51 resets) in 27 ms. (142 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (52 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (59 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (49 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (52 resets) in 21 ms. (182 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (52 resets) in 21 ms. (181 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (60 resets) in 39 ms. (100 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (50 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (49 resets) in 25 ms. (154 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (54 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (49 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (58 resets) in 25 ms. (153 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (53 resets) in 27 ms. (143 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (56 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (48 resets) in 25 ms. (154 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (53 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (56 resets) in 39 ms. (100 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (51 resets) in 27 ms. (143 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (50 resets) in 29 ms. (133 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (47 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (57 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (53 resets) in 30 ms. (129 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (56 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (59 resets) in 29 ms. (133 steps per ms) remains 57/57 properties
// Phase 1: matrix 239 rows 124 cols
[2025-06-02 07:45:01] [INFO ] Computed 10 invariants in 5 ms
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/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (OVERLAPS) 29/90 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 52 unsolved
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 3 (OVERLAPS) 26/116 variables, 6/10 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/10 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 230/346 variables, 116/126 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/126 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 11/357 variables, 5/131 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/131 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 5/362 variables, 2/133 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/133 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 1/363 variables, 1/134 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/134 constraints. Problems are: Problem set: 11 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:04] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 20 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/363 variables, 1/135 constraints. Problems are: Problem set: 11 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:05] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/363 variables, 1/136 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 0/136 constraints. Problems are: Problem set: 11 solved, 46 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/363 variables, and 136 constraints, problems are : Problem set: 11 solved, 46 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 57/56 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 46 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 30/88 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 28/116 variables, 6/10 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/12 constraints. Problems are: Problem set: 11 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:07] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:07] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:07] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:07] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:07] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:07] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:07] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:08] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:08] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:08] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:08] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:08] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 12/24 constraints. Problems are: Problem set: 11 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:08] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:09] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:09] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 3/27 constraints. Problems are: Problem set: 11 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:09] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:09] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 2/29 constraints. Problems are: Problem set: 11 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:10] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:10] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 2/31 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/31 constraints. Problems are: Problem set: 11 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 230/346 variables, 116/147 constraints. Problems are: Problem set: 11 solved, 46 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/363 variables, and 192 constraints, problems are : Problem set: 11 solved, 46 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 116/124 constraints, PredecessorRefiner: 46/56 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10140ms problems are : Problem set: 11 solved, 46 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 239/239 transitions.
Graph (complete) has 441 edges and 124 vertex of which 119 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 119 transition count 223
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 19 place count 114 transition count 223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 114 transition count 220
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 111 transition count 220
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 35 place count 101 transition count 210
Iterating global reduction 2 with 10 rules applied. Total rules applied 45 place count 101 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 101 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 100 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 100 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 54 place count 97 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 97 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 97 transition count 198
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 96 transition count 198
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 70 place count 96 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 96 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 95 transition count 196
Applied a total of 72 rules in 120 ms. Remains 95 /124 variables (removed 29) and now considering 196/239 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 95/124 places, 196/239 transitions.
RANDOM walk for 40000 steps (2859 resets) in 724 ms. (55 steps per ms) remains 37/46 properties
BEST_FIRST walk for 4002 steps (64 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (68 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (54 resets) in 21 ms. (182 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (58 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (55 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (51 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (66 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (53 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (63 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (56 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (56 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (56 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (57 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (52 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (63 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (65 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (55 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (53 resets) in 21 ms. (182 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (57 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (48 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (54 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (66 resets) in 52 ms. (75 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (61 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (58 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (61 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (49 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (54 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (63 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (60 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (56 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (58 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (60 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (62 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (61 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (54 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (58 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (68 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
// Phase 1: matrix 196 rows 95 cols
[2025-06-02 07:45:12] [INFO ] Computed 8 invariants in 3 ms
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/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 21/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 16/88 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 195/283 variables, 88/96 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 8/291 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:13] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:13] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:13] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:13] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 0/291 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 107 constraints, problems are : Problem set: 0 solved, 37 unsolved in 2685 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 37/36 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 21/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 16/88 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:15] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:15] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:15] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:15] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:15] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:15] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:15] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:16] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:16] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:16] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 195/283 variables, 88/109 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 18/127 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:17] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:17] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:18] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:19] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (OVERLAPS) 8/291 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 18/157 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:23] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/291 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:26] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 12 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/291 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/291 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 19 (OVERLAPS) 0/291 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 159 constraints, problems are : Problem set: 0 solved, 37 unsolved in 17559 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 37/36 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 20301ms problems are : Problem set: 0 solved, 37 unsolved
Fused 37 Parikh solutions to 36 different solutions.
Parikh walk visited 35 properties in 9390 ms.
Support contains 8 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 196/196 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 95 transition count 188
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 90 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 13 place count 90 transition count 186
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 17 place count 88 transition count 186
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 26 place count 79 transition count 173
Iterating global reduction 2 with 9 rules applied. Total rules applied 35 place count 79 transition count 173
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 76 transition count 164
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 76 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 75 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 75 transition count 161
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 2 with 1 rules applied. Total rules applied 44 place count 75 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 74 transition count 160
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 4 with 10 rules applied. Total rules applied 55 place count 69 transition count 155
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 69 place count 62 transition count 211
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 85 place count 62 transition count 195
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 105 place count 62 transition count 175
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 107 place count 61 transition count 183
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 109 place count 61 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 111 place count 59 transition count 181
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 115 place count 59 transition count 197
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 119 place count 55 transition count 197
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 122 place count 52 transition count 194
Applied a total of 122 rules in 88 ms. Remains 52 /95 variables (removed 43) and now considering 194/196 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 52/95 places, 194/196 transitions.
RANDOM walk for 40000 steps (15 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (28 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (19 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 10963 steps, run visited all 2 properties in 60 ms. (steps per millisecond=182 )
Probabilistic random walk after 10963 steps, saw 3741 distinct states, run finished after 67 ms. (steps per millisecond=163 ) properties seen :2
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2025-06-02 07:45:42] [INFO ] Flatten gal took : 30 ms
[2025-06-02 07:45:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-08-CTLFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 07:45:42] [INFO ] Flatten gal took : 36 ms
[2025-06-02 07:45:42] [INFO ] Input system was already deterministic with 239 transitions.
Support contains 74 out of 124 places (down from 77) after GAL structural reductions.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 441 edges and 124 vertex of which 119 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 103 transition count 210
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 103 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 103 transition count 209
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 99 transition count 201
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 99 transition count 201
Applied a total of 51 rules in 16 ms. Remains 99 /124 variables (removed 25) and now considering 201/239 (removed 38) transitions.
// Phase 1: matrix 201 rows 99 cols
[2025-06-02 07:45:42] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:45:42] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 07:45:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:45:42] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-02 07:45:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:45] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:45] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:45] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:45] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/300 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:50] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:52] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 115 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17592 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/300 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 200/313 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:46:09] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:46:09] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:46:09] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:46:09] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:46:15] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/300 variables, and 320 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47705ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 47706ms
Starting structural reductions in LTL mode, iteration 1 : 99/124 places, 201/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48047 ms. Remains : 99/124 places, 201/239 transitions.
[2025-06-02 07:46:30] [INFO ] Flatten gal took : 35 ms
[2025-06-02 07:46:30] [INFO ] Flatten gal took : 52 ms
[2025-06-02 07:46:30] [INFO ] Input system was already deterministic with 201 transitions.
[2025-06-02 07:46:30] [INFO ] Flatten gal took : 27 ms
[2025-06-02 07:46:30] [INFO ] Flatten gal took : 14 ms
[2025-06-02 07:46:30] [INFO ] Time to serialize gal into /tmp/CTLFireability2323760044873907952.gal : 8 ms
[2025-06-02 07:46:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11196148601220828212.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2323760044873907952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11196148601220828212.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.70918e+06,1.62562,44604,2,6526,5,120699,6,0,597,206345,0
Converting to forward existential form...Done !
original formula: (AF((((EF((((p15==0)||(p26==0))||((p83==0)||(p96==0)))) * EX((p101==1))) * (EG(!(E((((p22==1)&&(p32==1))&&((p83==1)&&(p122==1))) U (p117=...348
=> equivalent forward existential formula: ([FwdG(Init,!((((E(TRUE U (((p15==0)||(p26==0))||((p83==0)||(p96==0)))) * EX((p101==1))) * (EG(!(E((((p22==1)&&(...425
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t27, t28, t29, t31, t32, t33, t3...570
Detected timeout of ITS tools.
[2025-06-02 07:47:00] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:47:00] [INFO ] Applying decomposition
[2025-06-02 07:47:00] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13670438147319374996.txt' '-o' '/tmp/graph13670438147319374996.bin' '-w' '/tmp/graph13670438147319374996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13670438147319374996.bin' '-l' '-1' '-v' '-w' '/tmp/graph13670438147319374996.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:47:00] [INFO ] Decomposing Gal with order
[2025-06-02 07:47:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:47:00] [INFO ] Removed a total of 320 redundant transitions.
[2025-06-02 07:47:01] [INFO ] Flatten gal took : 87 ms
[2025-06-02 07:47:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 18 ms.
[2025-06-02 07:47:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2398757773304591065.gal : 6 ms
[2025-06-02 07:47:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2092964981842402398.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/CTLFireability2398757773304591065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2092964981842402398.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,8.70918e+06,0.507078,17464,491,254,21300,1793,364,57941,134,17605,0
Converting to forward existential form...Done !
original formula: (AF((((EF((((i1.u2.p15==0)||(i1.u4.p26==0))||((i6.u11.p83==0)||(i5.u16.p96==0)))) * EX((i6.u17.p101==1))) * (EG(!(E((((i3.u3.p22==1)&&(i2...514
=> equivalent forward existential formula: ([FwdG(Init,!((((E(TRUE U (((i1.u2.p15==0)||(i1.u4.p26==0))||((i6.u11.p83==0)||(i5.u16.p96==0)))) * EX((i6.u17.p...591
Reverse transition relation is NOT exact ! Due to transitions t68, t101, t107, t181, t182, t183, t184, t189, t190, i1.u4.t97, i2.t94, i2.t91, i2.u5.t66, i2...941
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,14.7968,319980,1,0,510867,12431,2285,1.38966e+06,722,164029,629934
FORMULA MedleyA-PT-08-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 101 transition count 206
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 101 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 101 transition count 204
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 98 transition count 197
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 98 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 97 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 97 transition count 194
Applied a total of 56 rules in 13 ms. Remains 97 /124 variables (removed 27) and now considering 194/239 (removed 45) transitions.
// Phase 1: matrix 194 rows 97 cols
[2025-06-02 07:47:15] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:47:16] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-02 07:47:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:47:16] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-02 07:47:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:47:18] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:47:18] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:47:18] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/291 variables, 97/110 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:47:22] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:47:27] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:47:28] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:47:28] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 114 constraints, problems are : Problem set: 0 solved, 193 unsolved in 20951 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/291 variables, 97/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 193/305 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:47:46] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:47:46] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:47:47] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:47:52] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:47:57] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:47:57] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 18 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/291 variables, and 313 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51052ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 51053ms
Starting structural reductions in LTL mode, iteration 1 : 97/124 places, 194/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51325 ms. Remains : 97/124 places, 194/239 transitions.
[2025-06-02 07:48:07] [INFO ] Flatten gal took : 22 ms
[2025-06-02 07:48:07] [INFO ] Flatten gal took : 19 ms
[2025-06-02 07:48:07] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-02 07:48:07] [INFO ] Flatten gal took : 15 ms
[2025-06-02 07:48:07] [INFO ] Flatten gal took : 15 ms
[2025-06-02 07:48:07] [INFO ] Time to serialize gal into /tmp/CTLFireability17604733506445403012.gal : 4 ms
[2025-06-02 07:48:07] [INFO ] Time to serialize properties into /tmp/CTLFireability18086107172792440699.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/CTLFireability17604733506445403012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18086107172792440699.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.37942e+06,1.69819,42116,2,7452,5,125273,6,0,582,174380,0
Converting to forward existential form...Done !
original formula: AG(((p55==1) + (EX(EF((p38==1))) * !(E((((p117==1)||(p95==1))||(p86==1)) U (((((p22==1)&&(p35==1))&&((p76==1)&&(p87==1)))||((p69==1)&&(p8...208
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((p55==1))) * !(EX(E(TRUE U (p38==1)))))] = FALSE * [FwdG((FwdU((FwdU(Init,TRUE) * !((p55...313
Hit Full ! (commute/partial/dont) 173/0/21
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t31, t32, t3...553
(forward)formula 0,0,27.533,554292,1,0,461,3.32021e+06,428,165,5148,2.34082e+06,493
FORMULA MedleyA-PT-08-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 101 transition count 206
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 101 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 101 transition count 204
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 97 transition count 195
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 97 transition count 195
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 95 transition count 190
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 95 transition count 190
Applied a total of 60 rules in 18 ms. Remains 95 /124 variables (removed 29) and now considering 190/239 (removed 49) transitions.
// Phase 1: matrix 190 rows 95 cols
[2025-06-02 07:48:35] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:48:35] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 07:48:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:48:35] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2025-06-02 07:48:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:48:37] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:48:38] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:48:38] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:48:38] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:48:38] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/285 variables, 95/110 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:48:42] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:48:46] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 0/285 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 112 constraints, problems are : Problem set: 0 solved, 189 unsolved in 19673 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/285 variables, 95/110 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 189/299 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:48:59] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:48:59] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:49:08] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:49:09] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:49:09] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:49:09] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:49:09] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:49:15] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 309 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 49786ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 49787ms
Starting structural reductions in LTL mode, iteration 1 : 95/124 places, 190/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50084 ms. Remains : 95/124 places, 190/239 transitions.
[2025-06-02 07:49:25] [INFO ] Flatten gal took : 20 ms
[2025-06-02 07:49:25] [INFO ] Flatten gal took : 17 ms
[2025-06-02 07:49:25] [INFO ] Input system was already deterministic with 190 transitions.
[2025-06-02 07:49:25] [INFO ] Flatten gal took : 14 ms
[2025-06-02 07:49:25] [INFO ] Flatten gal took : 15 ms
[2025-06-02 07:49:25] [INFO ] Time to serialize gal into /tmp/CTLFireability4581793794094085340.gal : 4 ms
[2025-06-02 07:49:25] [INFO ] Time to serialize properties into /tmp/CTLFireability391620545235705870.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/CTLFireability4581793794094085340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability391620545235705870.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.61237e+06,2.07901,44872,2,6067,5,116315,6,0,570,215004,0
Converting to forward existential form...Done !
original formula: AF(EG(((EX(((((p15==1)&&(p61==1))&&((p83==1)&&(p96==1)))||(p55==1))) + A((((p22==1)&&(p37==1))&&(p42==1)) U (((p111==1)&&(p22==1))&&((p61...223
=> equivalent forward existential formula: [FwdG(Init,!(EG(((EX(((((p15==1)&&(p61==1))&&((p83==1)&&(p96==1)))||(p55==1))) + !((E(!((((p111==1)&&(p22==1))&&...395
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t30, t31, t3...552
Detected timeout of ITS tools.
[2025-06-02 07:49:55] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:49:55] [INFO ] Applying decomposition
[2025-06-02 07:49:55] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5655621952682470861.txt' '-o' '/tmp/graph5655621952682470861.bin' '-w' '/tmp/graph5655621952682470861.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5655621952682470861.bin' '-l' '-1' '-v' '-w' '/tmp/graph5655621952682470861.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:49:55] [INFO ] Decomposing Gal with order
[2025-06-02 07:49:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:49:55] [INFO ] Removed a total of 328 redundant transitions.
[2025-06-02 07:49:55] [INFO ] Flatten gal took : 24 ms
[2025-06-02 07:49:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 6 ms.
[2025-06-02 07:49:55] [INFO ] Time to serialize gal into /tmp/CTLFireability14711773356295417114.gal : 4 ms
[2025-06-02 07:49:55] [INFO ] Time to serialize properties into /tmp/CTLFireability11030627758714030694.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/CTLFireability14711773356295417114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11030627758714030694.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.61237e+06,0.53394,17488,470,288,21525,2935,341,52363,122,30025,0
Converting to forward existential form...Done !
original formula: AF(EG(((EX(((((i1.u2.p15==1)&&(i2.u9.p61==1))&&((i4.u11.p83==1)&&(i6.u17.p96==1)))||(i2.u9.p55==1))) + A((((i2.u3.p22==1)&&(i3.u6.p37==1)...318
=> equivalent forward existential formula: [FwdG(Init,!(EG(((EX(((((i1.u2.p15==1)&&(i2.u9.p61==1))&&((i4.u11.p83==1)&&(i6.u17.p96==1)))||(i2.u9.p55==1))) +...542
Reverse transition relation is NOT exact ! Due to transitions t26, t63, t92, t96, t162, t163, t164, t165, t184, t185, t186, t187, i1.u4.t87, i2.u3.t88, i2....874
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,15.0725,332188,1,0,456716,27383,2455,1.38665e+06,694,307316,447417
FORMULA MedleyA-PT-08-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 101 transition count 206
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 101 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 101 transition count 204
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 98 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 98 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 97 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 97 transition count 197
Applied a total of 56 rules in 8 ms. Remains 97 /124 variables (removed 27) and now considering 197/239 (removed 42) transitions.
// Phase 1: matrix 197 rows 97 cols
[2025-06-02 07:50:10] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:50:10] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 07:50:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:50:10] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-06-02 07:50:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:50:13] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:50:13] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:50:13] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:50:13] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:50:14] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/294 variables, 97/112 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:50:19] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:50:19] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/294 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 114 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16977 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/294 variables, 97/112 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 196/308 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:50:32] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:50:36] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:50:36] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:50:44] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:50:48] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 196 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 294/294 variables, and 315 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47081ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 47082ms
Starting structural reductions in LTL mode, iteration 1 : 97/124 places, 197/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47308 ms. Remains : 97/124 places, 197/239 transitions.
[2025-06-02 07:50:58] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:50:58] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:50:58] [INFO ] Input system was already deterministic with 197 transitions.
[2025-06-02 07:50:58] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:50:58] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:50:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15447271615884218581.gal : 3 ms
[2025-06-02 07:50:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1627551786123092272.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/CTLFireability15447271615884218581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1627551786123092272.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.27438e+06,1.42949,39284,2,6305,5,109116,6,0,585,181186,0
Converting to forward existential form...Done !
original formula: A((EX((((p22==1)&&(p28==1))&&(p52==1))) * EG((p95==1))) U !(((A(!(((p45==1)&&(p112==1))) U EX((((p76==1)&&(p87==1))&&(p138==1)))) + (((p1...349
=> equivalent forward existential formula: [((Init * !(EG(!(!(((!((E(!(EX((((p76==1)&&(p87==1))&&(p138==1)))) U (!(!(((p45==1)&&(p112==1)))) * !(EX((((p76=...1576
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t31, t32, t3...595
Detected timeout of ITS tools.
[2025-06-02 07:51:28] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:51:28] [INFO ] Applying decomposition
[2025-06-02 07:51:28] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11357369360684031298.txt' '-o' '/tmp/graph11357369360684031298.bin' '-w' '/tmp/graph11357369360684031298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11357369360684031298.bin' '-l' '-1' '-v' '-w' '/tmp/graph11357369360684031298.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:51:28] [INFO ] Decomposing Gal with order
[2025-06-02 07:51:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:51:28] [INFO ] Removed a total of 376 redundant transitions.
[2025-06-02 07:51:28] [INFO ] Flatten gal took : 25 ms
[2025-06-02 07:51:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 6 ms.
[2025-06-02 07:51:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5721931719326899877.gal : 3 ms
[2025-06-02 07:51:28] [INFO ] Time to serialize properties into /tmp/CTLFireability4600619102171820905.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/CTLFireability5721931719326899877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4600619102171820905.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,8.27438e+06,0.453151,16856,519,157,20716,1363,376,59482,103,11785,0
Converting to forward existential form...Done !
original formula: A((EX((((i2.u3.p22==1)&&(i3.u7.p28==1))&&(i2.u8.p52==1))) * EG((i5.u15.p95==1))) U !(((A(!(((i2.u8.p45==1)&&(i6.u19.p112==1))) U EX((((i4...509
=> equivalent forward existential formula: [((Init * !(EG(!(!(((!((E(!(EX((((i4.u10.p76==1)&&(i4.u12.p87==1))&&(i7.u28.p138==1)))) U (!(!(((i2.u8.p45==1)&&...2216
Reverse transition relation is NOT exact ! Due to transitions t26, t65, t93, t99, t166, t168, t170, t172, t191, t192, t193, t194, i1.u4.t89, i2.u8.t64, i2....838
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,20.0155,404160,1,0,567297,12045,2375,1.70212e+06,515,158662,582956
FORMULA MedleyA-PT-08-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 100 transition count 205
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 100 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 100 transition count 203
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 95 transition count 190
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 95 transition count 190
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 92 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 92 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 91 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 91 transition count 179
Applied a total of 68 rules in 7 ms. Remains 91 /124 variables (removed 33) and now considering 179/239 (removed 60) transitions.
// Phase 1: matrix 179 rows 91 cols
[2025-06-02 07:51:48] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:51:48] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-02 07:51:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:51:48] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2025-06-02 07:51:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:51:50] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:51:50] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:51:50] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:51:50] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 179/270 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:51:59] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/270 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:52:02] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/270 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 107 constraints, problems are : Problem set: 0 solved, 178 unsolved in 21627 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 179/270 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 178/283 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:52:22] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:52:22] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 8 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/270 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 287 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51699ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 51700ms
Starting structural reductions in LTL mode, iteration 1 : 91/124 places, 179/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51985 ms. Remains : 91/124 places, 179/239 transitions.
[2025-06-02 07:52:40] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:52:40] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:52:40] [INFO ] Input system was already deterministic with 179 transitions.
[2025-06-02 07:52:40] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:52:40] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:52:40] [INFO ] Time to serialize gal into /tmp/CTLFireability13144273648189251076.gal : 2 ms
[2025-06-02 07:52:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6530638868040963667.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/CTLFireability13144273648189251076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6530638868040963667.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.58885e+06,1.40027,34048,2,4777,5,93444,6,0,543,148237,0
Converting to forward existential form...Done !
original formula: AF(E(AX((p51==1)) U ((p36==1)||(((p22==1)&&(p61==1))&&((p83==1)&&(p93==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!(EX(!((p51==1)))) U ((p36==1)||(((p22==1)&&(p61==1))&&((p83==1)&&(p93==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...454
(forward)formula 0,0,22.18,472176,1,0,655,1.95564e+06,385,325,4651,2.80573e+06,602
FORMULA MedleyA-PT-08-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 104 transition count 213
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 104 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 104 transition count 211
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 101 transition count 201
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 101 transition count 201
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 99 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 99 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 98 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 98 transition count 193
Applied a total of 54 rules in 9 ms. Remains 98 /124 variables (removed 26) and now considering 193/239 (removed 46) transitions.
// Phase 1: matrix 193 rows 98 cols
[2025-06-02 07:53:02] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:53:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 07:53:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:53:03] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-06-02 07:53:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:53:05] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:53:05] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:53:06] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:53:06] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:53:06] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 193/291 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:53:11] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:53:15] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 115 constraints, problems are : Problem set: 0 solved, 192 unsolved in 21085 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 193/291 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 192/305 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:53:34] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 308 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51229ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 51231ms
Starting structural reductions in LTL mode, iteration 1 : 98/124 places, 193/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51537 ms. Remains : 98/124 places, 193/239 transitions.
[2025-06-02 07:53:54] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:53:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:53:54] [INFO ] Input system was already deterministic with 193 transitions.
[2025-06-02 07:53:54] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:53:54] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:53:54] [INFO ] Time to serialize gal into /tmp/CTLFireability7224899985098300046.gal : 2 ms
[2025-06-02 07:53:54] [INFO ] Time to serialize properties into /tmp/CTLFireability5934414445802536952.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/CTLFireability7224899985098300046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5934414445802536952.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.43941e+06,2.67019,59532,2,8549,5,153582,6,0,585,256988,0
Converting to forward existential form...Done !
original formula: (AX(E((((((((p22==1)&&(p35==1))&&((p83==1)&&(p122==1)))&&(((p22==1)&&(p61==1))&&(p141==1)))||(p11!=1))||(((((p10==1)&&(p27==1))&&((p22==1...553
=> equivalent forward existential formula: (([((Init * !(!(EX(!(E((((((((p22==1)&&(p35==1))&&((p83==1)&&(p122==1)))&&(((p22==1)&&(p61==1))&&(p141==1)))||(p...1312
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t31, t34, t3...537
Detected timeout of ITS tools.
[2025-06-02 07:54:24] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:54:24] [INFO ] Applying decomposition
[2025-06-02 07:54:24] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12103993715149226389.txt' '-o' '/tmp/graph12103993715149226389.bin' '-w' '/tmp/graph12103993715149226389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12103993715149226389.bin' '-l' '-1' '-v' '-w' '/tmp/graph12103993715149226389.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:54:24] [INFO ] Decomposing Gal with order
[2025-06-02 07:54:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:54:24] [INFO ] Removed a total of 341 redundant transitions.
[2025-06-02 07:54:24] [INFO ] Flatten gal took : 38 ms
[2025-06-02 07:54:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 7 ms.
[2025-06-02 07:54:24] [INFO ] Time to serialize gal into /tmp/CTLFireability15918333165478353741.gal : 3 ms
[2025-06-02 07:54:24] [INFO ] Time to serialize properties into /tmp/CTLFireability142742898989394249.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/CTLFireability15918333165478353741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability142742898989394249.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,8.43941e+06,1.24377,28844,605,270,38589,5498,430,102193,125,29509,0
Converting to forward existential form...Done !
original formula: (AX(E((((((((i3.u3.p22==1)&&(i2.u7.p35==1))&&((i6.u12.p83==1)&&(i6.u22.p122==1)))&&(((i3.u3.p22==1)&&(i3.u3.p61==1))&&(i7.u29.p141==1)))|...815
=> equivalent forward existential formula: (([((Init * !(!(EX(!(E((((((((i3.u3.p22==1)&&(i2.u7.p35==1))&&((i6.u12.p83==1)&&(i6.u22.p122==1)))&&(((i3.u3.p22...1880
Reverse transition relation is NOT exact ! Due to transitions t26, t60, t90, t91, t94, t97, t173, t174, t175, t176, t187, t188, t189, t190, i1.u2.t87, i1.u...768
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,5.37613,130220,1,0,198454,36520,2755,567666,609,190532,314483
FORMULA MedleyA-PT-08-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 99 transition count 203
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 99 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 99 transition count 201
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 94 transition count 186
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 94 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 92 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 92 transition count 181
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 91 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 91 transition count 178
Applied a total of 68 rules in 12 ms. Remains 91 /124 variables (removed 33) and now considering 178/239 (removed 61) transitions.
// Phase 1: matrix 178 rows 91 cols
[2025-06-02 07:54:30] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:54:30] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-02 07:54:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:54:30] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-06-02 07:54:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:54:32] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:54:32] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/269 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:54:37] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:54:37] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 105 constraints, problems are : Problem set: 0 solved, 177 unsolved in 14315 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/269 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 177/280 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/269 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 282 constraints, problems are : Problem set: 0 solved, 177 unsolved in 22266 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36670ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 36671ms
Starting structural reductions in LTL mode, iteration 1 : 91/124 places, 178/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36987 ms. Remains : 91/124 places, 178/239 transitions.
[2025-06-02 07:55:07] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:55:07] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:55:07] [INFO ] Input system was already deterministic with 178 transitions.
[2025-06-02 07:55:07] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:55:07] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:55:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10892686966980655695.gal : 3 ms
[2025-06-02 07:55:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3838255877348124024.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/CTLFireability10892686966980655695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3838255877348124024.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.5335e+06,1.55057,35264,2,5130,5,98187,6,0,542,153937,0
Converting to forward existential form...Done !
original formula: (EF(!(A((((p98!=1)||(((p22==1)&&(p61==1))&&(p135==1)))||(((p55==1)&&(p22==1))&&(p48==1))) U (p90==1)))) * EX(EX(AX(((((p83==0)||(p122==0)...183
=> equivalent forward existential formula: [(EY(EY((Init * E(TRUE U !(!((E(!((p90==1)) U (!((((p98!=1)||(((p22==1)&&(p61==1))&&(p135==1)))||(((p55==1)&&(p2...285
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...465
Detected timeout of ITS tools.
[2025-06-02 07:55:37] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:55:37] [INFO ] Applying decomposition
[2025-06-02 07:55:37] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15649836292985002688.txt' '-o' '/tmp/graph15649836292985002688.bin' '-w' '/tmp/graph15649836292985002688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15649836292985002688.bin' '-l' '-1' '-v' '-w' '/tmp/graph15649836292985002688.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:55:37] [INFO ] Decomposing Gal with order
[2025-06-02 07:55:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:55:37] [INFO ] Removed a total of 307 redundant transitions.
[2025-06-02 07:55:37] [INFO ] Flatten gal took : 51 ms
[2025-06-02 07:55:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 6 ms.
[2025-06-02 07:55:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14443513508780428225.gal : 3 ms
[2025-06-02 07:55:37] [INFO ] Time to serialize properties into /tmp/CTLFireability1464664790651087255.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/CTLFireability14443513508780428225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1464664790651087255.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.5335e+06,0.331024,12672,380,160,15294,1127,332,34052,109,7944,0
Converting to forward existential form...Done !
original formula: (EF(!(A((((i5.u15.p98!=1)||(((i1.u3.p22==1)&&(i1.u9.p61==1))&&(i7.u23.p135==1)))||(((i1.u9.p55==1)&&(i1.u3.p22==1))&&(i1.u9.p48==1))) U (...261
=> equivalent forward existential formula: [(EY(EY((Init * E(TRUE U !(!((E(!((i5.u14.p90==1)) U (!((((i5.u15.p98!=1)||(((i1.u3.p22==1)&&(i1.u9.p61==1))&&(i...377
Reverse transition relation is NOT exact ! Due to transitions t26, t55, t86, t90, i1.t92, i1.t91, i1.u9.t54, i1.u9.t56, i1.u9.t57, i1.u9.t58, i1.u9.t60, i1...735
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,6.01538,148352,1,0,221983,16451,2120,570201,541,134448,254676
FORMULA MedleyA-PT-08-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Graph (complete) has 441 edges and 124 vertex of which 119 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 118 transition count 219
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 102 transition count 216
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 36 place count 102 transition count 214
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 40 place count 100 transition count 214
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 60 place count 80 transition count 183
Iterating global reduction 2 with 20 rules applied. Total rules applied 80 place count 80 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 80 transition count 182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 79 transition count 182
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 73 transition count 165
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 73 transition count 165
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 120 place count 59 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 59 transition count 152
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 126 place count 54 transition count 141
Iterating global reduction 3 with 5 rules applied. Total rules applied 131 place count 54 transition count 141
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 136 place count 54 transition count 136
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 136 place count 54 transition count 133
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 142 place count 51 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 49 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 48 transition count 130
Applied a total of 147 rules in 76 ms. Remains 48 /124 variables (removed 76) and now considering 130/239 (removed 109) transitions.
// Phase 1: matrix 130 rows 48 cols
[2025-06-02 07:55:43] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:55:43] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 07:55:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:55:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 07:55:43] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:55:43] [INFO ] Redundant transitions in 31 ms returned []
Running 121 sub problems to find dead transitions.
[2025-06-02 07:55:43] [INFO ] Invariant cache hit.
[2025-06-02 07:55:43] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 129/176 variables, 47/53 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 2/178 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/178 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 66 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8113 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 129/176 variables, 47/53 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 118/183 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 2/178 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 187 constraints, problems are : Problem set: 0 solved, 121 unsolved in 12135 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20328ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 20329ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/124 places, 130/239 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20688 ms. Remains : 48/124 places, 130/239 transitions.
[2025-06-02 07:56:04] [INFO ] Flatten gal took : 11 ms
[2025-06-02 07:56:04] [INFO ] Flatten gal took : 11 ms
[2025-06-02 07:56:04] [INFO ] Input system was already deterministic with 130 transitions.
[2025-06-02 07:56:04] [INFO ] Flatten gal took : 11 ms
[2025-06-02 07:56:04] [INFO ] Flatten gal took : 11 ms
[2025-06-02 07:56:04] [INFO ] Time to serialize gal into /tmp/CTLFireability1698750563966619770.gal : 2 ms
[2025-06-02 07:56:04] [INFO ] Time to serialize properties into /tmp/CTLFireability17555719582252307436.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/CTLFireability1698750563966619770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17555719582252307436.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,423174,0.172628,8416,2,778,5,18097,6,0,311,22317,0
Converting to forward existential form...Done !
original formula: EG(AF(((p83==1)&&(p119==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p83==1)&&(p119==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t21, t24, t25, t26, t27, t29, t30...315
(forward)formula 0,0,8.56313,219248,1,0,514,1.29361e+06,287,200,2995,1.27221e+06,619
FORMULA MedleyA-PT-08-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 100 transition count 205
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 100 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 100 transition count 203
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 94 transition count 186
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 94 transition count 186
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 91 transition count 178
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 91 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 90 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 90 transition count 175
Applied a total of 70 rules in 7 ms. Remains 90 /124 variables (removed 34) and now considering 175/239 (removed 64) transitions.
// Phase 1: matrix 175 rows 90 cols
[2025-06-02 07:56:12] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:56:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-02 07:56:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:56:13] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2025-06-02 07:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:56:15] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:56:15] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/265 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:56:19] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:56:20] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/265 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 104 constraints, problems are : Problem set: 0 solved, 174 unsolved in 14144 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/265 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 174/276 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 0/265 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 278 constraints, problems are : Problem set: 0 solved, 174 unsolved in 19176 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 33376ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 33378ms
Starting structural reductions in LTL mode, iteration 1 : 90/124 places, 175/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33576 ms. Remains : 90/124 places, 175/239 transitions.
[2025-06-02 07:56:46] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:56:46] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:56:46] [INFO ] Input system was already deterministic with 175 transitions.
[2025-06-02 07:56:46] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:56:46] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:56:46] [INFO ] Time to serialize gal into /tmp/CTLFireability4370773306207783473.gal : 1 ms
[2025-06-02 07:56:46] [INFO ] Time to serialize properties into /tmp/CTLFireability118103233492996013.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/CTLFireability4370773306207783473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability118103233492996013.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.89377e+06,1.18551,30332,2,4742,5,84910,6,0,535,123438,0
Converting to forward existential form...Done !
original formula: (AG((AG(AF((p55==0))) + (p95==0))) + (EX(EX((p126==1))) * EX(!(E((((p83==1)&&(p122==1))&&(p138==1)) U EF((((p22==1)&&(p32==1))&&((p83==1)...174
=> equivalent forward existential formula: [FwdG(FwdU((FwdU((Init * !((EX(EX((p126==1))) * EX(!(E((((p83==1)&&(p122==1))&&(p138==1)) U E(TRUE U (((p22==1)&...245
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t20, t21, t26, t27, t28, t29, t30, t33...438
Hit Full ! (commute/partial/dont) 164/0/11
(forward)formula 0,1,13.4367,323200,1,0,416,1.61211e+06,390,154,4959,1.51767e+06,465
FORMULA MedleyA-PT-08-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 102 transition count 206
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 102 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 102 transition count 204
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 97 transition count 188
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 97 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 95 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 95 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 94 transition count 180
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 94 transition count 180
Applied a total of 62 rules in 4 ms. Remains 94 /124 variables (removed 30) and now considering 180/239 (removed 59) transitions.
// Phase 1: matrix 180 rows 94 cols
[2025-06-02 07:56:59] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:57:00] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 07:57:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:57:00] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2025-06-02 07:57:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:57:02] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:57:03] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:57:03] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/274 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:57:06] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:57:08] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:57:09] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 110 constraints, problems are : Problem set: 0 solved, 179 unsolved in 14693 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/274 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 179/287 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:57:23] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 290 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44806ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 44808ms
Starting structural reductions in LTL mode, iteration 1 : 94/124 places, 180/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45096 ms. Remains : 94/124 places, 180/239 transitions.
[2025-06-02 07:57:45] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:57:45] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:57:45] [INFO ] Input system was already deterministic with 180 transitions.
[2025-06-02 07:57:45] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:57:45] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:57:45] [INFO ] Time to serialize gal into /tmp/CTLFireability11085067950232137603.gal : 2 ms
[2025-06-02 07:57:45] [INFO ] Time to serialize properties into /tmp/CTLFireability2544039836178276710.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/CTLFireability11085067950232137603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2544039836178276710.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.78097e+06,2.32712,50416,2,6936,5,138837,6,0,556,216448,0
Converting to forward existential form...Done !
original formula: A(AF((p127==1)) U A(((p29==1) + (A(((p116==1)||((p137==1)&&(p140==1))) U (p59!=1)) * EX(((p68==1)||(((p22==1)&&(p32==1))&&((p83==1)&&(p12...183
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(E(TRUE U (p19==1))) U (!(((p29==1) + (!((E(!((p59!=1)) U (!(((p116==1)||((p137==1)&&(p14...906
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t30, t31, t3...470
Detected timeout of ITS tools.
[2025-06-02 07:58:15] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:58:15] [INFO ] Applying decomposition
[2025-06-02 07:58:15] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7948947770501636276.txt' '-o' '/tmp/graph7948947770501636276.bin' '-w' '/tmp/graph7948947770501636276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7948947770501636276.bin' '-l' '-1' '-v' '-w' '/tmp/graph7948947770501636276.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:58:15] [INFO ] Decomposing Gal with order
[2025-06-02 07:58:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:58:15] [INFO ] Removed a total of 323 redundant transitions.
[2025-06-02 07:58:15] [INFO ] Flatten gal took : 23 ms
[2025-06-02 07:58:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2025-06-02 07:58:15] [INFO ] Time to serialize gal into /tmp/CTLFireability11447572113945559327.gal : 2 ms
[2025-06-02 07:58:15] [INFO ] Time to serialize properties into /tmp/CTLFireability526400514898924519.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/CTLFireability11447572113945559327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability526400514898924519.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,6.78097e+06,0.678613,17456,475,135,22887,1017,394,58808,90,8818,0
Converting to forward existential form...Done !
original formula: A(AF((i7.u22.p127==1)) U A(((i2.u8.p29==1) + (A(((i6.u21.p116==1)||((i7.u26.p137==1)&&(i7.u27.p140==1))) U (i3.u12.p59!=1)) * EX(((i4.u14...263
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(E(TRUE U (i3.u2.p19==1))) U (!(((i2.u8.p29==1) + (!((E(!((i3.u12.p59!=1)) U (!(((i6.u21....1210
Reverse transition relation is NOT exact ! Due to transitions t26, t59, t90, t94, i1.u4.t84, i2.t77, i2.t74, i2.t73, i2.u5.t80, i2.u5.t81, i2.u8.t57, i2.u8...788
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,20.8744,500236,1,0,747870,7054,2476,2.15657e+06,438,80260,651682
FORMULA MedleyA-PT-08-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 99 transition count 203
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 99 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 99 transition count 201
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 95 transition count 192
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 95 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 93 transition count 187
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 93 transition count 187
Applied a total of 64 rules in 7 ms. Remains 93 /124 variables (removed 31) and now considering 187/239 (removed 52) transitions.
// Phase 1: matrix 187 rows 93 cols
[2025-06-02 07:58:36] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:58:36] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 07:58:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:58:36] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2025-06-02 07:58:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:58:39] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:58:39] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:58:39] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:58:39] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:58:44] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:58:45] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 109 constraints, problems are : Problem set: 0 solved, 186 unsolved in 15211 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 186/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 295 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45284ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 45284ms
Starting structural reductions in LTL mode, iteration 1 : 93/124 places, 187/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45505 ms. Remains : 93/124 places, 187/239 transitions.
[2025-06-02 07:59:21] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:59:21] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:59:21] [INFO ] Input system was already deterministic with 187 transitions.
[2025-06-02 07:59:21] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:59:21] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:59:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5061315041933514268.gal : 1 ms
[2025-06-02 07:59:21] [INFO ] Time to serialize properties into /tmp/CTLFireability10837347899794351146.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/CTLFireability5061315041933514268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10837347899794351146.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.29758e+06,1.40615,37540,2,5641,5,101995,6,0,559,165948,0
Converting to forward existential form...Done !
original formula: A(E(A(E(((((p83==1)&&(p98==1))&&(p103==1))||(((p22==1)&&(p37==1))&&(p42==1))) U !((((p22==1)&&(p32==1))&&((p76==1)&&(p87==1))))) U AX((((...262
=> equivalent forward existential formula: [((Init * !(EG(!((p121==1))))) * !(E(!((p121==1)) U (!(E(!((E(!(!(EX(!((((p22==1)&&(p61==1))&&((p83==1)&&(p93==1...500
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t30, t31, t3...556
Detected timeout of ITS tools.
[2025-06-02 07:59:51] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:59:51] [INFO ] Applying decomposition
[2025-06-02 07:59:51] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15280513811522139613.txt' '-o' '/tmp/graph15280513811522139613.bin' '-w' '/tmp/graph15280513811522139613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15280513811522139613.bin' '-l' '-1' '-v' '-w' '/tmp/graph15280513811522139613.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:59:51] [INFO ] Decomposing Gal with order
[2025-06-02 07:59:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:59:52] [INFO ] Removed a total of 329 redundant transitions.
[2025-06-02 07:59:52] [INFO ] Flatten gal took : 24 ms
[2025-06-02 07:59:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 6 ms.
[2025-06-02 07:59:52] [INFO ] Time to serialize gal into /tmp/CTLFireability14947456025101331663.gal : 3 ms
[2025-06-02 07:59:52] [INFO ] Time to serialize properties into /tmp/CTLFireability17325318019045154651.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/CTLFireability14947456025101331663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17325318019045154651.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.29758e+06,0.5641,14032,407,262,16261,1689,343,39452,112,17050,0
Converting to forward existential form...Done !
original formula: A(E(A(E(((((i6.u11.p83==1)&&(i5.u15.p98==1))&&(i6.u18.p103==1))||(((i3.u3.p22==1)&&(i2.u5.p37==1))&&(i3.u9.p42==1))) U !((((i3.u3.p22==1)...386
=> equivalent forward existential formula: [((Init * !(EG(!((i6.u18.p121==1))))) * !(E(!((i6.u18.p121==1)) U (!(E(!((E(!(!(EX(!((((i3.u3.p22==1)&&(i3.u9.p6...690
Reverse transition relation is NOT exact ! Due to transitions t26, t61, t89, t93, t163, t164, t165, t166, t177, t178, t179, t180, i1.u4.t85, i2.t78, i2.t75...828
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,15.9171,354084,1,0,506273,25191,2241,1.36226e+06,588,247474,541925
FORMULA MedleyA-PT-08-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 103 transition count 208
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 103 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 103 transition count 207
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 98 transition count 195
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 98 transition count 195
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 96 transition count 189
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 96 transition count 189
Applied a total of 57 rules in 5 ms. Remains 96 /124 variables (removed 28) and now considering 189/239 (removed 50) transitions.
// Phase 1: matrix 189 rows 96 cols
[2025-06-02 08:00:08] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:00:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-02 08:00:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:00:08] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2025-06-02 08:00:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:00:10] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:00:11] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:00:11] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:00:13] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 189/285 variables, 96/110 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:00:18] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:00:21] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:00:23] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (OVERLAPS) 0/285 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 113 constraints, problems are : Problem set: 0 solved, 188 unsolved in 21974 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 189/285 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 188/299 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:00:38] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:00:38] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:00:42] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:00:43] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:00:43] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 306 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 52073ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 52074ms
Starting structural reductions in LTL mode, iteration 1 : 96/124 places, 189/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52339 ms. Remains : 96/124 places, 189/239 transitions.
[2025-06-02 08:01:00] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:01:00] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:01:00] [INFO ] Input system was already deterministic with 189 transitions.
[2025-06-02 08:01:00] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:01:00] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:01:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17104778456318936801.gal : 2 ms
[2025-06-02 08:01:00] [INFO ] Time to serialize properties into /tmp/CTLFireability7806617032848935242.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/CTLFireability17104778456318936801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7806617032848935242.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,7.41015e+06,1.80442,43204,2,7295,5,123875,6,0,573,181878,0
Converting to forward existential form...Done !
original formula: (EF((p117==1)) + (AF(EX((AF((p131==1)) * EF((p80==1))))) * (AG(AX((p75!=1))) + (AX((p105==1)) * (EX(TRUE) + EG((p106!=1)))))))
=> equivalent forward existential formula: ([FwdG((Init * !(E(TRUE U (p117==1)))),!(EX((!(EG(!((p131==1)))) * E(TRUE U (p80==1))))))] = FALSE * ([(EY(((Ini...374
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t31, t32, t3...509
Detected timeout of ITS tools.
[2025-06-02 08:01:30] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:01:30] [INFO ] Applying decomposition
[2025-06-02 08:01:30] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3879804423850373218.txt' '-o' '/tmp/graph3879804423850373218.bin' '-w' '/tmp/graph3879804423850373218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3879804423850373218.bin' '-l' '-1' '-v' '-w' '/tmp/graph3879804423850373218.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:01:30] [INFO ] Decomposing Gal with order
[2025-06-02 08:01:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:01:30] [INFO ] Removed a total of 330 redundant transitions.
[2025-06-02 08:01:30] [INFO ] Flatten gal took : 24 ms
[2025-06-02 08:01:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 5 ms.
[2025-06-02 08:01:30] [INFO ] Time to serialize gal into /tmp/CTLFireability12745348844917788261.gal : 4 ms
[2025-06-02 08:01:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15998384960567942482.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/CTLFireability12745348844917788261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15998384960567942482.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.41015e+06,0.482358,17188,487,113,22053,981,393,63815,100,5087,0
Converting to forward existential form...Done !
original formula: (EF((i6.u20.p117==1)) + (AF(EX((AF((i7.i0.u23.p131==1)) * EF((i6.u13.p80==1))))) * (AG(AX((i4.u12.p75!=1))) + (AX((i6.u19.p105==1)) * (EX...189
=> equivalent forward existential formula: ([FwdG((Init * !(E(TRUE U (i6.u20.p117==1)))),!(EX((!(EG(!((i7.i0.u23.p131==1)))) * E(TRUE U (i6.u13.p80==1)))))...440
Reverse transition relation is NOT exact ! Due to transitions t26, t68, t93, t99, t169, t170, t171, t172, i1.u4.t89, i2.t82, i2.t79, i2.t78, i2.u5.t66, i2....834
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,21.1259,460048,1,0,620613,6414,2371,2.14765e+06,484,62767,621607
FORMULA MedleyA-PT-08-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Graph (complete) has 441 edges and 124 vertex of which 119 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 118 transition count 219
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 102 transition count 216
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 36 place count 102 transition count 214
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 40 place count 100 transition count 214
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 60 place count 80 transition count 183
Iterating global reduction 2 with 20 rules applied. Total rules applied 80 place count 80 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 80 place count 80 transition count 181
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 84 place count 78 transition count 181
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 90 place count 72 transition count 164
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 72 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 71 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 71 transition count 162
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 124 place count 57 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 57 transition count 149
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 131 place count 51 transition count 135
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 51 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 142 place count 51 transition count 130
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 142 place count 51 transition count 127
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 place count 48 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 47 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 46 transition count 125
Applied a total of 151 rules in 64 ms. Remains 46 /124 variables (removed 78) and now considering 125/239 (removed 114) transitions.
// Phase 1: matrix 125 rows 46 cols
[2025-06-02 08:01:51] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:01:52] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-02 08:01:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:01:52] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 08:01:52] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:01:52] [INFO ] Redundant transitions in 27 ms returned []
Running 117 sub problems to find dead transitions.
[2025-06-02 08:01:52] [INFO ] Invariant cache hit.
[2025-06-02 08:01:52] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 124/169 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 2/171 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 64 constraints, problems are : Problem set: 0 solved, 117 unsolved in 7642 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 124/169 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 114/177 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 2/171 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (OVERLAPS) 0/171 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 181 constraints, problems are : Problem set: 0 solved, 117 unsolved in 13027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20720ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 20720ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/124 places, 125/239 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20994 ms. Remains : 46/124 places, 125/239 transitions.
[2025-06-02 08:02:12] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:02:12] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:02:12] [INFO ] Input system was already deterministic with 125 transitions.
[2025-06-02 08:02:12] [INFO ] Flatten gal took : 4 ms
[2025-06-02 08:02:12] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:02:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10820164396956551305.gal : 1 ms
[2025-06-02 08:02:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5758270087635196643.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10820164396956551305.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5758270087635196643.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (5096 resets) in 426 ms. (93 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality5758270087635196643.prop.
BEST_FIRST walk for 40003 steps (965 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :108 after 152
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :152 after 213
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :213 after 1143
Finished probabilistic random walk after 1381 steps, run visited all 1 properties in 13 ms. (steps per millisecond=106 )
Probabilistic random walk after 1381 steps, saw 419 distinct states, run finished after 13 ms. (steps per millisecond=106 ) properties seen :1
FORMULA MedleyA-PT-08-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1143 after 4334
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 101 transition count 206
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 101 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 101 transition count 204
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 95 transition count 187
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 95 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 93 transition count 182
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 93 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 92 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 92 transition count 179
Applied a total of 66 rules in 4 ms. Remains 92 /124 variables (removed 32) and now considering 179/239 (removed 60) transitions.
// Phase 1: matrix 179 rows 92 cols
[2025-06-02 08:02:13] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:02:13] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 08:02:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:02:13] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2025-06-02 08:02:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:15] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:15] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 179/271 variables, 92/104 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:20] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:20] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:24] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 107 constraints, problems are : Problem set: 0 solved, 178 unsolved in 16741 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 179/271 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 178/283 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:33] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:37] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:40] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:45] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/271 variables, and 289 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 46811ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 46812ms
Starting structural reductions in LTL mode, iteration 1 : 92/124 places, 179/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47028 ms. Remains : 92/124 places, 179/239 transitions.
[2025-06-02 08:03:00] [INFO ] Flatten gal took : 4 ms
[2025-06-02 08:03:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:03:00] [INFO ] Input system was already deterministic with 179 transitions.
[2025-06-02 08:03:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:03:00] [INFO ] Flatten gal took : 4 ms
[2025-06-02 08:03:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14347917376219409753.gal : 1 ms
[2025-06-02 08:03:00] [INFO ] Time to serialize properties into /tmp/CTLFireability12662935385238662417.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/CTLFireability14347917376219409753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12662935385238662417.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.43217e+06,1.23485,36004,2,5397,5,101228,6,0,547,151831,0
Converting to forward existential form...Done !
original formula: AX(((EG(((p95==0)&&(((p15==0)||(p26==0))||(p135==0)))) * EX(((EF((p142==1)) + (p8==0)) + ((p27==0)||(p124==1))))) * E(EF((p45==1)) U EX((...166
=> equivalent forward existential formula: (([(EY(Init) * !(EG(((p95==0)&&(((p15==0)||(p26==0))||(p135==0))))))] = FALSE * [(EY(Init) * !(EX(((E(TRUE U (p1...277
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t20, t21, t26, t27, t28, t29, t30, t33...463
Detected timeout of ITS tools.
[2025-06-02 08:03:30] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:03:30] [INFO ] Applying decomposition
[2025-06-02 08:03:30] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18170915236741996069.txt' '-o' '/tmp/graph18170915236741996069.bin' '-w' '/tmp/graph18170915236741996069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18170915236741996069.bin' '-l' '-1' '-v' '-w' '/tmp/graph18170915236741996069.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:03:30] [INFO ] Decomposing Gal with order
[2025-06-02 08:03:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:03:30] [INFO ] Removed a total of 293 redundant transitions.
[2025-06-02 08:03:30] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:03:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 2 ms.
[2025-06-02 08:03:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10637186604183865099.gal : 2 ms
[2025-06-02 08:03:30] [INFO ] Time to serialize properties into /tmp/CTLFireability7905837105977611389.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/CTLFireability10637186604183865099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7905837105977611389.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.43217e+06,0.36928,14396,440,155,18333,831,353,42251,107,6332,0
Converting to forward existential form...Done !
original formula: AX(((EG(((i5.u15.p95==0)&&(((i2.u3.p15==0)||(i2.u4.p26==0))||(i7.u23.p135==0)))) * EX(((EF((i7.u25.p142==1)) + (i2.u3.p8==0)) + ((i2.u4.p...230
=> equivalent forward existential formula: (([(EY(Init) * !(EG(((i5.u15.p95==0)&&(((i2.u3.p15==0)||(i2.u4.p26==0))||(i7.u23.p135==0))))))] = FALSE * [(EY(I...341
Reverse transition relation is NOT exact ! Due to transitions t28, t57, t88, t93, i1.u8.t56, i1.u8.t58, i1.u8.t59, i1.u8.t60, i1.u8.t61, i1.u8.t62, i1.u8.t...773
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,8.18566,206012,1,0,318926,10489,2142,808880,543,99343,366198
FORMULA MedleyA-PT-08-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 239/239 transitions.
Graph (complete) has 441 edges and 124 vertex of which 119 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 118 transition count 223
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 106 transition count 221
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 27 place count 106 transition count 219
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 31 place count 104 transition count 219
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 54 place count 81 transition count 185
Iterating global reduction 2 with 23 rules applied. Total rules applied 77 place count 81 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 81 transition count 184
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 84 place count 75 transition count 167
Iterating global reduction 3 with 6 rules applied. Total rules applied 90 place count 75 transition count 167
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 73 transition count 162
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 73 transition count 162
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 72 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 72 transition count 159
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 120 place count 59 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 59 transition count 147
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 125 place count 55 transition count 139
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 55 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 134 place count 55 transition count 134
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 134 place count 55 transition count 131
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 140 place count 52 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 144 place count 50 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 49 transition count 128
Applied a total of 145 rules in 26 ms. Remains 49 /124 variables (removed 75) and now considering 128/239 (removed 111) transitions.
// Phase 1: matrix 128 rows 49 cols
[2025-06-02 08:03:38] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:03:38] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-02 08:03:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:03:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 08:03:38] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:03:38] [INFO ] Redundant transitions in 24 ms returned []
Running 118 sub problems to find dead transitions.
[2025-06-02 08:03:38] [INFO ] Invariant cache hit.
[2025-06-02 08:03:38] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 4/48 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 127/175 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 2/177 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 67 constraints, problems are : Problem set: 0 solved, 118 unsolved in 7713 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 49/49 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 4/48 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 127/175 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 115/181 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 2/177 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/177 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 185 constraints, problems are : Problem set: 0 solved, 118 unsolved in 14467 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 49/49 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22236ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 22237ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/124 places, 128/239 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22483 ms. Remains : 49/124 places, 128/239 transitions.
[2025-06-02 08:04:00] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:04:00] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:04:01] [INFO ] Input system was already deterministic with 128 transitions.
[2025-06-02 08:04:01] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:04:01] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:04:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2931651206624519941.gal : 2 ms
[2025-06-02 08:04:01] [INFO ] Time to serialize properties into /tmp/CTLFireability13879932421291244503.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/CTLFireability2931651206624519941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13879932421291244503.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,659412,0.20502,7664,2,335,5,15401,6,0,314,17744,0
Converting to forward existential form...Done !
original formula: EF(EG((((p22==0)||(p35==0))||((p83==0)||(p122==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((p22==0)||(p35==0))||((p83==0)||(p122==0))))] != FALSE
Hit Full ! (commute/partial/dont) 47/0/81
(forward)formula 0,1,0.598732,13808,1,0,9,50382,19,3,2228,50948,8
FORMULA MedleyA-PT-08-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2025-06-02 08:04:01] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:04:01] [INFO ] Flatten gal took : 6 ms
Total runtime 1204964 ms.
BK_STOP 1748851441711
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-08"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-08, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524000154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-08.tgz
mv MedleyA-PT-08 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 ;