About the Execution of ITS-Tools for FireWire-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1904508.00 | 0.00 | 0.00 | TTFTFFTTFFTFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102200298.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 FireWire-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102200298
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 97K 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 FireWire-PT-08-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-15
FORMULA_NAME FireWire-PT-08-CTLFireability-2025-00
FORMULA_NAME FireWire-PT-08-CTLFireability-2025-01
FORMULA_NAME FireWire-PT-08-CTLFireability-2025-02
FORMULA_NAME FireWire-PT-08-CTLFireability-2025-03
FORMULA_NAME FireWire-PT-08-CTLFireability-2025-04
FORMULA_NAME FireWire-PT-08-CTLFireability-2025-05
FORMULA_NAME FireWire-PT-08-CTLFireability-2025-06
FORMULA_NAME FireWire-PT-08-CTLFireability-2025-07
FORMULA_NAME FireWire-PT-08-CTLFireability-2025-08
FORMULA_NAME FireWire-PT-08-CTLFireability-2025-09
FORMULA_NAME FireWire-PT-08-CTLFireability-2025-10
FORMULA_NAME FireWire-PT-08-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748854274136
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 08:51:16] [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 08:51:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 08:51:17] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2025-06-02 08:51:17] [INFO ] Transformed 127 places.
[2025-06-02 08:51:17] [INFO ] Transformed 397 transitions.
[2025-06-02 08:51:17] [INFO ] Found NUPN structural information;
[2025-06-02 08:51:17] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 36 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 92 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 344/344 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 127 transition count 338
Applied a total of 6 rules in 53 ms. Remains 127 /127 variables (removed 0) and now considering 338/344 (removed 6) transitions.
[2025-06-02 08:51:17] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
// Phase 1: matrix 312 rows 127 cols
[2025-06-02 08:51:17] [INFO ] Computed 8 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:51:18] [INFO ] Implicit Places using invariants in 536 ms returned []
[2025-06-02 08:51:18] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2025-06-02 08:51:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:51:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-02 08:51:18] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
Running 337 sub problems to find dead transitions.
[2025-06-02 08:51:18] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2025-06-02 08:51:18] [INFO ] Invariant cache hit.
[2025-06-02 08:51:18] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:51:27] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:51:27] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:51:27] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:51:28] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:51:28] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:51:29] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:51:29] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 7/142 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (OVERLAPS) 311/438 variables, 127/269 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 44/313 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 9 (OVERLAPS) 1/439 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 337 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 Real declared 439/439 variables, and 314 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30063 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 7/142 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (OVERLAPS) 311/438 variables, 127/269 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 44/313 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 337/650 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/439 variables, and 650 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30036 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60734ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60769ms
Starting structural reductions in LTL mode, iteration 1 : 127/127 places, 338/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62069 ms. Remains : 127/127 places, 338/344 transitions.
Support contains 92 out of 127 places after structural reductions.
[2025-06-02 08:52:20] [INFO ] Flatten gal took : 117 ms
[2025-06-02 08:52:20] [INFO ] Flatten gal took : 64 ms
[2025-06-02 08:52:20] [INFO ] Input system was already deterministic with 338 transitions.
Support contains 90 out of 127 places (down from 92) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 96 to 90
RANDOM walk for 40000 steps (2233 resets) in 2403 ms. (16 steps per ms) remains 46/90 properties
BEST_FIRST walk for 4004 steps (61 resets) in 62 ms. (63 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (9 resets) in 49 ms. (80 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (108 resets) in 61 ms. (64 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (57 resets) in 40 ms. (97 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (52 resets) in 35 ms. (111 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (59 resets) in 52 ms. (75 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (111 resets) in 36 ms. (108 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (10 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (65 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (9 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (102 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (15 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (11 resets) in 43 ms. (90 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (63 resets) in 51 ms. (77 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (66 resets) in 42 ms. (93 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (59 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (23 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (109 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (61 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (56 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (96 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (97 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (13 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (57 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (50 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (111 resets) in 21 ms. (182 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (52 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (9 resets) in 35 ms. (111 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (48 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (64 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (68 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (55 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (103 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (62 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (70 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (156 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (64 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
[2025-06-02 08:52:21] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2025-06-02 08:52:21] [INFO ] Invariant cache hit.
[2025-06-02 08:52:21] [INFO ] State equation strengthened by 45 read => feed constraints.
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/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp85 is UNSAT
At refinement iteration 2 (OVERLAPS) 62/120 variables, 6/64 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 62/126 constraints. Problems are: Problem set: 8 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:22] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:22] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:22] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:22] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 4/130 constraints. Problems are: Problem set: 8 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:23] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/131 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/131 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 4/124 variables, 2/133 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 4/137 constraints. Problems are: Problem set: 8 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:24] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 2/139 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/139 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 311/435 variables, 124/263 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 44/307 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 0/307 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 14 (OVERLAPS) 3/438 variables, 3/310 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 3/313 constraints. Problems are: Problem set: 8 solved, 37 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/439 variables, and 313 constraints, problems are : Problem set: 8 solved, 37 unsolved in 5010 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 37 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 77/120 variables, 6/49 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 77/126 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 5/131 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/131 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 4/124 variables, 2/133 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 4/137 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 2/139 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/139 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 311/435 variables, 124/263 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 44/307 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 34/341 constraints. Problems are: Problem set: 8 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:29] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 1/342 constraints. Problems are: Problem set: 8 solved, 37 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/439 variables, and 342 constraints, problems are : Problem set: 8 solved, 37 unsolved in 5018 ms.
Refiners :[Domain max(s): 124/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/127 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 34/45 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10103ms problems are : Problem set: 8 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 338/338 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 335
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 124 transition count 328
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 124 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 124 transition count 326
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 123 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 123 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 122 transition count 323
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 119 transition count 329
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 27 place count 119 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 30 place count 119 transition count 320
Applied a total of 30 rules in 88 ms. Remains 119 /127 variables (removed 8) and now considering 320/338 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 119/127 places, 320/338 transitions.
RANDOM walk for 40000 steps (2196 resets) in 957 ms. (41 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4004 steps (60 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (100 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (47 resets) in 16 ms. (235 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4002 steps (109 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (51 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (14 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (97 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (11 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (58 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (50 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (47 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (117 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (113 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (17 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (52 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (52 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (103 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (47 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (53 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (52 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (58 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (52 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (61 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (60 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (45 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
[2025-06-02 08:52:32] [INFO ] Flow matrix only has 292 transitions (discarded 28 similar events)
// Phase 1: matrix 292 rows 119 cols
[2025-06-02 08:52:32] [INFO ] Computed 8 invariants in 4 ms
[2025-06-02 08:52:32] [INFO ] State equation strengthened by 45 read => feed constraints.
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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 75/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:32] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:33] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:33] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 4/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 292/408 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 45/172 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 3/411 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:35] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 25 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/411 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 176 constraints, problems are : Problem set: 0 solved, 33 unsolved in 4413 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 75/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 4/116 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:37] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:37] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 292/408 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 45/175 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 31/206 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:39] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 3/411 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/411 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (OVERLAPS) 0/411 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 212 constraints, problems are : Problem set: 0 solved, 33 unsolved in 12471 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16916ms problems are : Problem set: 0 solved, 33 unsolved
Parikh walk visited 5 properties in 3563 ms.
Support contains 33 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 320/320 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 118 transition count 317
Applied a total of 3 rules in 25 ms. Remains 118 /119 variables (removed 1) and now considering 317/320 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 118/119 places, 317/320 transitions.
RANDOM walk for 40000 steps (2129 resets) in 338 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (60 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (103 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (106 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (57 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (10 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (105 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (55 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (54 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (113 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (96 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (12 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (63 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (45 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (10 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (53 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (63 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (61 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (50 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (53 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (57 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (49 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 414399 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :14 out of 28
Probabilistic random walk after 414399 steps, saw 99874 distinct states, run finished after 3010 ms. (steps per millisecond=137 ) properties seen :14
[2025-06-02 08:52:56] [INFO ] Flow matrix only has 289 transitions (discarded 28 similar events)
// Phase 1: matrix 289 rows 118 cols
[2025-06-02 08:52:56] [INFO ] Computed 8 invariants in 3 ms
[2025-06-02 08:52:56] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 74/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 25/115 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:56] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:56] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 289/404 variables, 115/125 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/407 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/407 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 173 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1640 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 74/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 25/115 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:52:58] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 289/404 variables, 115/126 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 14/185 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 3/407 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/407 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 188 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3772 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5428ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 10548 ms.
Support contains 16 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 317/317 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 116 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 116 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 115 transition count 311
Applied a total of 5 rules in 36 ms. Remains 115 /118 variables (removed 3) and now considering 311/317 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 115/118 places, 311/317 transitions.
RANDOM walk for 40000 steps (2301 resets) in 229 ms. (173 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (592 resets) in 93 ms. (425 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1110 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1104 resets) in 51 ms. (769 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (74 resets) in 45 ms. (869 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (570 resets) in 58 ms. (678 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (73 resets) in 44 ms. (888 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (552 resets) in 49 ms. (800 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1121 resets) in 60 ms. (655 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (611 resets) in 59 ms. (666 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (579 resets) in 48 ms. (816 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (542 resets) in 50 ms. (784 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (596 resets) in 57 ms. (689 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (555 resets) in 49 ms. (800 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (74 resets) in 45 ms. (869 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 369843 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 14
Probabilistic random walk after 369843 steps, saw 88726 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2025-06-02 08:53:15] [INFO ] Flow matrix only has 283 transitions (discarded 28 similar events)
// Phase 1: matrix 283 rows 115 cols
[2025-06-02 08:53:15] [INFO ] Computed 8 invariants in 8 ms
[2025-06-02 08:53:15] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 71/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 258/345 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 32/123 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 50/395 variables, 26/149 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 11/163 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 3/398 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/398 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 166 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 71/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 258/345 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 32/123 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 50/395 variables, 26/151 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 11/165 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 12/177 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 3/398 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/398 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 180 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3398 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4933ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 9107 ms.
Support contains 16 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 311/311 transitions.
Applied a total of 0 rules in 12 ms. Remains 115 /115 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 115/115 places, 311/311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 311/311 transitions.
Applied a total of 0 rules in 11 ms. Remains 115 /115 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2025-06-02 08:53:29] [INFO ] Flow matrix only has 283 transitions (discarded 28 similar events)
[2025-06-02 08:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:53:29] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-02 08:53:29] [INFO ] Flow matrix only has 283 transitions (discarded 28 similar events)
[2025-06-02 08:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:53:30] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 08:53:30] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:53:30] [INFO ] Redundant transitions in 21 ms returned []
Running 309 sub problems to find dead transitions.
[2025-06-02 08:53:30] [INFO ] Flow matrix only has 283 transitions (discarded 28 similar events)
[2025-06-02 08:53:30] [INFO ] Invariant cache hit.
[2025-06-02 08:53:30] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:53:31] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:53:31] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:53:32] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:53:32] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:53:32] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:53:32] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:53:33] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 283/397 variables, 114/129 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 43/172 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:53:42] [INFO ] Deduced a trap composed of 15 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 08:53:43] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/398 variables, and 175 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 283/397 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 43/174 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 309/483 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:54:07] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 309 unsolved
SMT process timed out in 60169ms, After SMT, problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60628 ms. Remains : 115/115 places, 311/311 transitions.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2025-06-02 08:54:30] [INFO ] Flatten gal took : 26 ms
[2025-06-02 08:54:30] [INFO ] Flatten gal took : 27 ms
[2025-06-02 08:54:30] [INFO ] Input system was already deterministic with 338 transitions.
Computed a total of 23 stabilizing places and 48 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 122 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 119 transition count 317
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 119 transition count 317
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 118 transition count 316
Applied a total of 20 rules in 34 ms. Remains 118 /127 variables (removed 9) and now considering 316/338 (removed 22) transitions.
[2025-06-02 08:54:30] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
// Phase 1: matrix 290 rows 118 cols
[2025-06-02 08:54:30] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:54:30] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 08:54:30] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2025-06-02 08:54:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:54:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 08:54:31] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:54:31] [INFO ] Redundant transitions in 6 ms returned []
Running 315 sub problems to find dead transitions.
[2025-06-02 08:54:31] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2025-06-02 08:54:31] [INFO ] Invariant cache hit.
[2025-06-02 08:54:31] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:54:35] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:54:36] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:54:36] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:54:36] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:54:37] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:54:37] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:54:38] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/407 variables, 118/133 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 1/408 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 175 constraints, problems are : Problem set: 0 solved, 315 unsolved in 28488 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/407 variables, 118/133 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 315/489 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/408 variables, and 489 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58668ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 58670ms
Starting structural reductions in SI_CTL mode, iteration 1 : 118/127 places, 316/338 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59118 ms. Remains : 118/127 places, 316/338 transitions.
[2025-06-02 08:55:29] [INFO ] Flatten gal took : 35 ms
[2025-06-02 08:55:29] [INFO ] Flatten gal took : 32 ms
[2025-06-02 08:55:29] [INFO ] Input system was already deterministic with 316 transitions.
[2025-06-02 08:55:29] [INFO ] Flatten gal took : 29 ms
[2025-06-02 08:55:29] [INFO ] Flatten gal took : 28 ms
[2025-06-02 08:55:29] [INFO ] Time to serialize gal into /tmp/CTLFireability10757948963965583964.gal : 15 ms
[2025-06-02 08:55:30] [INFO ] Time to serialize properties into /tmp/CTLFireability8307603352742468688.ctl : 8 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/CTLFireability10757948963965583964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8307603352742468688.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00398e+07,1.3815,30172,2,2177,5,91329,6,0,787,97442,0
Converting to forward existential form...Done !
original formula: !(E(((!(AG((((p3==1)&&(p89==1))&&(p26==1)))) + EF(!(((p9==1)&&(p89==1))))) + (A(((p49==1)||((p6==1)&&(p51==1))) U !(((p10==1)&&(p86==1)))...288
=> equivalent forward existential formula: [(FwdU(FwdU(FwdU(Init,((!(!(E(TRUE U !((((p3==1)&&(p89==1))&&(p26==1)))))) + E(TRUE U !(((p9==1)&&(p89==1))))) +...431
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...679
Hit Full ! (commute/partial/dont) 301/14/15
(forward)formula 0,0,27.4415,626372,1,0,818,3.29424e+06,688,412,7125,3.86712e+06,933
FORMULA FireWire-PT-08-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 123 transition count 328
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 123 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 123 transition count 326
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 121 transition count 322
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 121 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 120 transition count 321
Applied a total of 16 rules in 27 ms. Remains 120 /127 variables (removed 7) and now considering 321/338 (removed 17) transitions.
[2025-06-02 08:55:57] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 120 cols
[2025-06-02 08:55:57] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:55:57] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-02 08:55:57] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2025-06-02 08:55:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:55:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 08:55:58] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:55:58] [INFO ] Redundant transitions in 5 ms returned []
Running 320 sub problems to find dead transitions.
[2025-06-02 08:55:58] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2025-06-02 08:55:58] [INFO ] Invariant cache hit.
[2025-06-02 08:55:58] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:56:03] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:56:03] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:56:03] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:56:03] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:56:03] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:56:04] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:56:05] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 294/414 variables, 120/135 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 1/415 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/415 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 178 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 294/414 variables, 120/135 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 320/497 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/415 variables, and 497 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in SI_CTL mode, iteration 1 : 120/127 places, 321/338 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60579 ms. Remains : 120/127 places, 321/338 transitions.
[2025-06-02 08:56:58] [INFO ] Flatten gal took : 18 ms
[2025-06-02 08:56:58] [INFO ] Flatten gal took : 18 ms
[2025-06-02 08:56:58] [INFO ] Input system was already deterministic with 321 transitions.
[2025-06-02 08:56:58] [INFO ] Flatten gal took : 14 ms
[2025-06-02 08:56:58] [INFO ] Flatten gal took : 14 ms
[2025-06-02 08:56:58] [INFO ] Time to serialize gal into /tmp/CTLFireability18233997719943960092.gal : 7 ms
[2025-06-02 08:56:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15777091917582880231.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/CTLFireability18233997719943960092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15777091917582880231.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00815e+07,1.35578,32448,2,2355,5,98863,6,0,800,104806,0
Converting to forward existential form...Done !
original formula: EF((((p8==1)&&(p36==1)) * (((A(((p5==1)&&(p15==1)) U ((p6==1)&&(p30==1))) * (p49==1)) * ((p5!=1)||(p108!=1))) + (AG(((p9==1)&&(p83==1))) ...181
=> equivalent forward existential formula: ([(((((FwdU(Init,TRUE) * ((p8==1)&&(p36==1))) * ((p5!=1)||(p108!=1))) * (p49==1)) * !(EG(!(((p6==1)&&(p30==1))))...370
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t12, t13, t15, t16, t17, t19, t21, t25, t26, t28, t29, t30, t32, t34,...691
Detected timeout of ITS tools.
[2025-06-02 08:57:28] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:57:28] [INFO ] Applying decomposition
[2025-06-02 08:57:28] [INFO ] Flatten gal took : 15 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/graph5741085355498711540.txt' '-o' '/tmp/graph5741085355498711540.bin' '-w' '/tmp/graph5741085355498711540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5741085355498711540.bin' '-l' '-1' '-v' '-w' '/tmp/graph5741085355498711540.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:57:28] [INFO ] Decomposing Gal with order
[2025-06-02 08:57:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:57:28] [INFO ] Removed a total of 506 redundant transitions.
[2025-06-02 08:57:28] [INFO ] Flatten gal took : 91 ms
[2025-06-02 08:57:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 34 ms.
[2025-06-02 08:57:28] [INFO ] Time to serialize gal into /tmp/CTLFireability3497504863901199402.gal : 12 ms
[2025-06-02 08:57:28] [INFO ] Time to serialize properties into /tmp/CTLFireability651347092497710283.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/CTLFireability3497504863901199402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability651347092497710283.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00815e+07,4.11484,94504,1530,137,153762,2913,665,431814,84,20283,0
Converting to forward existential form...Done !
original formula: EF((((i3.u2.p8==1)&&(i2.u11.p36==1)) * (((A(((i1.u1.p5==1)&&(i1.u5.p15==1)) U ((i5.i1.u36.p6==1)&&(i2.u11.p30==1))) * (i3.u16.p49==1)) * ...279
=> equivalent forward existential formula: ([(((((FwdU(Init,TRUE) * ((i3.u2.p8==1)&&(i2.u11.p36==1))) * ((i1.u1.p5!=1)||(i5.i2.u35.p108!=1))) * (i3.u16.p49...515
Reverse transition relation is NOT exact ! Due to transitions t7, t43, t45, t46, t49, t50, t52, t60, t65, t70, t75, t80, t95, t98, t100, t137, t138, t139, ...876
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,12.7128,251176,1,0,375711,2913,3289,1.44611e+06,345,20283,609136
FORMULA FireWire-PT-08-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 118 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 107 transition count 288
Applied a total of 43 rules in 24 ms. Remains 107 /127 variables (removed 20) and now considering 288/338 (removed 50) transitions.
[2025-06-02 08:57:41] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
// Phase 1: matrix 262 rows 107 cols
[2025-06-02 08:57:41] [INFO ] Computed 8 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:57:41] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-02 08:57:41] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2025-06-02 08:57:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:57:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 08:57:42] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-02 08:57:42] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2025-06-02 08:57:42] [INFO ] Invariant cache hit.
[2025-06-02 08:57:42] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:57:46] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:57:46] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:57:46] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:57:47] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:57:47] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:57:48] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 159 constraints, problems are : Problem set: 0 solved, 287 unsolved in 29585 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
SMT process timed out in 59698ms, After SMT, problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 59700ms
Starting structural reductions in LTL mode, iteration 1 : 107/127 places, 288/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60308 ms. Remains : 107/127 places, 288/338 transitions.
[2025-06-02 08:58:41] [INFO ] Flatten gal took : 21 ms
[2025-06-02 08:58:42] [INFO ] Flatten gal took : 23 ms
[2025-06-02 08:58:42] [INFO ] Input system was already deterministic with 288 transitions.
[2025-06-02 08:58:42] [INFO ] Flatten gal took : 21 ms
[2025-06-02 08:58:42] [INFO ] Flatten gal took : 21 ms
[2025-06-02 08:58:42] [INFO ] Time to serialize gal into /tmp/CTLFireability14011262491840845289.gal : 5 ms
[2025-06-02 08:58:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6567148214684779164.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/CTLFireability14011262491840845289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6567148214684779164.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13746e+07,7.74161,162076,2,6093,5,443377,6,0,715,562005,0
Converting to forward existential form...Done !
original formula: AG((AX(((p8==1)&&(p100==1))) + EF(AX(AF(((p8==0)||(p60==0)))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(!(EG(!(((p8==0)||(p60==0)))))))))))) * !(((p8==1)&&(p100==1))))] = FAL...157
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...618
(forward)formula 0,1,11.4692,164168,1,0,524,652036,603,270,6200,611693,597
FORMULA FireWire-PT-08-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 325
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 121 transition count 322
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 119 transition count 318
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 119 transition count 318
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 1 with 2 rules applied. Total rules applied 19 place count 118 transition count 317
Applied a total of 19 rules in 36 ms. Remains 118 /127 variables (removed 9) and now considering 317/338 (removed 21) transitions.
[2025-06-02 08:58:53] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
// Phase 1: matrix 291 rows 118 cols
[2025-06-02 08:58:53] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:58:53] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 08:58:53] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2025-06-02 08:58:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:58:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-02 08:58:54] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:58:54] [INFO ] Redundant transitions in 2 ms returned []
Running 314 sub problems to find dead transitions.
[2025-06-02 08:58:54] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2025-06-02 08:58:54] [INFO ] Invariant cache hit.
[2025-06-02 08:58:54] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:58:55] [INFO ] Deduced a trap composed of 34 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 08:58:56] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:58:56] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:58:56] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:58:56] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:58:56] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:58:57] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:58:58] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 20 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 290/407 variables, 117/133 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:59:08] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 1/408 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 408/409 variables, and 176 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 290/407 variables, 117/134 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 314/489 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 1/408 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/409 variables, and 490 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in SI_CTL mode, iteration 1 : 118/127 places, 317/338 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60533 ms. Remains : 118/127 places, 317/338 transitions.
[2025-06-02 08:59:54] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:59:54] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:59:54] [INFO ] Input system was already deterministic with 317 transitions.
[2025-06-02 08:59:54] [INFO ] Flatten gal took : 11 ms
[2025-06-02 08:59:54] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:59:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15748380684311963243.gal : 4 ms
[2025-06-02 08:59:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12863140631778024640.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/CTLFireability15748380684311963243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12863140631778024640.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,9.53739e+06,0.69869,17052,2,2026,5,49482,6,0,788,43551,0
Converting to forward existential form...Done !
original formula: E(EG(!((E(A((p112==1) U ((p9==1)&&(p79==1))) U EG(((p67==1)&&(p104==1)))) + AG(!(((p10==1)&&(p46==1))))))) U E(((AF(EG(((p8==1)&&(p54==1)...264
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EG(!((E(!((E(!(((p9==1)&&(p79==1))) U (!((p112==1)) * !(((p9==1)&&(p79==1))))) + EG(!(((p9==1)&...414
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33,...684
Detected timeout of ITS tools.
[2025-06-02 09:00:24] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:00:24] [INFO ] Applying decomposition
[2025-06-02 09:00:24] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8719835225047635481.txt' '-o' '/tmp/graph8719835225047635481.bin' '-w' '/tmp/graph8719835225047635481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8719835225047635481.bin' '-l' '-1' '-v' '-w' '/tmp/graph8719835225047635481.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:00:24] [INFO ] Decomposing Gal with order
[2025-06-02 09:00:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:00:24] [INFO ] Removed a total of 497 redundant transitions.
[2025-06-02 09:00:24] [INFO ] Flatten gal took : 50 ms
[2025-06-02 09:00:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 26 ms.
[2025-06-02 09:00:24] [INFO ] Time to serialize gal into /tmp/CTLFireability3781199693654540914.gal : 7 ms
[2025-06-02 09:00:24] [INFO ] Time to serialize properties into /tmp/CTLFireability18386901621925003294.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/CTLFireability3781199693654540914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18386901621925003294.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.53739e+06,3.24931,63300,1190,131,75193,2024,653,321903,81,16047,0
Converting to forward existential form...Done !
original formula: E(EG(!((E(A((i0.u38.p112==1) U ((i1.i1.u3.p9==1)&&(i0.u25.p79==1))) U EG(((i6.i0.u21.p67==1)&&(i6.i1.u36.p104==1)))) + AG(!(((i1.i1.u3.p1...395
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EG(!((E(!((E(!(((i1.i1.u3.p9==1)&&(i0.u25.p79==1))) U (!((i0.u38.p112==1)) * !(((i1.i1.u3.p9==1...577
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t42, t44, t45, t48, t49, t51, t59, t64, t69, t74, t79, t83, t94, t97, t99, t136, t137...890
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 327
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 327
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 122 transition count 324
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 120 transition count 319
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 109 transition count 293
Applied a total of 39 rules in 19 ms. Remains 109 /127 variables (removed 18) and now considering 293/338 (removed 45) transitions.
[2025-06-02 09:00:54] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
// Phase 1: matrix 267 rows 109 cols
[2025-06-02 09:00:54] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:00:54] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 09:00:54] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2025-06-02 09:00:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:00:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 09:00:55] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2025-06-02 09:00:55] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2025-06-02 09:00:55] [INFO ] Invariant cache hit.
[2025-06-02 09:00:55] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:00:59] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:00:59] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:00:59] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:00:59] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:01:00] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:01:00] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 266/375 variables, 109/123 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 38/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:01:07] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (OVERLAPS) 0/376 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 163 constraints, problems are : Problem set: 0 solved, 292 unsolved in 28285 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 266/375 variables, 109/124 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 292/454 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 455 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58370ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 58372ms
Starting structural reductions in LTL mode, iteration 1 : 109/127 places, 293/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58767 ms. Remains : 109/127 places, 293/338 transitions.
[2025-06-02 09:01:53] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:01:53] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:01:53] [INFO ] Input system was already deterministic with 293 transitions.
[2025-06-02 09:01:53] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:01:53] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:01:53] [INFO ] Time to serialize gal into /tmp/CTLFireability5768580671824422286.gal : 3 ms
[2025-06-02 09:01:53] [INFO ] Time to serialize properties into /tmp/CTLFireability18396855882343015414.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/CTLFireability5768580671824422286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18396855882343015414.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20084e+07,7.68215,166612,2,6227,5,439003,6,0,728,577616,0
Converting to forward existential form...Done !
original formula: EF(((A(!((((p3==1)&&(p17==1))&&(!((p66==1)&&(p97==1))))) U ((p8==1)&&(p52==1))) * (p31==1)) * ((p98==1) * (EG(AG(((p7==1)&&(p30==1)))) + ...187
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,TRUE) * (!((E(!(((p8==1)&&(p52==1))) U (!(!((((p3==1)&&(p17==1))&&(!((p66==1)&&(p97==1)))))) ...531
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...630
Detected timeout of ITS tools.
[2025-06-02 09:02:23] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:02:23] [INFO ] Applying decomposition
[2025-06-02 09:02:23] [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/graph15021252705009179666.txt' '-o' '/tmp/graph15021252705009179666.bin' '-w' '/tmp/graph15021252705009179666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15021252705009179666.bin' '-l' '-1' '-v' '-w' '/tmp/graph15021252705009179666.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:02:23] [INFO ] Decomposing Gal with order
[2025-06-02 09:02:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:02:23] [INFO ] Removed a total of 449 redundant transitions.
[2025-06-02 09:02:23] [INFO ] Flatten gal took : 25 ms
[2025-06-02 09:02:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 10 ms.
[2025-06-02 09:02:23] [INFO ] Time to serialize gal into /tmp/CTLFireability11142232378871878283.gal : 3 ms
[2025-06-02 09:02:23] [INFO ] Time to serialize properties into /tmp/CTLFireability142069097401066576.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/CTLFireability11142232378871878283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability142069097401066576.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20084e+07,8.93453,188944,1683,142,183652,1683,615,1.42291e+06,89,11050,0
Converting to forward existential form...Done !
original formula: EF(((A(!((((i0.u0.p3==1)&&(i1.u10.p17==1))&&(!((i4.u20.p66==1)&&(i5.u33.p97==1))))) U ((i3.u2.p8==1)&&(i3.u17.p52==1))) * (i1.u10.p31==1)...267
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,TRUE) * (!((E(!(((i3.u2.p8==1)&&(i3.u17.p52==1))) U (!(!((((i0.u0.p3==1)&&(i1.u10.p17==1))&&(...717
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t91, t92, t93, t94, t99, t140, t14...819
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 118 transition count 315
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 106 transition count 288
Applied a total of 43 rules in 59 ms. Remains 106 /127 variables (removed 21) and now considering 288/338 (removed 50) transitions.
[2025-06-02 09:02:53] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
// Phase 1: matrix 262 rows 106 cols
[2025-06-02 09:02:53] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:02:53] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-02 09:02:53] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2025-06-02 09:02:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:02:54] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 09:02:54] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:02:54] [INFO ] Redundant transitions in 2 ms returned []
Running 285 sub problems to find dead transitions.
[2025-06-02 09:02:54] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2025-06-02 09:02:54] [INFO ] Invariant cache hit.
[2025-06-02 09:02:54] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:02:55] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:02:55] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:02:56] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:02:56] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:02:56] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:02:56] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:02:57] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:02:57] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 261/366 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 1/367 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/368 variables, and 158 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 261/366 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 285/442 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/368 variables, and 443 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/127 places, 288/338 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60613 ms. Remains : 106/127 places, 288/338 transitions.
[2025-06-02 09:03:54] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:03:54] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:03:54] [INFO ] Input system was already deterministic with 288 transitions.
[2025-06-02 09:03:54] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:03:54] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:03:54] [INFO ] Time to serialize gal into /tmp/CTLFireability6211879554069034367.gal : 5 ms
[2025-06-02 09:03:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16127665661323390571.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/CTLFireability6211879554069034367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16127665661323390571.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.5322e+06,1.62053,34796,2,2199,5,101310,6,0,711,110801,0
Converting to forward existential form...Done !
original formula: AF((EG((p31!=1)) * EF(AG(((p4==1)&&(p57==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((EG((p31!=1)) * E(TRUE U !(E(TRUE U !(((p4==1)&&(p57==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...612
(forward)formula 0,0,4.80884,86176,1,0,515,335846,600,266,6024,358441,588
FORMULA FireWire-PT-08-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 118 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 107 transition count 288
Applied a total of 43 rules in 12 ms. Remains 107 /127 variables (removed 20) and now considering 288/338 (removed 50) transitions.
[2025-06-02 09:03:59] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
// Phase 1: matrix 262 rows 107 cols
[2025-06-02 09:03:59] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:03:59] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-02 09:03:59] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2025-06-02 09:03:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:03:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 09:03:59] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-02 09:03:59] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2025-06-02 09:03:59] [INFO ] Invariant cache hit.
[2025-06-02 09:03:59] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:04:04] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:04:04] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:04:04] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:04:04] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:04:04] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:04:05] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 159 constraints, problems are : Problem set: 0 solved, 287 unsolved in 28018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
SMT process timed out in 58123ms, After SMT, problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 58124ms
Starting structural reductions in LTL mode, iteration 1 : 107/127 places, 288/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58640 ms. Remains : 107/127 places, 288/338 transitions.
[2025-06-02 09:04:57] [INFO ] Flatten gal took : 23 ms
[2025-06-02 09:04:57] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:04:57] [INFO ] Input system was already deterministic with 288 transitions.
[2025-06-02 09:04:57] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:04:58] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:04:58] [INFO ] Time to serialize gal into /tmp/CTLFireability12854476585241724553.gal : 3 ms
[2025-06-02 09:04:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1373008934914934707.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/CTLFireability12854476585241724553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1373008934914934707.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13746e+07,7.31895,162524,2,6093,5,443377,6,0,715,562005,0
Converting to forward existential form...Done !
original formula: EF(EX(!(E(EF(((p3==1)&&(p87==1))) U ((AF(((p8==1)&&(p55==1))) * (p4==1)) * (p106==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(E(TRUE U ((p3==1)&&(p87==1))) U ((!(EG(!(((p8==1)&&(p55==1))))) * (p4==1)) * (p106==...171
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...618
Detected timeout of ITS tools.
[2025-06-02 09:05:28] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:05:28] [INFO ] Applying decomposition
[2025-06-02 09:05:28] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph402700626268243259.txt' '-o' '/tmp/graph402700626268243259.bin' '-w' '/tmp/graph402700626268243259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph402700626268243259.bin' '-l' '-1' '-v' '-w' '/tmp/graph402700626268243259.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:05:28] [INFO ] Decomposing Gal with order
[2025-06-02 09:05:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:05:28] [INFO ] Removed a total of 437 redundant transitions.
[2025-06-02 09:05:28] [INFO ] Flatten gal took : 25 ms
[2025-06-02 09:05:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 8 ms.
[2025-06-02 09:05:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13317210839238689913.gal : 2 ms
[2025-06-02 09:05:28] [INFO ] Time to serialize properties into /tmp/CTLFireability16394709893359839624.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/CTLFireability13317210839238689913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16394709893359839624.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13746e+07,10.3839,250956,2528,220,251681,2010,546,1.9602e+06,87,20685,0
Converting to forward existential form...Done !
original formula: EF(EX(!(E(EF(((i0.u0.p3==1)&&(i1.u29.p87==1))) U ((AF(((i4.u2.p8==1)&&(i4.u19.p55==1))) * (i1.u1.p4==1)) * (i7.u35.p106==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(E(TRUE U ((i0.u0.p3==1)&&(i1.u29.p87==1))) U ((!(EG(!(((i4.u2.p8==1)&&(i4.u19.p55==1...210
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t91, t92, t93, t94, t99, t140, t14...785
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 122 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 119 transition count 317
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 108 transition count 291
Applied a total of 40 rules in 15 ms. Remains 108 /127 variables (removed 19) and now considering 291/338 (removed 47) transitions.
[2025-06-02 09:05:58] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
// Phase 1: matrix 265 rows 108 cols
[2025-06-02 09:05:58] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:05:58] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 09:05:58] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2025-06-02 09:05:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:05:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 09:05:58] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2025-06-02 09:05:58] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2025-06-02 09:05:58] [INFO ] Invariant cache hit.
[2025-06-02 09:05:58] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:06:02] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:06:03] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:06:03] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:06:03] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:06:03] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:06:04] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:06:05] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 264/372 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 161 constraints, problems are : Problem set: 0 solved, 290 unsolved in 24152 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 264/372 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 290/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/373 variables, and 450 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54242ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 54244ms
Starting structural reductions in LTL mode, iteration 1 : 108/127 places, 291/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54587 ms. Remains : 108/127 places, 291/338 transitions.
[2025-06-02 09:06:52] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:06:52] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:06:52] [INFO ] Input system was already deterministic with 291 transitions.
[2025-06-02 09:06:52] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:06:52] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:06:52] [INFO ] Time to serialize gal into /tmp/CTLFireability1209438787164416676.gal : 2 ms
[2025-06-02 09:06:52] [INFO ] Time to serialize properties into /tmp/CTLFireability12401929359177285093.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/CTLFireability1209438787164416676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12401929359177285093.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20233e+07,8.56574,181452,2,6350,5,511453,6,0,722,674894,0
Converting to forward existential form...Done !
original formula: AG(((AF(((p8==1)&&(p36==1))) + AG(AF(((p67==0)||(p104==0))))) + EG(EX(((EF(((p8==1)&&(p28==1))) + ((p5==1)&&(p48==1))) + ((p8==1)&&(p103=...164
=> equivalent forward existential formula: [FwdG(FwdU(((FwdU(Init,TRUE) * !(EG(EX(((E(TRUE U ((p8==1)&&(p28==1))) + ((p5==1)&&(p48==1))) + ((p8==1)&&(p103=...241
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...624
Detected timeout of ITS tools.
[2025-06-02 09:07:22] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:07:22] [INFO ] Applying decomposition
[2025-06-02 09:07:22] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13271802575054825472.txt' '-o' '/tmp/graph13271802575054825472.bin' '-w' '/tmp/graph13271802575054825472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13271802575054825472.bin' '-l' '-1' '-v' '-w' '/tmp/graph13271802575054825472.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:07:23] [INFO ] Decomposing Gal with order
[2025-06-02 09:07:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:07:23] [INFO ] Removed a total of 442 redundant transitions.
[2025-06-02 09:07:23] [INFO ] Flatten gal took : 20 ms
[2025-06-02 09:07:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 5 ms.
[2025-06-02 09:07:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9476690051123990305.gal : 2 ms
[2025-06-02 09:07:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2791968534477702084.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/CTLFireability9476690051123990305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2791968534477702084.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20233e+07,5.34175,129356,1840,209,171402,2890,608,707504,90,22782,0
Converting to forward existential form...Done !
original formula: AG(((AF(((i2.u2.p8==1)&&(i2.u11.p36==1))) + AG(AF(((i5.u21.p67==0)||(i7.u35.p104==0))))) + EG(EX(((EF(((i2.u2.p8==1)&&(i2.u9.p28==1))) + ...235
=> equivalent forward existential formula: [FwdG(FwdU(((FwdU(Init,TRUE) * !(EG(EX(((E(TRUE U ((i2.u2.p8==1)&&(i2.u9.p28==1))) + ((i1.i0.u1.p5==1)&&(i1.i0.u...312
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t94, t99, t136, t137, t138, t140, ...809
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 118 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 115 transition count 307
Applied a total of 27 rules in 6 ms. Remains 115 /127 variables (removed 12) and now considering 307/338 (removed 31) transitions.
[2025-06-02 09:07:53] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 115 cols
[2025-06-02 09:07:53] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:07:53] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 09:07:53] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2025-06-02 09:07:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:07:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-02 09:07:53] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2025-06-02 09:07:53] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2025-06-02 09:07:53] [INFO ] Invariant cache hit.
[2025-06-02 09:07:53] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:58] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:58] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:58] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:58] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:07:59] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:08:00] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:08:00] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/395 variables, 115/130 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 40/170 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/396 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/396 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 171 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/395 variables, 115/130 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 40/170 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 306/476 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/396 variables, and 476 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 115/127 places, 307/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60548 ms. Remains : 115/127 places, 307/338 transitions.
[2025-06-02 09:08:53] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:08:53] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:08:53] [INFO ] Input system was already deterministic with 307 transitions.
[2025-06-02 09:08:53] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:08:53] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:08:53] [INFO ] Time to serialize gal into /tmp/CTLFireability975422541570117462.gal : 2 ms
[2025-06-02 09:08:53] [INFO ] Time to serialize properties into /tmp/CTLFireability2844312642401502685.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/CTLFireability975422541570117462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2844312642401502685.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,1.15307e+07,1.24877,30588,2,2382,5,97104,6,0,766,96554,0
Converting to forward existential form...Done !
original formula: E((AF((EX(!(((p8==1)&&(p50==1)))) * EX(EF(((p8==1)&&(p55==1)))))) + AX((!(E(((p9==1)&&(p105==1)) U ((p6==1)&&(p103==1)))) + ((A(((p8==1)&...521
=> equivalent forward existential formula: (([(FwdU(((FwdU(Init,(!(EG(!((EX(!(((p8==1)&&(p50==1)))) * EX(E(TRUE U ((p8==1)&&(p55==1)))))))) + !(EX(!((!(E((...1765
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...666
(forward)formula 0,0,2.8555,53648,1,0,567,241815,655,283,6314,237432,630
FORMULA FireWire-PT-08-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 119 transition count 317
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 119 transition count 317
Applied a total of 19 rules in 3 ms. Remains 119 /127 variables (removed 8) and now considering 317/338 (removed 21) transitions.
[2025-06-02 09:08:56] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
// Phase 1: matrix 291 rows 119 cols
[2025-06-02 09:08:56] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:08:56] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 09:08:56] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2025-06-02 09:08:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:08:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 09:08:57] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2025-06-02 09:08:57] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2025-06-02 09:08:57] [INFO ] Invariant cache hit.
[2025-06-02 09:08:57] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:09:02] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:09:02] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:09:02] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:09:02] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:09:03] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:09:03] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:09:04] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 177 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 316/492 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/410 variables, and 492 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 119/127 places, 317/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60705 ms. Remains : 119/127 places, 317/338 transitions.
[2025-06-02 09:09:57] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:09:57] [INFO ] Flatten gal took : 15 ms
[2025-06-02 09:09:57] [INFO ] Input system was already deterministic with 317 transitions.
[2025-06-02 09:09:57] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:09:57] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:09:57] [INFO ] Time to serialize gal into /tmp/CTLFireability9083931687449499350.gal : 3 ms
[2025-06-02 09:09:57] [INFO ] Time to serialize properties into /tmp/CTLFireability12847755561823340135.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/CTLFireability9083931687449499350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12847755561823340135.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16095e+07,1.03918,21412,2,2300,5,63821,6,0,792,56410,0
Converting to forward existential form...Done !
original formula: AG(((AX(((p10==0)||(p44==0))) + EX(EX(AG(((p4==1)&&(p47==1)))))) + (((p8==0)||(p108==0)) * (((!(A(((p11==1)&&(p35==1)) U ((p8==1)&&(p30==...239
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !((((p8==0)||(p108==0)) * (((!(!((E(!(((p8==1)&&(p30==1))) U (!(((p11==1)&&(p35==1))) *...384
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...690
(forward)formula 0,0,27.5547,584388,1,0,794,3.26219e+06,673,404,6737,3.51166e+06,888
FORMULA FireWire-PT-08-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 122 transition count 323
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 120 transition count 319
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 120 transition count 319
Applied a total of 17 rules in 4 ms. Remains 120 /127 variables (removed 7) and now considering 319/338 (removed 19) transitions.
[2025-06-02 09:10:25] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
// Phase 1: matrix 293 rows 120 cols
[2025-06-02 09:10:25] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:10:25] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 09:10:25] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
[2025-06-02 09:10:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:10:25] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 09:10:25] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2025-06-02 09:10:25] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
[2025-06-02 09:10:25] [INFO ] Invariant cache hit.
[2025-06-02 09:10:25] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:30] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:30] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:31] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:31] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:31] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:31] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:32] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 292/412 variables, 120/135 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 1/413 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (OVERLAPS) 0/413 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 178 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 292/412 variables, 120/135 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 318/495 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/413 variables, and 495 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in LTL mode, iteration 1 : 120/127 places, 319/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60711 ms. Remains : 120/127 places, 319/338 transitions.
[2025-06-02 09:11:25] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:11:25] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:11:25] [INFO ] Input system was already deterministic with 319 transitions.
[2025-06-02 09:11:25] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:11:25] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:11:25] [INFO ] Time to serialize gal into /tmp/CTLFireability5975393054745822662.gal : 2 ms
[2025-06-02 09:11:25] [INFO ] Time to serialize properties into /tmp/CTLFireability17762140076890004741.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/CTLFireability5975393054745822662.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17762140076890004741.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16293e+07,0.889511,22424,2,2370,5,66457,6,0,798,57821,0
Converting to forward existential form...Done !
original formula: EX((EG(AG(((p8==0)||(p108==0)))) + ((E((((!((p10==1)&&(p80==1)))&&(((p8==1)&&(p111==1))||((p38==1)&&(p49==1))))||(p74==1)) U E((p107==1) ...274
=> equivalent forward existential formula: ([FwdG(EY(Init),!(E(TRUE U !(((p8==0)||(p108==0))))))] != FALSE + [((EY(Init) * (E((((!((p10==1)&&(p80==1)))&&((...383
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t12, t13, t15, t16, t17, t19, t21, t25, t26, t28, t29, t30, t32, t34,...691
Detected timeout of ITS tools.
[2025-06-02 09:11:56] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:11:56] [INFO ] Applying decomposition
[2025-06-02 09:11:56] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3823437088872534085.txt' '-o' '/tmp/graph3823437088872534085.bin' '-w' '/tmp/graph3823437088872534085.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3823437088872534085.bin' '-l' '-1' '-v' '-w' '/tmp/graph3823437088872534085.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:11:56] [INFO ] Decomposing Gal with order
[2025-06-02 09:11:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:11:56] [INFO ] Removed a total of 498 redundant transitions.
[2025-06-02 09:11:56] [INFO ] Flatten gal took : 20 ms
[2025-06-02 09:11:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 5 ms.
[2025-06-02 09:11:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10686569523674298736.gal : 3 ms
[2025-06-02 09:11:56] [INFO ] Time to serialize properties into /tmp/CTLFireability6014741653595551173.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/CTLFireability10686569523674298736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6014741653595551173.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16293e+07,25.2784,465908,1864,198,337247,8902,647,4.60114e+06,87,72192,0
Converting to forward existential form...Done !
original formula: EX((EG(AG(((i1.u2.p8==0)||(i6.u35.p108==0)))) + ((E((((!((i2.i1.u3.p10==1)&&(i0.u26.p80==1)))&&(((i1.u2.p8==1)&&(i4.i1.u37.p111==1))||((i...402
=> equivalent forward existential formula: ([FwdG(EY(Init),!(E(TRUE U !(((i1.u2.p8==0)||(i6.u35.p108==0))))))] != FALSE + [((EY(Init) * (E((((!((i2.i1.u3.p...511
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t43, t45, t49, t50, t52, t60, t65, t70, t75, t80, t95, t98, t100, t137, t138, t139, t...895
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 117 transition count 313
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 106 transition count 287
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 1 with 2 rules applied. Total rules applied 45 place count 105 transition count 286
Applied a total of 45 rules in 40 ms. Remains 105 /127 variables (removed 22) and now considering 286/338 (removed 52) transitions.
[2025-06-02 09:12:26] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
// Phase 1: matrix 260 rows 105 cols
[2025-06-02 09:12:26] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:12:26] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-02 09:12:26] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2025-06-02 09:12:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:12:26] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 09:12:26] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:12:26] [INFO ] Redundant transitions in 3 ms returned []
Running 283 sub problems to find dead transitions.
[2025-06-02 09:12:26] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2025-06-02 09:12:26] [INFO ] Invariant cache hit.
[2025-06-02 09:12:26] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:12:28] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:12:29] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:12:29] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:12:29] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:12:29] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:12:30] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:12:30] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:12:30] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 1/364 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:12:54] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 20 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/364 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/365 variables, and 158 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 283/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 2)
(t1 1)
(t2 5)
(t3 1)
(t4 0)
(t5 1)
(t6 1)
(t7 0)
(t8 0)
(t9 0)
(t10 1)
(t11 1)
(t12 13)
(t13 0)
(t14 1)
(t15 2)
(t16 0)
(t17 0)
(t18 2)
(t19 1)
(t20 0)
(t21 0)
(t22 0)
(t23 2)
(t24 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/365 variables, and 441 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/127 places, 286/338 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60754 ms. Remains : 105/127 places, 286/338 transitions.
[2025-06-02 09:13:26] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:13:26] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:13:26] [INFO ] Input system was already deterministic with 286 transitions.
[2025-06-02 09:13:27] [INFO ] Flatten gal took : 16 ms
[2025-06-02 09:13:27] [INFO ] Flatten gal took : 26 ms
[2025-06-02 09:13:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15530541625350861200.gal : 3 ms
[2025-06-02 09:13:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11429251059142810937.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15530541625350861200.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11429251059142810937.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (2339 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (595 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
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 ...330
Finished probabilistic random walk after 13744 steps, run visited all 1 properties in 64 ms. (steps per millisecond=214 )
Probabilistic random walk after 13744 steps, saw 4988 distinct states, run finished after 73 ms. (steps per millisecond=188 ) properties seen :1
FORMULA FireWire-PT-08-CTLFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 118 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Applied a total of 23 rules in 9 ms. Remains 117 /127 variables (removed 10) and now considering 312/338 (removed 26) transitions.
[2025-06-02 09:13:27] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
// Phase 1: matrix 286 rows 117 cols
[2025-06-02 09:13:27] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:13:27] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-06-02 09:13:27] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
[2025-06-02 09:13:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:13:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 09:13:27] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2025-06-02 09:13:27] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
[2025-06-02 09:13:27] [INFO ] Invariant cache hit.
[2025-06-02 09:13:27] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:32] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:32] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:33] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:33] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:33] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:33] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:34] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 285/402 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 41/173 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/403 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 0/403 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 174 constraints, problems are : Problem set: 0 solved, 311 unsolved in 27948 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:58] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 285/402 variables, 117/133 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 311/485 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:14:13] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/403 variables, and 486 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58085ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 58086ms
Starting structural reductions in LTL mode, iteration 1 : 117/127 places, 312/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58724 ms. Remains : 117/127 places, 312/338 transitions.
[2025-06-02 09:14:25] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:14:25] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:14:25] [INFO ] Input system was already deterministic with 312 transitions.
[2025-06-02 09:14:25] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:14:25] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:14:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13092207825433485288.gal : 2 ms
[2025-06-02 09:14:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16665153939793518370.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/CTLFireability13092207825433485288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16665153939793518370.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15701e+07,0.852464,22132,2,2375,5,66115,6,0,779,56393,0
Converting to forward existential form...Done !
original formula: EF(((EX(((p3==0)||(p91==0))) * AG(AX(((p3==0)||(p77==0))))) * ((p6==0)||(p103==0))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p6==0)||(p103==0))) * EX(((p3==0)||(p91==0)))) * !(E(TRUE U !(!(EX(!(((p3==0)||(p77==0))...172
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...678
(forward)formula 0,1,11.0588,236360,1,0,730,1.24898e+06,645,368,6581,932133,825
FORMULA FireWire-PT-08-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 122 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 119 transition count 317
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 119 transition count 317
Applied a total of 18 rules in 6 ms. Remains 119 /127 variables (removed 8) and now considering 317/338 (removed 21) transitions.
[2025-06-02 09:14:37] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
// Phase 1: matrix 291 rows 119 cols
[2025-06-02 09:14:37] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:14:37] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-02 09:14:37] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2025-06-02 09:14:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:14:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 09:14:37] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2025-06-02 09:14:37] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2025-06-02 09:14:37] [INFO ] Invariant cache hit.
[2025-06-02 09:14:37] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:14:42] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:14:42] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:14:42] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:14:42] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:14:43] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:14:43] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:14:44] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 176 constraints, problems are : Problem set: 0 solved, 316 unsolved in 28243 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 316/491 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 316 unsolved
SMT process timed out in 58330ms, After SMT, problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 58331ms
Starting structural reductions in LTL mode, iteration 1 : 119/127 places, 317/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58729 ms. Remains : 119/127 places, 317/338 transitions.
[2025-06-02 09:15:35] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:15:35] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:15:35] [INFO ] Input system was already deterministic with 317 transitions.
[2025-06-02 09:15:35] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:15:35] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:15:35] [INFO ] Time to serialize gal into /tmp/CTLFireability4660450289104301498.gal : 2 ms
[2025-06-02 09:15:35] [INFO ] Time to serialize properties into /tmp/CTLFireability1665737397258171023.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/CTLFireability4660450289104301498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1665737397258171023.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2251e+07,1.11925,31264,2,2342,5,95650,6,0,792,97320,0
Converting to forward existential form...Done !
original formula: AG((((EF(((((p8==1)&&(p101==1))||((p8==1)&&(p98==1)))||(((p11==1)&&(p24==1))||((p6==1)&&(p51==1))))) + EX(TRUE)) + (EG(EF(((p4==0)||(p78=...253
=> equivalent forward existential formula: (([(EY((FwdU(Init,TRUE) * !(((E(TRUE U ((((p8==1)&&(p101==1))||((p8==1)&&(p98==1)))||(((p11==1)&&(p24==1))||((p6...758
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...685
Detected timeout of ITS tools.
[2025-06-02 09:16:05] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:16:05] [INFO ] Applying decomposition
[2025-06-02 09:16:05] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17262257022567053750.txt' '-o' '/tmp/graph17262257022567053750.bin' '-w' '/tmp/graph17262257022567053750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17262257022567053750.bin' '-l' '-1' '-v' '-w' '/tmp/graph17262257022567053750.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:16:05] [INFO ] Decomposing Gal with order
[2025-06-02 09:16:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:16:06] [INFO ] Removed a total of 494 redundant transitions.
[2025-06-02 09:16:06] [INFO ] Flatten gal took : 20 ms
[2025-06-02 09:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 5 ms.
[2025-06-02 09:16:06] [INFO ] Time to serialize gal into /tmp/CTLFireability947915093210044680.gal : 3 ms
[2025-06-02 09:16:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12318255766997536975.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/CTLFireability947915093210044680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12318255766997536975.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2251e+07,20.5267,420720,1529,212,543367,3930,658,3.00244e+06,90,38698,0
Converting to forward existential form...Done !
original formula: AG((((EF(((((i2.u2.p8==1)&&(i6.i1.u35.p101==1))||((i2.u2.p8==1)&&(i6.i1.u33.p98==1)))||(((i1.i0.u3.p11==1)&&(i1.i1.u7.p24==1))||((i6.i0.u...391
=> equivalent forward existential formula: (([(EY((FwdU(Init,TRUE) * !(((E(TRUE U ((((i2.u2.p8==1)&&(i6.i1.u35.p101==1))||((i2.u2.p8==1)&&(i6.i1.u33.p98==1...1094
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t64, t69, t74, t79, t91, t92, t93, t94, t97, t99, t140, t142, t1...874
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 118 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 107 transition count 288
Applied a total of 43 rules in 12 ms. Remains 107 /127 variables (removed 20) and now considering 288/338 (removed 50) transitions.
[2025-06-02 09:16:36] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
// Phase 1: matrix 262 rows 107 cols
[2025-06-02 09:16:36] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:16:36] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-02 09:16:36] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2025-06-02 09:16:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:16:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 09:16:36] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-02 09:16:36] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2025-06-02 09:16:36] [INFO ] Invariant cache hit.
[2025-06-02 09:16:36] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:41] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:41] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:41] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:41] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:41] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:42] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 159 constraints, problems are : Problem set: 0 solved, 287 unsolved in 27563 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
SMT process timed out in 57677ms, After SMT, problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 57680ms
Starting structural reductions in LTL mode, iteration 1 : 107/127 places, 288/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58179 ms. Remains : 107/127 places, 288/338 transitions.
[2025-06-02 09:17:34] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:17:34] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:17:34] [INFO ] Input system was already deterministic with 288 transitions.
[2025-06-02 09:17:34] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:17:34] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:17:34] [INFO ] Time to serialize gal into /tmp/CTLFireability18332316755505921630.gal : 1 ms
[2025-06-02 09:17:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6833659975974404816.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/CTLFireability18332316755505921630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6833659975974404816.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13746e+07,7.28345,162156,2,6093,5,443377,6,0,715,562005,0
Converting to forward existential form...Done !
original formula: AX(AX(FALSE))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(FALSE))] = FALSE
(forward)formula 0,0,7.29444,162156,1,0,7,443377,7,1,1117,562005,2
FORMULA FireWire-PT-08-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 119 transition count 317
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 119 transition count 317
Applied a total of 19 rules in 3 ms. Remains 119 /127 variables (removed 8) and now considering 317/338 (removed 21) transitions.
[2025-06-02 09:17:41] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
// Phase 1: matrix 291 rows 119 cols
[2025-06-02 09:17:41] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:17:41] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 09:17:41] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2025-06-02 09:17:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:17:41] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 09:17:42] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2025-06-02 09:17:42] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2025-06-02 09:17:42] [INFO ] Invariant cache hit.
[2025-06-02 09:17:42] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:47] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:47] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:47] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:47] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:47] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:48] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:49] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 177 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 316/492 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/410 variables, and 492 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 119/127 places, 317/338 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60470 ms. Remains : 119/127 places, 317/338 transitions.
[2025-06-02 09:18:42] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:18:42] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:18:42] [INFO ] Input system was already deterministic with 317 transitions.
[2025-06-02 09:18:42] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:18:42] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:18:42] [INFO ] Time to serialize gal into /tmp/CTLFireability17734724987717232922.gal : 2 ms
[2025-06-02 09:18:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5535203884317412882.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/CTLFireability17734724987717232922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5535203884317412882.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16095e+07,0.928877,21404,2,2300,5,63821,6,0,792,56410,0
Converting to forward existential form...Done !
original formula: (E((AX(A((((p6==1)&&(p108==1))||((p8==1)&&(p109==1))) U !(((p9==1)&&(p77==1))))) * A(((E((p25==1) U ((p9==1)&&(p123==1))) + !(((p7==1)&&(...356
=> equivalent forward existential formula: ([((FwdU(Init,(!(EX(!(!((E(!(!(((p9==1)&&(p77==1)))) U (!((((p6==1)&&(p108==1))||((p8==1)&&(p109==1)))) * !(!(((...714
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...690
Detected timeout of ITS tools.
[2025-06-02 09:19:12] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:19:12] [INFO ] Applying decomposition
[2025-06-02 09:19:12] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11125618229639818738.txt' '-o' '/tmp/graph11125618229639818738.bin' '-w' '/tmp/graph11125618229639818738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11125618229639818738.bin' '-l' '-1' '-v' '-w' '/tmp/graph11125618229639818738.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:19:12] [INFO ] Decomposing Gal with order
[2025-06-02 09:19:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:19:12] [INFO ] Removed a total of 494 redundant transitions.
[2025-06-02 09:19:12] [INFO ] Flatten gal took : 28 ms
[2025-06-02 09:19:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 8 ms.
[2025-06-02 09:19:12] [INFO ] Time to serialize gal into /tmp/CTLFireability4313966379111829573.gal : 4 ms
[2025-06-02 09:19:12] [INFO ] Time to serialize properties into /tmp/CTLFireability6371898329198522098.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/CTLFireability4313966379111829573.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6371898329198522098.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16095e+07,2.05091,52832,1063,141,73567,1643,667,248491,88,14399,0
Converting to forward existential form...Done !
original formula: (E((AX(A((((i6.i1.u36.p6==1)&&(i6.i0.u37.p108==1))||((i3.u2.p8==1)&&(i6.i1.u36.p109==1))) U !(((i7.i1.u3.p9==1)&&(i0.u25.p77==1))))) * A(...538
=> equivalent forward existential formula: ([((FwdU(Init,(!(EX(!(!((E(!(!(((i7.i1.u3.p9==1)&&(i0.u25.p77==1)))) U (!((((i6.i1.u36.p6==1)&&(i6.i0.u37.p108==...1012
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t51, t59, t64, t69, t74, t79, t87, t91, t92, t93, t94, t97, t99,...877
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
[2025-06-02 09:19:42] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:19:42] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:19:42] [INFO ] Applying decomposition
[2025-06-02 09:19:42] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6659259016338441290.txt' '-o' '/tmp/graph6659259016338441290.bin' '-w' '/tmp/graph6659259016338441290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6659259016338441290.bin' '-l' '-1' '-v' '-w' '/tmp/graph6659259016338441290.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:19:42] [INFO ] Decomposing Gal with order
[2025-06-02 09:19:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:19:42] [INFO ] Removed a total of 531 redundant transitions.
[2025-06-02 09:19:42] [INFO ] Flatten gal took : 36 ms
[2025-06-02 09:19:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 131 labels/synchronizations in 5 ms.
[2025-06-02 09:19:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3945467912918659380.gal : 4 ms
[2025-06-02 09:19:42] [INFO ] Time to serialize properties into /tmp/CTLFireability3927320184300474153.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/CTLFireability3945467912918659380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3927320184300474153.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 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46954e+07,6.64813,148560,1717,204,222430,6644,667,641399,89,52015,0
Converting to forward existential form...Done !
original formula: E(EG(!((E(A((i0.u38.p112==1) U ((i2.u3.p9==1)&&(i0.u26.p79==1))) U EG(((i6.i0.u21.p67==1)&&(i6.i1.u36.p104==1)))) + AG(!(((i2.u3.p10==1)&...392
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EG(!((E(!((E(!(((i2.u3.p9==1)&&(i0.u26.p79==1))) U (!((i0.u38.p112==1)) * !(((i2.u3.p9==1)&&(i0...568
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t43, t45, t46, t49, t50, t52, t60, t65, t70, t75, t80, t84, t95, t98, t100, t139, t14...904
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,96.6539,1709064,1,0,2.51868e+06,8267,3559,7.21432e+06,384,81709,4908873
FORMULA FireWire-PT-08-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(((A(!((((i0.u0.p3==1)&&(i3.u10.p17==1))&&(!((i5.u20.p66==1)&&(i6.i2.u33.p97==1))))) U ((i4.u2.p8==1)&&(i4.u17.p52==1))) * (i3.u10.p31=...276
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,TRUE) * (!((E(!(((i4.u2.p8==1)&&(i4.u17.p52==1))) U (!(!((((i0.u0.p3==1)&&(i3.u10.p17==1))&&(...732
(forward)formula 1,0,111.633,2069768,1,0,3.09541e+06,9353,3622,8.51263e+06,384,91339,5829036
FORMULA FireWire-PT-08-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(EX(!(E(EF(((i0.u0.p3==1)&&(i2.u30.p87==1))) U ((AF(((i4.u2.p8==1)&&(i4.u19.p55==1))) * (i1.i0.u1.p4==1)) * (i6.i2.u35.p106==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(E(TRUE U ((i0.u0.p3==1)&&(i2.u30.p87==1))) U ((!(EG(!(((i4.u2.p8==1)&&(i4.u19.p55==1...216
(forward)formula 2,1,133.008,2200712,1,0,3.29735e+06,9523,1919,8.98477e+06,229,93012,137547
FORMULA FireWire-PT-08-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(((AF(((i4.u2.p8==1)&&(i3.u10.p36==1))) + AG(AF(((i6.i0.u21.p67==0)||(i6.i1.u36.p104==0))))) + EG(EX(((EF(((i4.u2.p8==1)&&(i3.u9.p28==1...244
=> equivalent forward existential formula: [FwdG(FwdU(((FwdU(Init,TRUE) * !(EG(EX(((E(TRUE U ((i4.u2.p8==1)&&(i3.u9.p28==1))) + ((i1.i0.u1.p5==1)&&(i1.i0.u...321
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 3,0,142.268,2200712,1,0,3.29735e+06,9523,2802,8.98477e+06,272,93012,1108924
FORMULA FireWire-PT-08-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX((EG(AG(((i4.u2.p8==0)||(i6.i2.u35.p108==0)))) + ((E((((!((i2.u3.p10==1)&&(i0.u27.p80==1)))&&(((i4.u2.p8==1)&&(i6.i1.u37.p111==1))||((i...408
=> equivalent forward existential formula: ([FwdG(EY(Init),!(E(TRUE U !(((i4.u2.p8==0)||(i6.i2.u35.p108==0))))))] != FALSE + [((EY(Init) * (E((((!((i2.u3.p...517
(forward)formula 4,0,152.873,2200712,1,0,3.29735e+06,9523,2824,8.98477e+06,273,93012,2140812
FORMULA FireWire-PT-08-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG((((EF(((((i4.u2.p8==1)&&(i6.i2.u43.p101==1))||((i4.u2.p8==1)&&(i6.i2.u33.p98==1)))||(((i2.u3.p11==1)&&(i1.i1.u5.p24==1))||((i6.i1.u36....385
=> equivalent forward existential formula: (([(EY((FwdU(Init,TRUE) * !(((E(TRUE U ((((i4.u2.p8==1)&&(i6.i2.u43.p101==1))||((i4.u2.p8==1)&&(i6.i2.u33.p98==1...1076
(forward)formula 5,1,156.642,2200712,1,0,3.29735e+06,9523,2883,8.98477e+06,275,93012,2502511
FORMULA FireWire-PT-08-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (E((AX(A((((i6.i1.u36.p6==1)&&(i6.i2.u35.p108==1))||((i4.u2.p8==1)&&(i6.i1.u36.p109==1))) U !(((i2.u3.p9==1)&&(i0.u25.p77==1))))) * A(((E...535
=> equivalent forward existential formula: ([((FwdU(Init,(!(EX(!(!((E(!(!(((i2.u3.p9==1)&&(i0.u25.p77==1)))) U (!((((i6.i1.u36.p6==1)&&(i6.i2.u35.p108==1))...1009
(forward)formula 6,1,195.504,2200712,1,0,3.29735e+06,10718,3095,8.98477e+06,279,93012,5479302
FORMULA FireWire-PT-08-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1901670 ms.
BK_STOP 1748856178644
--------------------
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="FireWire-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 FireWire-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 r086-smll-174860102200298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-08.tgz
mv FireWire-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 ;