About the Execution of ITS-Tools for FireWire-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 889950.00 | 0.00 | 0.00 | TFTFTFTFFFTTTFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102300353.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-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102300353
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 90K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-15
FORMULA_NAME FireWire-PT-15-CTLCardinality-2025-00
FORMULA_NAME FireWire-PT-15-CTLCardinality-2025-01
FORMULA_NAME FireWire-PT-15-CTLCardinality-2025-02
FORMULA_NAME FireWire-PT-15-CTLCardinality-2025-03
FORMULA_NAME FireWire-PT-15-CTLCardinality-2025-04
FORMULA_NAME FireWire-PT-15-CTLCardinality-2025-05
FORMULA_NAME FireWire-PT-15-CTLCardinality-2025-06
FORMULA_NAME FireWire-PT-15-CTLCardinality-2025-07
FORMULA_NAME FireWire-PT-15-CTLCardinality-2025-08
FORMULA_NAME FireWire-PT-15-CTLCardinality-2025-09
FORMULA_NAME FireWire-PT-15-CTLCardinality-2025-10
FORMULA_NAME FireWire-PT-15-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748884596089
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 17:16:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 17:16:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:16:39] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2025-06-02 17:16:39] [INFO ] Transformed 248 places.
[2025-06-02 17:16:39] [INFO ] Transformed 383 transitions.
[2025-06-02 17:16:39] [INFO ] Found NUPN structural information;
[2025-06-02 17:16:39] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 550 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
Support contains 79 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 244 transition count 383
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 42 place count 206 transition count 345
Iterating global reduction 1 with 38 rules applied. Total rules applied 80 place count 206 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 206 transition count 344
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 203 transition count 314
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 203 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 203 transition count 313
Applied a total of 88 rules in 155 ms. Remains 203 /248 variables (removed 45) and now considering 313/383 (removed 70) transitions.
// Phase 1: matrix 313 rows 203 cols
[2025-06-02 17:16:39] [INFO ] Computed 4 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:16:40] [INFO ] Implicit Places using invariants in 576 ms returned []
[2025-06-02 17:16:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:16:40] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2025-06-02 17:16:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:47] [INFO ] Deduced a trap composed of 97 places in 385 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:48] [INFO ] Deduced a trap composed of 99 places in 297 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:48] [INFO ] Deduced a trap composed of 99 places in 232 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:49] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:49] [INFO ] Deduced a trap composed of 69 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:50] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:50] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:50] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:50] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:51] [INFO ] Deduced a trap composed of 124 places in 156 ms of which 16 ms to minimize.
Problem TDEAD154 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:51] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 26 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD283 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:52] [INFO ] Deduced a trap composed of 110 places in 173 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:52] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 13/17 constraints. Problems are: Problem set: 18 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:54] [INFO ] Deduced a trap composed of 110 places in 210 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:54] [INFO ] Deduced a trap composed of 110 places in 195 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:55] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:55] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 4/21 constraints. Problems are: Problem set: 18 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/21 constraints. Problems are: Problem set: 18 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 313/515 variables, 202/223 constraints. Problems are: Problem set: 18 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:05] [INFO ] Deduced a trap composed of 116 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:06] [INFO ] Deduced a trap composed of 61 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 17:17:07] [INFO ] Deduced a trap composed of 46 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 17:17:07] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 26 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 4/227 constraints. Problems are: Problem set: 18 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/516 variables, and 227 constraints, problems are : Problem set: 18 solved, 294 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/203 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 294 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 21/25 constraints. Problems are: Problem set: 18 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/25 constraints. Problems are: Problem set: 18 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 313/515 variables, 202/227 constraints. Problems are: Problem set: 18 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 285/512 constraints. Problems are: Problem set: 18 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/512 constraints. Problems are: Problem set: 18 solved, 294 unsolved
SMT process timed out in 60368ms, After SMT, problems are : Problem set: 18 solved, 294 unsolved
Search for dead transitions found 18 dead transitions in 60396ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 203/248 places, 295/383 transitions.
Applied a total of 0 rules in 7 ms. Remains 203 /203 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61877 ms. Remains : 203/248 places, 295/383 transitions.
Support contains 79 out of 203 places after structural reductions.
[2025-06-02 17:17:41] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-02 17:17:41] [INFO ] Flatten gal took : 74 ms
[2025-06-02 17:17:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-15-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 17:17:41] [INFO ] Flatten gal took : 35 ms
[2025-06-02 17:17:41] [INFO ] Input system was already deterministic with 295 transitions.
Support contains 68 out of 203 places (down from 79) after GAL structural reductions.
RANDOM walk for 40000 steps (10 resets) in 3558 ms. (11 steps per ms) remains 34/41 properties
BEST_FIRST walk for 4000 steps (10 resets) in 106 ms. (37 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4000 steps (10 resets) in 89 ms. (44 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4000 steps (10 resets) in 44 ms. (88 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (10 resets) in 87 ms. (45 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (9 resets) in 87 ms. (45 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (13 resets) in 43 ms. (90 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (9 resets) in 48 ms. (81 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (9 resets) in 57 ms. (68 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (10 resets) in 66 ms. (59 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (11 resets) in 63 ms. (62 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (11 resets) in 22 ms. (173 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (12 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (11 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (11 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (9 resets) in 20 ms. (190 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4000 steps (10 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (11 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (11 resets) in 47 ms. (83 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (11 resets) in 48 ms. (81 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (9 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (9 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (12 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (9 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (10 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (9 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (11 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (9 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (13 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
// Phase 1: matrix 295 rows 203 cols
[2025-06-02 17:17:43] [INFO ] Computed 4 invariants in 6 ms
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/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 138/188 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 287/475 variables, 188/192 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 21/496 variables, 13/205 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 2/498 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/498 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 207 constraints, problems are : Problem set: 0 solved, 31 unsolved in 3224 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp37 is UNSAT
At refinement iteration 1 (OVERLAPS) 138/188 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:46] [INFO ] Deduced a trap composed of 99 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 17:17:47] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:47] [INFO ] Deduced a trap composed of 96 places in 200 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:47] [INFO ] Deduced a trap composed of 104 places in 196 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:47] [INFO ] Deduced a trap composed of 108 places in 179 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:47] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:48] [INFO ] Deduced a trap composed of 69 places in 248 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:48] [INFO ] Deduced a trap composed of 70 places in 247 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:48] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 9/13 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 287/475 variables, 188/201 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 27/228 constraints. Problems are: Problem set: 2 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:50] [INFO ] Deduced a trap composed of 61 places in 218 ms of which 44 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 1/229 constraints. Problems are: Problem set: 2 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:50] [INFO ] Deduced a trap composed of 126 places in 162 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:51] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 34 ms to minimize.
(s172 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(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)
(s55 0)
(s61 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/498 variables, and 231 constraints, problems are : Problem set: 2 solved, 29 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 188/203 constraints, PredecessorRefiner: 27/31 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8269ms problems are : Problem set: 2 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 295/295 transitions.
Graph (trivial) has 93 edges and 203 vertex of which 6 / 203 are part of one of the 2 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 199 transition count 275
Reduce places removed 13 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 19 rules applied. Total rules applied 33 place count 186 transition count 269
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 40 place count 180 transition count 268
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 40 place count 180 transition count 262
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 174 transition count 262
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 62 place count 164 transition count 252
Iterating global reduction 3 with 10 rules applied. Total rules applied 72 place count 164 transition count 252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 72 place count 164 transition count 251
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 163 transition count 251
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 160 transition count 247
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 160 transition count 247
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 159 transition count 244
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 159 transition count 244
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 158 transition count 243
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 158 transition count 243
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 157 transition count 240
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 157 transition count 240
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 120 place count 140 transition count 223
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 138 place count 131 transition count 260
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 131 transition count 259
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 131 transition count 257
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 151 place count 131 transition count 247
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 161 place count 121 transition count 247
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 120 transition count 246
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 120 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 164 place count 120 transition count 245
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 120 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 119 transition count 244
Applied a total of 166 rules in 170 ms. Remains 119 /203 variables (removed 84) and now considering 244/295 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 119/203 places, 244/295 transitions.
RANDOM walk for 40000 steps (11 resets) in 822 ms. (48 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (19 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (26 resets) in 96 ms. (41 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (17 resets) in 100 ms. (39 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (15 resets) in 65 ms. (60 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (17 resets) in 82 ms. (48 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (14 resets) in 39 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (18 resets) in 50 ms. (78 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (9 resets) in 43 ms. (90 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (14 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (15 resets) in 41 ms. (95 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (20 resets) in 49 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (18 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (11 resets) in 42 ms. (93 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (12 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (9 resets) in 42 ms. (93 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (14 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (10 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (9 resets) in 22 ms. (173 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (15 resets) in 22 ms. (173 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (24 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (16 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (18 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (24 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (17 resets) in 22 ms. (173 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (22 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (12 resets) in 22 ms. (173 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (17 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (13 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
Finished probabilistic random walk after 94898 steps, run visited all 29 properties in 819 ms. (steps per millisecond=115 )
Probabilistic random walk after 94898 steps, saw 23881 distinct states, run finished after 826 ms. (steps per millisecond=114 ) properties seen :29
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2025-06-02 17:17:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 17:17:53] [INFO ] Flatten gal took : 33 ms
FORMULA FireWire-PT-15-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 17:17:53] [INFO ] Flatten gal took : 32 ms
[2025-06-02 17:17:53] [INFO ] Input system was already deterministic with 295 transitions.
Computed a total of 57 stabilizing places and 80 stable transitions
Graph (complete) has 531 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 295/295 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 202 transition count 295
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 178 transition count 271
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 178 transition count 271
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 169 transition count 258
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 169 transition count 258
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 166 transition count 252
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 166 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 165 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 165 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 164 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 164 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 163 transition count 247
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 163 transition count 247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 162 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 162 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 161 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 161 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 160 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 160 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 159 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 159 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 158 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 158 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 157 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 157 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 156 transition count 233
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 156 transition count 233
Applied a total of 93 rules in 38 ms. Remains 156 /203 variables (removed 47) and now considering 233/295 (removed 62) transitions.
// Phase 1: matrix 233 rows 156 cols
[2025-06-02 17:17:53] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:17:53] [INFO ] Implicit Places using invariants in 459 ms returned []
[2025-06-02 17:17:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:17:54] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2025-06-02 17:17:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:57] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:57] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:58] [INFO ] Deduced a trap composed of 90 places in 158 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:58] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:58] [INFO ] Deduced a trap composed of 78 places in 187 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:58] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:58] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:59] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:59] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:59] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:59] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:59] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 14 ms to minimize.
Problem TDEAD126 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:00] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 15 ms to minimize.
Problem TDEAD139 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:00] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 17 ms to minimize.
Problem TDEAD142 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 14/18 constraints. Problems are: Problem set: 18 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:00] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:00] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:01] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:01] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:01] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:01] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:02] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:02] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 8/26 constraints. Problems are: Problem set: 18 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:04] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:04] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:04] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:05] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 4/30 constraints. Problems are: Problem set: 18 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:06] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/31 constraints. Problems are: Problem set: 18 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/31 constraints. Problems are: Problem set: 18 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 233/389 variables, 156/187 constraints. Problems are: Problem set: 18 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:11] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/188 constraints. Problems are: Problem set: 18 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/188 constraints. Problems are: Problem set: 18 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/389 variables, 0/188 constraints. Problems are: Problem set: 18 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 188 constraints, problems are : Problem set: 18 solved, 214 unsolved in 28135 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 28/32 constraints. Problems are: Problem set: 18 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:24] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/33 constraints. Problems are: Problem set: 18 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:25] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/34 constraints. Problems are: Problem set: 18 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/34 constraints. Problems are: Problem set: 18 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 233/389 variables, 156/190 constraints. Problems are: Problem set: 18 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 214/404 constraints. Problems are: Problem set: 18 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:30] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/405 constraints. Problems are: Problem set: 18 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:40] [INFO ] Deduced a trap along path composed of 8 places in 30 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 1/406 constraints. Problems are: Problem set: 18 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 406 constraints, problems are : Problem set: 18 solved, 214 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 214/232 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 58194ms problems are : Problem set: 18 solved, 214 unsolved
Search for dead transitions found 18 dead transitions in 58196ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 156/203 places, 215/295 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 155 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 155 transition count 214
Applied a total of 2 rules in 8 ms. Remains 155 /156 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 155 cols
[2025-06-02 17:18:52] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:18:52] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 17:18:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:18:52] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/203 places, 214/295 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59260 ms. Remains : 155/203 places, 214/295 transitions.
[2025-06-02 17:18:52] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:18:52] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:18:52] [INFO ] Input system was already deterministic with 214 transitions.
[2025-06-02 17:18:52] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:18:52] [INFO ] Flatten gal took : 12 ms
[2025-06-02 17:18:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality2657461542154113967.gal : 11 ms
[2025-06-02 17:18:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality10821304924150401437.ctl : 6 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/CTLCardinality2657461542154113967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10821304924150401437.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,558361,2.42667,58320,2,5934,5,168135,6,0,835,242705,0
Converting to forward existential form...Done !
original formula: AG((AX((EF(((p3==0)||(p37==1))) * (EG((p127==0)) + AG(((p88==0)&&(p222==1)))))) * ((p206==0)||(p240==1))))
=> equivalent forward existential formula: (([(EY(FwdU(Init,TRUE)) * !(E(TRUE U ((p3==0)||(p37==1)))))] = FALSE * [(FwdU((EY(FwdU(Init,TRUE)) * !(EG((p127=...264
(forward)formula 0,0,2.43519,58320,1,0,8,168135,9,2,846,242705,1
FORMULA FireWire-PT-15-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 295/295 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 202 transition count 295
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 178 transition count 271
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 178 transition count 271
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 168 transition count 256
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 168 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 164 transition count 249
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 164 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 164 transition count 248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 163 transition count 247
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 163 transition count 247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 162 transition count 244
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 162 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 161 transition count 243
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 161 transition count 243
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 160 transition count 240
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 160 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 159 transition count 239
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 159 transition count 239
Applied a total of 88 rules in 23 ms. Remains 159 /203 variables (removed 44) and now considering 239/295 (removed 56) transitions.
// Phase 1: matrix 239 rows 159 cols
[2025-06-02 17:18:55] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:18:55] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-02 17:18:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:18:55] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2025-06-02 17:18:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:00] [INFO ] Deduced a trap composed of 46 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 17:19:00] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:00] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:00] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:00] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:01] [INFO ] Deduced a trap composed of 91 places in 186 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:01] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:01] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:02] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:02] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 21 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:02] [INFO ] Deduced a trap composed of 82 places in 189 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:03] [INFO ] Deduced a trap composed of 82 places in 167 ms of which 35 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:03] [INFO ] Deduced a trap composed of 90 places in 164 ms of which 16 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 13/17 constraints. Problems are: Problem set: 21 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:04] [INFO ] Deduced a trap composed of 77 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:04] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/19 constraints. Problems are: Problem set: 21 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/19 constraints. Problems are: Problem set: 21 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 239/398 variables, 159/178 constraints. Problems are: Problem set: 21 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:12] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 29 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 1/179 constraints. Problems are: Problem set: 21 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:14] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 1/180 constraints. Problems are: Problem set: 21 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:17] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 1/181 constraints. Problems are: Problem set: 21 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/181 constraints. Problems are: Problem set: 21 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:25] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 10 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/398 variables, 1/182 constraints. Problems are: Problem set: 21 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/398 variables, and 182 constraints, problems are : Problem set: 21 solved, 217 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 21 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 4/4 constraints. Problems are: Problem set: 21 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 19/23 constraints. Problems are: Problem set: 21 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:28] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 1/24 constraints. Problems are: Problem set: 21 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 21 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 239/398 variables, 159/183 constraints. Problems are: Problem set: 21 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 217/400 constraints. Problems are: Problem set: 21 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:35] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 1/401 constraints. Problems are: Problem set: 21 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:47] [INFO ] Deduced a trap along path composed of 7 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 1/402 constraints. Problems are: Problem set: 21 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/398 variables, and 402 constraints, problems are : Problem set: 21 solved, 217 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 217/238 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60093ms problems are : Problem set: 21 solved, 217 unsolved
Search for dead transitions found 21 dead transitions in 60096ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 159/203 places, 218/295 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60670 ms. Remains : 159/203 places, 218/295 transitions.
[2025-06-02 17:19:56] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:19:56] [INFO ] Flatten gal took : 25 ms
[2025-06-02 17:19:56] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-02 17:19:56] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:19:56] [INFO ] Flatten gal took : 27 ms
[2025-06-02 17:19:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality6154405957651198436.gal : 23 ms
[2025-06-02 17:19:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality10983118875803376281.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/CTLCardinality6154405957651198436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10983118875803376281.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,492027,1.7649,43748,2,5997,5,125513,6,0,855,177178,0
Converting to forward existential form...Done !
original formula: !(E(EX(AG((EG((p44==0)) * (p143!=1)))) U EX(A((AG((p124==0)) + ((p234==0)&&((p149==0)||(p193==1)))) U (p74==1)))))
=> equivalent forward existential formula: [((EY(FwdU(Init,EX(!(E(TRUE U !((EG((p44==0)) * (p143!=1)))))))) * !(EG(!((p74==1))))) * !(E(!((p74==1)) U (!((!...246
Reverse transition relation is NOT exact ! Due to transitions t3, t20, t37, t49, t53, t57, t60, t64, t71, t72, t80, t84, t85, t100, t103, t105, t114, t116,...310
Detected timeout of ITS tools.
[2025-06-02 17:20:26] [INFO ] Flatten gal took : 20 ms
[2025-06-02 17:20:26] [INFO ] Applying decomposition
[2025-06-02 17:20:26] [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/graph2231358302133109112.txt' '-o' '/tmp/graph2231358302133109112.bin' '-w' '/tmp/graph2231358302133109112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2231358302133109112.bin' '-l' '-1' '-v' '-w' '/tmp/graph2231358302133109112.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:20:26] [INFO ] Decomposing Gal with order
[2025-06-02 17:20:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:20:26] [INFO ] Removed a total of 131 redundant transitions.
[2025-06-02 17:20:26] [INFO ] Flatten gal took : 92 ms
[2025-06-02 17:20:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2025-06-02 17:20:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality12534987448907899276.gal : 7 ms
[2025-06-02 17:20:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality9709957389879924855.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/CTLCardinality12534987448907899276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9709957389879924855.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,492027,0.687936,16712,443,221,18437,10423,590,33610,185,50760,0
Converting to forward existential form...Done !
original formula: !(E(EX(AG((EG((i7.u7.p44==0)) * (i0.u8.p143!=1)))) U EX(A((AG((i8.u20.p124==0)) + ((i0.u8.p234==0)&&((i0.u26.p149==0)||(i8.u42.p193==1)))...181
=> equivalent forward existential formula: [((EY(FwdU(Init,EX(!(E(TRUE U !((EG((i7.u7.p44==0)) * (i0.u8.p143!=1)))))))) * !(EG(!((i3.i0.u12.p74==1))))) * !...315
Reverse transition relation is NOT exact ! Due to transitions t57, t64, t100, t105, t114, t116, t178, t201, t202, t204, t208, t210, i0.u8.t187, i1.u27.t37,...423
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,2.98353,68040,1,0,104101,10423,3347,272005,1096,50760,236790
FORMULA FireWire-PT-15-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 295/295 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 202 transition count 295
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 180 transition count 273
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 180 transition count 273
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 170 transition count 259
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 170 transition count 259
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 166 transition count 252
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 166 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 166 transition count 251
Applied a total of 74 rules in 26 ms. Remains 166 /203 variables (removed 37) and now considering 251/295 (removed 44) transitions.
// Phase 1: matrix 251 rows 166 cols
[2025-06-02 17:20:29] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:20:29] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-06-02 17:20:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:20:30] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2025-06-02 17:20:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:34] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:35] [INFO ] Deduced a trap composed of 77 places in 182 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:35] [INFO ] Deduced a trap composed of 85 places in 195 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:35] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:35] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:35] [INFO ] Deduced a trap composed of 94 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 17:20:36] [INFO ] Deduced a trap composed of 86 places in 177 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:36] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:36] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:37] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:37] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:37] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:37] [INFO ] Deduced a trap composed of 84 places in 179 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:38] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 34 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD159 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:38] [INFO ] Deduced a trap composed of 103 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:38] [INFO ] Deduced a trap composed of 104 places in 159 ms of which 19 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 16/20 constraints. Problems are: Problem set: 27 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:39] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:40] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:40] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/23 constraints. Problems are: Problem set: 27 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/23 constraints. Problems are: Problem set: 27 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 251/417 variables, 166/189 constraints. Problems are: Problem set: 27 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:47] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 1/190 constraints. Problems are: Problem set: 27 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:53] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 1/191 constraints. Problems are: Problem set: 27 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/191 constraints. Problems are: Problem set: 27 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/417 variables, and 191 constraints, problems are : Problem set: 27 solved, 223 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 27 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 27 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 4/4 constraints. Problems are: Problem set: 27 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 21/25 constraints. Problems are: Problem set: 27 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/25 constraints. Problems are: Problem set: 27 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 251/417 variables, 166/191 constraints. Problems are: Problem set: 27 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 223/414 constraints. Problems are: Problem set: 27 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/414 constraints. Problems are: Problem set: 27 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 414 constraints, problems are : Problem set: 27 solved, 223 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 223/250 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60061ms problems are : Problem set: 27 solved, 223 unsolved
Search for dead transitions found 27 dead transitions in 60062ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 166/203 places, 224/295 transitions.
Applied a total of 0 rules in 3 ms. Remains 166 /166 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60519 ms. Remains : 166/203 places, 224/295 transitions.
[2025-06-02 17:21:30] [INFO ] Flatten gal took : 18 ms
[2025-06-02 17:21:30] [INFO ] Flatten gal took : 19 ms
[2025-06-02 17:21:30] [INFO ] Input system was already deterministic with 224 transitions.
[2025-06-02 17:21:30] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:21:30] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:21:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality13409587401699011978.gal : 4 ms
[2025-06-02 17:21:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11996463020101071123.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/CTLCardinality13409587401699011978.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11996463020101071123.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,551604,2.22481,51004,2,5941,5,143474,6,0,889,205493,0
Converting to forward existential form...Done !
original formula: EX((EF((p205==0)) * (!(A(((p229==0)||(p171==1)) U ((p104==0)||(p3==1)))) + (AG((p10==0)) * (EF((p138==0)) + (((p37==0)||(p143==1))&&((p20...177
=> equivalent forward existential formula: (([(FwdU((EY(Init) * E(TRUE U (p205==0))),!(((p104==0)||(p3==1)))) * (!(((p229==0)||(p171==1))) * !(((p104==0)||...482
Reverse transition relation is NOT exact ! Due to transitions t3, t13, t49, t53, t57, t60, t61, t64, t67, t73, t81, t85, t86, t88, t101, t104, t107, t117, ...315
Hit Full ! (commute/partial/dont) 220/4/4
(forward)formula 0,0,16.8037,352216,1,0,481,2.24983e+06,492,242,5825,1.18274e+06,585
FORMULA FireWire-PT-15-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 295/295 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 202 transition count 295
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 177 transition count 270
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 177 transition count 270
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 63 place count 165 transition count 252
Iterating global reduction 1 with 12 rules applied. Total rules applied 75 place count 165 transition count 252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 161 transition count 245
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 161 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 161 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 160 transition count 243
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 160 transition count 243
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 159 transition count 240
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 159 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 158 transition count 239
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 158 transition count 239
Applied a total of 90 rules in 11 ms. Remains 158 /203 variables (removed 45) and now considering 239/295 (removed 56) transitions.
// Phase 1: matrix 239 rows 158 cols
[2025-06-02 17:21:47] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:21:47] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-02 17:21:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:21:47] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2025-06-02 17:21:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:51] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:51] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:52] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:52] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:52] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:52] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:53] [INFO ] Deduced a trap composed of 78 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:53] [INFO ] Deduced a trap composed of 61 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:53] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:53] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:54] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 30 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:54] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 25 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 12/16 constraints. Problems are: Problem set: 22 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:55] [INFO ] Deduced a trap composed of 90 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 17:21:56] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/18 constraints. Problems are: Problem set: 22 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:59] [INFO ] Deduced a trap composed of 84 places in 179 ms of which 26 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/19 constraints. Problems are: Problem set: 22 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:01] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:01] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/21 constraints. Problems are: Problem set: 22 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:02] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:02] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 2/23 constraints. Problems are: Problem set: 22 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:07] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/24 constraints. Problems are: Problem set: 22 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/24 constraints. Problems are: Problem set: 22 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 239/397 variables, 158/182 constraints. Problems are: Problem set: 22 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/182 constraints. Problems are: Problem set: 22 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 397/397 variables, and 182 constraints, problems are : Problem set: 22 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 4/4 constraints. Problems are: Problem set: 22 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/24 constraints. Problems are: Problem set: 22 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/24 constraints. Problems are: Problem set: 22 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 239/397 variables, 158/182 constraints. Problems are: Problem set: 22 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 216/398 constraints. Problems are: Problem set: 22 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:24] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 1/399 constraints. Problems are: Problem set: 22 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/399 constraints. Problems are: Problem set: 22 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 397/397 variables, and 399 constraints, problems are : Problem set: 22 solved, 216 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 216/238 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 22 solved, 216 unsolved
Search for dead transitions found 22 dead transitions in 60053ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 158/203 places, 217/295 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60476 ms. Remains : 158/203 places, 217/295 transitions.
[2025-06-02 17:22:47] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:22:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:22:47] [INFO ] Input system was already deterministic with 217 transitions.
[2025-06-02 17:22:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:22:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:22:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality3553719977349968753.gal : 3 ms
[2025-06-02 17:22:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality2529245751863697884.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/CTLCardinality3553719977349968753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2529245751863697884.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,481318,1.63228,42184,2,5332,5,120285,6,0,850,168917,0
Converting to forward existential form...Done !
original formula: EG(AG(EX(((p139==0) + AG(((p145==0)||(p84==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(EX(((p139==0) + !(E(TRUE U !(((p145==0)||(p84==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t36, t48, t52, t56, t59, t63, t71, t79, t83, t84, t99, t102, t104, t113, t115, t179, t189...299
(forward)formula 0,0,19.6622,430880,1,0,483,2.95148e+06,462,256,5634,1.51025e+06,595
FORMULA FireWire-PT-15-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 295/295 transitions.
Graph (trivial) has 149 edges and 203 vertex of which 11 / 203 are part of one of the 3 SCC in 4 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 521 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 193 transition count 256
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 164 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 163 transition count 254
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 63 place count 163 transition count 246
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 79 place count 155 transition count 246
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 95 place count 139 transition count 230
Iterating global reduction 3 with 16 rules applied. Total rules applied 111 place count 139 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 139 transition count 229
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 112 place count 139 transition count 225
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 120 place count 135 transition count 225
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 128 place count 127 transition count 213
Iterating global reduction 4 with 8 rules applied. Total rules applied 136 place count 127 transition count 213
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 124 transition count 207
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 124 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 124 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 145 place count 123 transition count 205
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 146 place count 122 transition count 204
Iterating global reduction 6 with 1 rules applied. Total rules applied 147 place count 122 transition count 204
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 148 place count 121 transition count 201
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 121 transition count 201
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 150 place count 120 transition count 200
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 120 transition count 200
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 152 place count 119 transition count 197
Iterating global reduction 6 with 1 rules applied. Total rules applied 153 place count 119 transition count 197
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 154 place count 118 transition count 196
Iterating global reduction 6 with 1 rules applied. Total rules applied 155 place count 118 transition count 196
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 156 place count 117 transition count 193
Iterating global reduction 6 with 1 rules applied. Total rules applied 157 place count 117 transition count 193
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 116 transition count 192
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 116 transition count 192
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 115 transition count 189
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 115 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 114 transition count 188
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 114 transition count 188
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 113 transition count 186
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 113 transition count 186
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 183 place count 104 transition count 177
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 185 place count 102 transition count 173
Iterating global reduction 6 with 2 rules applied. Total rules applied 187 place count 102 transition count 173
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 6 with 2 rules applied. Total rules applied 189 place count 101 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 190 place count 100 transition count 171
Applied a total of 190 rules in 80 ms. Remains 100 /203 variables (removed 103) and now considering 171/295 (removed 124) transitions.
[2025-06-02 17:23:07] [INFO ] Flow matrix only has 168 transitions (discarded 3 similar events)
// Phase 1: matrix 168 rows 100 cols
[2025-06-02 17:23:07] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:23:07] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-02 17:23:07] [INFO ] Flow matrix only has 168 transitions (discarded 3 similar events)
[2025-06-02 17:23:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:23:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:23:08] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:23:08] [INFO ] Redundant transitions in 11 ms returned []
Running 166 sub problems to find dead transitions.
[2025-06-02 17:23:08] [INFO ] Flow matrix only has 168 transitions (discarded 3 similar events)
[2025-06-02 17:23:08] [INFO ] Invariant cache hit.
[2025-06-02 17:23:08] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:09] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:09] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:09] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:10] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:10] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 20 ms to minimize.
Problem TDEAD60 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:10] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:10] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 16 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:10] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 15 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:11] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 167/266 variables, 99/112 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 1/113 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/113 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 1/267 variables, 1/114 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/114 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 0/267 variables, 0/114 constraints. Problems are: Problem set: 15 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/268 variables, and 114 constraints, problems are : Problem set: 15 solved, 151 unsolved in 14351 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 167/266 variables, 99/112 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 1/113 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 151/264 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/264 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 1/267 variables, 1/265 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/265 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 9 (OVERLAPS) 0/267 variables, 0/265 constraints. Problems are: Problem set: 15 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/268 variables, and 265 constraints, problems are : Problem set: 15 solved, 151 unsolved in 18019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 151/166 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32434ms problems are : Problem set: 15 solved, 151 unsolved
Search for dead transitions found 15 dead transitions in 32435ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 100/203 places, 156/295 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 155
Applied a total of 2 rules in 13 ms. Remains 99 /100 variables (removed 1) and now considering 155/156 (removed 1) transitions.
[2025-06-02 17:23:40] [INFO ] Flow matrix only has 152 transitions (discarded 3 similar events)
// Phase 1: matrix 152 rows 99 cols
[2025-06-02 17:23:40] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:23:40] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-02 17:23:40] [INFO ] Flow matrix only has 152 transitions (discarded 3 similar events)
[2025-06-02 17:23:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:23:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:23:41] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 99/203 places, 155/295 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 33339 ms. Remains : 99/203 places, 155/295 transitions.
[2025-06-02 17:23:41] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:23:41] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:23:41] [INFO ] Input system was already deterministic with 155 transitions.
[2025-06-02 17:23:41] [INFO ] Flatten gal took : 18 ms
[2025-06-02 17:23:41] [INFO ] Flatten gal took : 17 ms
[2025-06-02 17:23:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15011917128304955523.gal : 6 ms
[2025-06-02 17:23:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3544616184788938482.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15011917128304955523.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3544616184788938482.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (2978 resets) in 471 ms. (84 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality3544616184788938482.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 49
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :49 after 73
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :73 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 175
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :175 after 392
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :392 after 1265
BEST_FIRST walk for 40004 steps (1112 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1063 steps, run visited all 1 properties in 12 ms. (steps per millisecond=88 )
Probabilistic random walk after 1063 steps, saw 444 distinct states, run finished after 12 ms. (steps per millisecond=88 ) properties seen :1
FORMULA FireWire-PT-15-CTLCardinality-2025-06 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 SI_CTL mode, iteration 0 : 203/203 places, 295/295 transitions.
Graph (trivial) has 149 edges and 203 vertex of which 11 / 203 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 521 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 193 transition count 256
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 164 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 163 transition count 254
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 63 place count 163 transition count 246
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 79 place count 155 transition count 246
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 95 place count 139 transition count 230
Iterating global reduction 3 with 16 rules applied. Total rules applied 111 place count 139 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 139 transition count 229
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 112 place count 139 transition count 225
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 120 place count 135 transition count 225
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 128 place count 127 transition count 213
Iterating global reduction 4 with 8 rules applied. Total rules applied 136 place count 127 transition count 213
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 124 transition count 207
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 124 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 124 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 145 place count 123 transition count 205
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 146 place count 122 transition count 204
Iterating global reduction 6 with 1 rules applied. Total rules applied 147 place count 122 transition count 204
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 148 place count 121 transition count 201
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 121 transition count 201
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 150 place count 120 transition count 200
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 120 transition count 200
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 152 place count 119 transition count 197
Iterating global reduction 6 with 1 rules applied. Total rules applied 153 place count 119 transition count 197
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 154 place count 118 transition count 196
Iterating global reduction 6 with 1 rules applied. Total rules applied 155 place count 118 transition count 196
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 156 place count 117 transition count 193
Iterating global reduction 6 with 1 rules applied. Total rules applied 157 place count 117 transition count 193
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 116 transition count 192
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 116 transition count 192
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 115 transition count 189
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 115 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 114 transition count 188
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 114 transition count 188
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 113 transition count 186
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 113 transition count 186
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 183 place count 104 transition count 177
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 185 place count 102 transition count 173
Iterating global reduction 6 with 2 rules applied. Total rules applied 187 place count 102 transition count 173
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 6 with 2 rules applied. Total rules applied 189 place count 101 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 190 place count 100 transition count 171
Applied a total of 190 rules in 100 ms. Remains 100 /203 variables (removed 103) and now considering 171/295 (removed 124) transitions.
[2025-06-02 17:23:41] [INFO ] Flow matrix only has 168 transitions (discarded 3 similar events)
// Phase 1: matrix 168 rows 100 cols
[2025-06-02 17:23:41] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:23:41] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-02 17:23:41] [INFO ] Flow matrix only has 168 transitions (discarded 3 similar events)
[2025-06-02 17:23:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:23:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:23:41] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:23:41] [INFO ] Redundant transitions in 6 ms returned []
Running 166 sub problems to find dead transitions.
[2025-06-02 17:23:41] [INFO ] Flow matrix only has 168 transitions (discarded 3 similar events)
[2025-06-02 17:23:41] [INFO ] Invariant cache hit.
[2025-06-02 17:23:41] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:42] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:42] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:42] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:43] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:43] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:43] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:43] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 20 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:43] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 15 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:43] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:44] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 167/266 variables, 99/113 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 1/114 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/114 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 1/267 variables, 1/115 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/115 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 0/267 variables, 0/115 constraints. Problems are: Problem set: 15 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/268 variables, and 115 constraints, problems are : Problem set: 15 solved, 151 unsolved in 10913 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:53] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/15 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 167/266 variables, 99/114 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 1/115 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 151/266 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/266 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 1/267 variables, 1/267 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 0/267 constraints. Problems are: Problem set: 15 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/267 variables, 0/267 constraints. Problems are: Problem set: 15 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/268 variables, and 267 constraints, problems are : Problem set: 15 solved, 151 unsolved in 23897 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 151/166 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34835ms problems are : Problem set: 15 solved, 151 unsolved
Search for dead transitions found 15 dead transitions in 34837ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 100/203 places, 156/295 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 155
Applied a total of 2 rules in 13 ms. Remains 99 /100 variables (removed 1) and now considering 155/156 (removed 1) transitions.
[2025-06-02 17:24:16] [INFO ] Flow matrix only has 152 transitions (discarded 3 similar events)
// Phase 1: matrix 152 rows 99 cols
[2025-06-02 17:24:16] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:24:16] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-02 17:24:16] [INFO ] Flow matrix only has 152 transitions (discarded 3 similar events)
[2025-06-02 17:24:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:24:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:24:17] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 99/203 places, 155/295 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 35843 ms. Remains : 99/203 places, 155/295 transitions.
[2025-06-02 17:24:17] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:24:17] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:24:17] [INFO ] Input system was already deterministic with 155 transitions.
[2025-06-02 17:24:17] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:24:17] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:24:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14727356829305961103.gal : 6 ms
[2025-06-02 17:24:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13509873494321468506.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/ReachabilityCardinality14727356829305961103.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13509873494321468506.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (2997 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality13509873494321468506.prop.
BEST_FIRST walk for 40002 steps (1084 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 49
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :49 after 73
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :73 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 175
Finished probabilistic random walk after 1142 steps, run visited all 1 properties in 15 ms. (steps per millisecond=76 )
Probabilistic random walk after 1142 steps, saw 486 distinct states, run finished after 15 ms. (steps per millisecond=76 ) properties seen :1
FORMULA FireWire-PT-15-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :175 after 392
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 295/295 transitions.
Graph (trivial) has 139 edges and 203 vertex of which 9 / 203 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 196 transition count 262
Reduce places removed 26 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 29 rules applied. Total rules applied 56 place count 170 transition count 259
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 60 place count 167 transition count 258
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 60 place count 167 transition count 250
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 76 place count 159 transition count 250
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 90 place count 145 transition count 236
Iterating global reduction 3 with 14 rules applied. Total rules applied 104 place count 145 transition count 236
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 104 place count 145 transition count 232
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 141 transition count 232
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 120 place count 133 transition count 220
Iterating global reduction 3 with 8 rules applied. Total rules applied 128 place count 133 transition count 220
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 131 place count 130 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 134 place count 130 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 130 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 137 place count 129 transition count 212
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 128 transition count 211
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 128 transition count 211
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 127 transition count 208
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 127 transition count 208
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 126 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 126 transition count 207
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 125 transition count 204
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 125 transition count 204
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 124 transition count 203
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 124 transition count 203
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 123 transition count 200
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 123 transition count 200
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 163 place count 116 transition count 193
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 165 place count 114 transition count 189
Iterating global reduction 5 with 2 rules applied. Total rules applied 167 place count 114 transition count 189
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 5 with 2 rules applied. Total rules applied 169 place count 113 transition count 188
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 113 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 171 place count 112 transition count 187
Applied a total of 171 rules in 73 ms. Remains 112 /203 variables (removed 91) and now considering 187/295 (removed 108) transitions.
[2025-06-02 17:24:17] [INFO ] Flow matrix only has 185 transitions (discarded 2 similar events)
// Phase 1: matrix 185 rows 112 cols
[2025-06-02 17:24:17] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:24:17] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-02 17:24:17] [INFO ] Flow matrix only has 185 transitions (discarded 2 similar events)
[2025-06-02 17:24:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:24:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:24:17] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:24:17] [INFO ] Redundant transitions in 13 ms returned []
Running 183 sub problems to find dead transitions.
[2025-06-02 17:24:17] [INFO ] Flow matrix only has 185 transitions (discarded 2 similar events)
[2025-06-02 17:24:17] [INFO ] Invariant cache hit.
[2025-06-02 17:24:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:19] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:19] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:19] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 9 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:20] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 15 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:20] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 15 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 5/7 constraints. Problems are: Problem set: 18 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:21] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/8 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 1/111 variables, 2/10 constraints. Problems are: Problem set: 18 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:24] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:25] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:25] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 3/13 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/13 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 184/295 variables, 111/124 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 1/125 constraints. Problems are: Problem set: 18 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:29] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 1/126 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/126 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 1/296 variables, 1/127 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 0/127 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 0/296 variables, 0/127 constraints. Problems are: Problem set: 18 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/297 variables, and 127 constraints, problems are : Problem set: 18 solved, 165 unsolved in 25158 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 2/2 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 10/12 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 2/14 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 184/295 variables, 111/125 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 1/126 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 157/283 constraints. Problems are: Problem set: 18 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:49] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 1/284 constraints. Problems are: Problem set: 18 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:56] [INFO ] Deduced a trap along path composed of 5 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 1/285 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/285 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 1/296 variables, 1/286 constraints. Problems are: Problem set: 18 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 8/294 constraints. Problems are: Problem set: 18 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/297 variables, and 294 constraints, problems are : Problem set: 18 solved, 165 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 165/183 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55208ms problems are : Problem set: 18 solved, 165 unsolved
Search for dead transitions found 18 dead transitions in 55209ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 112/203 places, 169/295 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:25:13] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 55771 ms. Remains : 112/203 places, 169/295 transitions.
[2025-06-02 17:25:13] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:25:13] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:25:13] [INFO ] Input system was already deterministic with 169 transitions.
[2025-06-02 17:25:13] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:25:13] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:25:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality16925315687048838961.gal : 2 ms
[2025-06-02 17:25:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality16659760935710654595.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/CTLCardinality16925315687048838961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16659760935710654595.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,136111,0.32258,13540,2,1916,5,32813,6,0,612,36722,0
Converting to forward existential form...Done !
original formula: EG(AG(((E(((((p235==0)||(p167==1))&&((p85==0)||(p102==1)))||((p65==1)&&(p208==1))) U AG(((p238==0)||(p37==1)))) + (p180==0)) + ((p75==1)|...168
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((E(((((p235==0)||(p167==1))&&((p85==0)||(p102==1)))||((p65==1)&&(p208==1))) U !(E(TRUE ...235
Reverse transition relation is NOT exact ! Due to transitions t22, t28, t37, t39, t40, t45, t46, t48, t54, t55, t91, t106, t112, t123, t125, t148, t149, t1...295
(forward)formula 0,1,4.18678,97240,1,0,384,547852,366,195,4532,411260,449
FORMULA FireWire-PT-15-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 295/295 transitions.
Graph (trivial) has 150 edges and 203 vertex of which 11 / 203 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 521 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 194 transition count 256
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 164 transition count 255
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 63 place count 164 transition count 247
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 79 place count 156 transition count 247
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 95 place count 140 transition count 231
Iterating global reduction 2 with 16 rules applied. Total rules applied 111 place count 140 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 140 transition count 230
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 112 place count 140 transition count 226
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 120 place count 136 transition count 226
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 128 place count 128 transition count 214
Iterating global reduction 3 with 8 rules applied. Total rules applied 136 place count 128 transition count 214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 139 place count 125 transition count 208
Iterating global reduction 3 with 3 rules applied. Total rules applied 142 place count 125 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 125 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 145 place count 124 transition count 206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 123 transition count 205
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 123 transition count 205
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 122 transition count 202
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 122 transition count 202
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 150 place count 121 transition count 201
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 121 transition count 201
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 152 place count 120 transition count 198
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 120 transition count 198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 119 transition count 197
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 119 transition count 197
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 156 place count 118 transition count 194
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 118 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 158 place count 117 transition count 193
Iterating global reduction 5 with 1 rules applied. Total rules applied 159 place count 117 transition count 193
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 160 place count 116 transition count 190
Iterating global reduction 5 with 1 rules applied. Total rules applied 161 place count 116 transition count 190
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 115 transition count 189
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 115 transition count 189
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 114 transition count 187
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 114 transition count 187
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 187 place count 103 transition count 176
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 189 place count 101 transition count 172
Iterating global reduction 5 with 2 rules applied. Total rules applied 191 place count 101 transition count 172
Applied a total of 191 rules in 59 ms. Remains 101 /203 variables (removed 102) and now considering 172/295 (removed 123) transitions.
[2025-06-02 17:25:17] [INFO ] Flow matrix only has 169 transitions (discarded 3 similar events)
// Phase 1: matrix 169 rows 101 cols
[2025-06-02 17:25:17] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:25:17] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 17:25:17] [INFO ] Flow matrix only has 169 transitions (discarded 3 similar events)
[2025-06-02 17:25:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:25:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 17:25:17] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:25:17] [INFO ] Redundant transitions in 2 ms returned []
Running 171 sub problems to find dead transitions.
[2025-06-02 17:25:17] [INFO ] Flow matrix only has 169 transitions (discarded 3 similar events)
[2025-06-02 17:25:17] [INFO ] Invariant cache hit.
[2025-06-02 17:25:17] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:20] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:20] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:20] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 19 ms to minimize.
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:20] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:21] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 15 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:21] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:21] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 16 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:21] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 168/269 variables, 101/113 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 1/114 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/114 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 1/270 variables, 1/115 constraints. Problems are: Problem set: 15 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:27] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 1/116 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/116 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 0/270 variables, 0/116 constraints. Problems are: Problem set: 15 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 116 constraints, problems are : Problem set: 15 solved, 156 unsolved in 16956 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 168/269 variables, 101/114 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 1/115 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 156/271 constraints. Problems are: Problem set: 15 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:41] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 1/272 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/272 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 1/270 variables, 1/273 constraints. Problems are: Problem set: 15 solved, 156 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 273 constraints, problems are : Problem set: 15 solved, 156 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 156/171 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46992ms problems are : Problem set: 15 solved, 156 unsolved
Search for dead transitions found 15 dead transitions in 46999ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 101/203 places, 157/295 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 156
Applied a total of 2 rules in 8 ms. Remains 100 /101 variables (removed 1) and now considering 156/157 (removed 1) transitions.
[2025-06-02 17:26:04] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
// Phase 1: matrix 153 rows 100 cols
[2025-06-02 17:26:04] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:04] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-06-02 17:26:04] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
[2025-06-02 17:26:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 17:26:05] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 100/203 places, 156/295 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 47838 ms. Remains : 100/203 places, 156/295 transitions.
[2025-06-02 17:26:05] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:26:05] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:26:05] [INFO ] Input system was already deterministic with 156 transitions.
[2025-06-02 17:26:05] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:26:05] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:26:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality1954999574839776721.gal : 2 ms
[2025-06-02 17:26:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality452042774292856514.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/CTLCardinality1954999574839776721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality452042774292856514.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,82214,0.509776,13576,2,1910,5,32142,6,0,554,36365,0
Converting to forward existential form...Done !
original formula: AF(AG(((p0==0)&&(p208==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p0==0)&&(p208==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t29, t36, t38, t43, t44, t46, t52, t53, t104, t113, t117, t135, t136, t137, t139, t141, ...279
(forward)formula 0,0,4.4727,111344,1,0,657,527208,336,390,3911,580992,602
FORMULA FireWire-PT-15-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 295/295 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 202 transition count 295
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 181 transition count 274
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 181 transition count 274
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 172 transition count 262
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 172 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 169 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 169 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 168 transition count 255
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 168 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 167 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 167 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 166 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 166 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 165 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 165 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 164 transition count 247
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 164 transition count 247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 163 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 163 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 162 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 162 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 161 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 161 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 160 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 160 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 159 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 159 transition count 237
Applied a total of 87 rules in 19 ms. Remains 159 /203 variables (removed 44) and now considering 237/295 (removed 58) transitions.
// Phase 1: matrix 237 rows 159 cols
[2025-06-02 17:26:09] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:09] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-02 17:26:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:10] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2025-06-02 17:26:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:14] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:14] [INFO ] Deduced a trap composed of 81 places in 171 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:14] [INFO ] Deduced a trap composed of 83 places in 174 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:15] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:15] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:15] [INFO ] Deduced a trap composed of 84 places in 181 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:15] [INFO ] Deduced a trap composed of 86 places in 155 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:15] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:15] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:16] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:16] [INFO ] Deduced a trap composed of 93 places in 165 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:16] [INFO ] Deduced a trap composed of 85 places in 168 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:17] [INFO ] Deduced a trap composed of 83 places in 163 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:17] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:17] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 27 ms to minimize.
Problem TDEAD131 is UNSAT
Problem TDEAD144 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:18] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 16 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 16/20 constraints. Problems are: Problem set: 18 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/20 constraints. Problems are: Problem set: 18 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 237/396 variables, 159/179 constraints. Problems are: Problem set: 18 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/179 constraints. Problems are: Problem set: 18 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/179 constraints. Problems are: Problem set: 18 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 179 constraints, problems are : Problem set: 18 solved, 218 unsolved in 27310 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 16/20 constraints. Problems are: Problem set: 18 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/20 constraints. Problems are: Problem set: 18 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 237/396 variables, 159/179 constraints. Problems are: Problem set: 18 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 218/397 constraints. Problems are: Problem set: 18 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:45] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:45] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 2/399 constraints. Problems are: Problem set: 18 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:55] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 1/400 constraints. Problems are: Problem set: 18 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:05] [INFO ] Deduced a trap along path composed of 7 places in 42 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 1)
(t4 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 401 constraints, problems are : Problem set: 18 solved, 218 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 218/236 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57353ms problems are : Problem set: 18 solved, 218 unsolved
Search for dead transitions found 18 dead transitions in 57354ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 159/203 places, 219/295 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 158 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 157 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 157 transition count 217
Applied a total of 4 rules in 9 ms. Remains 157 /159 variables (removed 2) and now considering 217/219 (removed 2) transitions.
// Phase 1: matrix 217 rows 157 cols
[2025-06-02 17:27:07] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:27:07] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-02 17:27:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:27:08] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 157/203 places, 217/295 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58385 ms. Remains : 157/203 places, 217/295 transitions.
[2025-06-02 17:27:08] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:27:08] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:27:08] [INFO ] Input system was already deterministic with 217 transitions.
[2025-06-02 17:27:08] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:27:08] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:27:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality15169993875695147982.gal : 2 ms
[2025-06-02 17:27:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality6540067886827470899.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/CTLCardinality15169993875695147982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6540067886827470899.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,532334,2.0524,47492,2,5383,5,129980,6,0,846,192291,0
Converting to forward existential form...Done !
original formula: EG(A(A(A(EG((p187==1)) U (p184!=1)) U AG((p205!=0))) U AX(((AG(((p96==0)||(p23==1))) * (p163==0)) * ((p169==0)&&((p206==0)||(p173==1)))))...157
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EX(!(((!(E(TRUE U !(((p96==0)||(p23==1))))) * (p163==0)) * ((p169==0)&&((p206==0)||(p173==1)...585
Reverse transition relation is NOT exact ! Due to transitions t3, t12, t25, t39, t53, t57, t61, t64, t65, t68, t76, t84, t88, t89, t104, t107, t110, t119, ...315
Detected timeout of ITS tools.
[2025-06-02 17:27:38] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:27:38] [INFO ] Applying decomposition
[2025-06-02 17:27:38] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph64581281723608977.txt' '-o' '/tmp/graph64581281723608977.bin' '-w' '/tmp/graph64581281723608977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph64581281723608977.bin' '-l' '-1' '-v' '-w' '/tmp/graph64581281723608977.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:27:38] [INFO ] Decomposing Gal with order
[2025-06-02 17:27:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:27:38] [INFO ] Removed a total of 136 redundant transitions.
[2025-06-02 17:27:38] [INFO ] Flatten gal took : 22 ms
[2025-06-02 17:27:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2025-06-02 17:27:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality11967991538234018024.gal : 5 ms
[2025-06-02 17:27:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality11894466354350892656.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/CTLCardinality11967991538234018024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11894466354350892656.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,532334,0.307205,11180,322,188,10535,6739,582,16600,166,20610,0
Converting to forward existential form...Done !
original formula: EG(A(A(A(EG((i7.u37.p187==1)) U (i9.u36.p184!=1)) U AG((i7.u44.p205!=0))) U AX(((AG(((i5.i0.u15.p96==0)||(i2.i0.u7.p23==1))) * (i0.u30.p1...227
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EX(!(((!(E(TRUE U !(((i5.i0.u15.p96==0)||(i2.i0.u7.p23==1))))) * (i0.u30.p163==0)) * ((i5.i1...781
Reverse transition relation is NOT exact ! Due to transitions t25, t53, t61, t68, t104, t110, t119, t177, t200, t201, t202, t206, t207, t209, i0.u30.t39, i...422
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,1.67566,42412,1,0,65703,8263,3444,162244,1065,21821,128609
FORMULA FireWire-PT-15-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 295/295 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 202 transition count 295
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 180 transition count 273
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 180 transition count 273
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 170 transition count 259
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 170 transition count 259
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 167 transition count 253
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 167 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 167 transition count 252
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 166 transition count 251
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 166 transition count 251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 165 transition count 248
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 165 transition count 248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 164 transition count 247
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 164 transition count 247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 163 transition count 244
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 163 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 162 transition count 243
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 162 transition count 243
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 161 transition count 240
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 161 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 160 transition count 239
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 160 transition count 239
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 159 transition count 236
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 159 transition count 236
Applied a total of 88 rules in 33 ms. Remains 159 /203 variables (removed 44) and now considering 236/295 (removed 59) transitions.
// Phase 1: matrix 236 rows 159 cols
[2025-06-02 17:27:40] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:27:40] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-02 17:27:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:27:40] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2025-06-02 17:27:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:44] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:44] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:44] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:44] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:44] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:44] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:45] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:45] [INFO ] Deduced a trap composed of 85 places in 160 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:45] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 10 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 9/13 constraints. Problems are: Problem set: 17 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:47] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:47] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:47] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:47] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:48] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 5/18 constraints. Problems are: Problem set: 17 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/18 constraints. Problems are: Problem set: 17 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 236/395 variables, 159/177 constraints. Problems are: Problem set: 17 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:55] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 1/178 constraints. Problems are: Problem set: 17 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/178 constraints. Problems are: Problem set: 17 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/395 variables, 0/178 constraints. Problems are: Problem set: 17 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 178 constraints, problems are : Problem set: 17 solved, 218 unsolved in 27170 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 4/4 constraints. Problems are: Problem set: 17 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 15/19 constraints. Problems are: Problem set: 17 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:09] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:10] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:10] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 3/22 constraints. Problems are: Problem set: 17 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/22 constraints. Problems are: Problem set: 17 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 236/395 variables, 159/181 constraints. Problems are: Problem set: 17 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 218/399 constraints. Problems are: Problem set: 17 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:18] [INFO ] Deduced a trap composed of 79 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:18] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:18] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 3/402 constraints. Problems are: Problem set: 17 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:24] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/403 constraints. Problems are: Problem set: 17 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 403 constraints, problems are : Problem set: 17 solved, 218 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 218/235 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57224ms problems are : Problem set: 17 solved, 218 unsolved
Search for dead transitions found 17 dead transitions in 57226ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 159/203 places, 219/295 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57725 ms. Remains : 159/203 places, 219/295 transitions.
[2025-06-02 17:28:37] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:28:37] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:28:37] [INFO ] Input system was already deterministic with 219 transitions.
[2025-06-02 17:28:37] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:28:37] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:28:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality2406328479010747341.gal : 2 ms
[2025-06-02 17:28:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality1804565498908298883.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/CTLCardinality2406328479010747341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1804565498908298883.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,506798,1.75493,42960,2,5134,5,124878,6,0,856,182526,0
Converting to forward existential form...Done !
original formula: EF((A(((p176==0) * EX(!(((p188==0)||(p237==1))))) U ((p166==0)||(p82==1))) * (AX((((p120==0)||((p148==0)&&(p144==1))) * AF((p184==1)))) +...168
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((E(!(((p166==0)||(p82==1))) U (!(((p176==0) * EX(!(((p188==0)||(p237==1)))))) * !(((p166...480
Reverse transition relation is NOT exact ! Due to transitions t3, t25, t39, t52, t57, t61, t64, t68, t76, t85, t89, t90, t105, t108, t110, t119, t121, t180...305
(forward)formula 0,1,27.782,614832,1,0,724,4.4241e+06,470,373,5468,2.91021e+06,862
FORMULA FireWire-PT-15-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 295/295 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 202 transition count 295
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 178 transition count 271
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 178 transition count 271
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 166 transition count 253
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 166 transition count 253
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 162 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 162 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 162 transition count 245
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 161 transition count 244
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 161 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 160 transition count 241
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 160 transition count 241
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 159 transition count 240
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 159 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 158 transition count 237
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 158 transition count 237
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 157 transition count 236
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 157 transition count 236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 156 transition count 233
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 156 transition count 233
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 155 transition count 232
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 155 transition count 232
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 154 transition count 229
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 154 transition count 229
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 153 transition count 228
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 153 transition count 228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 152 transition count 226
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 152 transition count 226
Applied a total of 102 rules in 17 ms. Remains 152 /203 variables (removed 51) and now considering 226/295 (removed 69) transitions.
// Phase 1: matrix 226 rows 152 cols
[2025-06-02 17:29:05] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:29:06] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-06-02 17:29:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:29:06] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2025-06-02 17:29:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:10] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:10] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:10] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:10] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:11] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:11] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:11] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:11] [INFO ] Deduced a trap composed of 80 places in 177 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:12] [INFO ] Deduced a trap composed of 75 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 17:29:12] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 17 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:13] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:13] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:14] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 2/17 constraints. Problems are: Problem set: 15 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:16] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:16] [INFO ] Deduced a trap composed of 78 places in 178 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:16] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:16] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:16] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:16] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 6/23 constraints. Problems are: Problem set: 15 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:19] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:19] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 2/25 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/25 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 226/378 variables, 152/177 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/177 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/177 constraints. Problems are: Problem set: 15 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 177 constraints, problems are : Problem set: 15 solved, 210 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 21/25 constraints. Problems are: Problem set: 15 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:38] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 1/26 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/26 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 226/378 variables, 152/178 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 210/388 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/388 constraints. Problems are: Problem set: 15 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:03] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/378 variables, 1/389 constraints. Problems are: Problem set: 15 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 389 constraints, problems are : Problem set: 15 solved, 210 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 210/225 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60051ms problems are : Problem set: 15 solved, 210 unsolved
Search for dead transitions found 15 dead transitions in 60052ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 152/203 places, 211/295 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 151 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 151 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 150 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 150 transition count 209
Applied a total of 4 rules in 5 ms. Remains 150 /152 variables (removed 2) and now considering 209/211 (removed 2) transitions.
// Phase 1: matrix 209 rows 150 cols
[2025-06-02 17:30:06] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:30:06] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-02 17:30:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:30:06] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/203 places, 209/295 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60968 ms. Remains : 150/203 places, 209/295 transitions.
[2025-06-02 17:30:06] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:30:06] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:30:06] [INFO ] Input system was already deterministic with 209 transitions.
[2025-06-02 17:30:06] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:30:06] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:30:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality17683246955853530125.gal : 3 ms
[2025-06-02 17:30:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality14711225961888824240.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/CTLCardinality17683246955853530125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14711225961888824240.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,529334,2.02678,44224,2,5231,5,117899,6,0,810,173079,0
Converting to forward existential form...Done !
original formula: EG(AX(EX(((p130==0)&&(p90==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX(((p130==0)&&(p90==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t35, t47, t51, t55, t58, t62, t70, t78, t82, t83, t98, t101, t103, t112, t114, t169, t192...311
(forward)formula 0,1,28.6233,547332,1,0,1102,1.96399e+06,439,706,5180,3.43906e+06,951
FORMULA FireWire-PT-15-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 295/295 transitions.
Graph (trivial) has 148 edges and 203 vertex of which 11 / 203 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 521 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 193 transition count 255
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 163 transition count 254
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 63 place count 163 transition count 246
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 79 place count 155 transition count 246
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 94 place count 140 transition count 231
Iterating global reduction 2 with 15 rules applied. Total rules applied 109 place count 140 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 140 transition count 230
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 110 place count 140 transition count 226
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 118 place count 136 transition count 226
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 124 place count 130 transition count 216
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 130 transition count 216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 128 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 128 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 128 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 137 place count 127 transition count 210
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 126 transition count 209
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 126 transition count 209
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 125 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 125 transition count 206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 124 transition count 205
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 124 transition count 205
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 123 transition count 202
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 123 transition count 202
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 122 transition count 201
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 122 transition count 201
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 121 transition count 198
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 121 transition count 198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 150 place count 120 transition count 197
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 120 transition count 197
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 152 place count 119 transition count 194
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 119 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 118 transition count 193
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 118 transition count 193
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 156 place count 117 transition count 191
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 117 transition count 191
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 175 place count 108 transition count 182
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 177 place count 106 transition count 178
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 106 transition count 178
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 5 with 2 rules applied. Total rules applied 181 place count 105 transition count 177
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 105 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 104 transition count 176
Applied a total of 183 rules in 41 ms. Remains 104 /203 variables (removed 99) and now considering 176/295 (removed 119) transitions.
[2025-06-02 17:30:35] [INFO ] Flow matrix only has 173 transitions (discarded 3 similar events)
// Phase 1: matrix 173 rows 104 cols
[2025-06-02 17:30:35] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:30:36] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-06-02 17:30:36] [INFO ] Flow matrix only has 173 transitions (discarded 3 similar events)
[2025-06-02 17:30:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:30:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:30:36] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:30:36] [INFO ] Redundant transitions in 2 ms returned []
Running 171 sub problems to find dead transitions.
[2025-06-02 17:30:36] [INFO ] Flow matrix only has 173 transitions (discarded 3 similar events)
[2025-06-02 17:30:36] [INFO ] Invariant cache hit.
[2025-06-02 17:30:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:37] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:37] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:37] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:37] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:38] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:38] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:38] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 11 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:38] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 24 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:39] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 13 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 172/275 variables, 103/116 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 1/117 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/117 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 1/276 variables, 1/118 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/118 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/118 constraints. Problems are: Problem set: 15 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/277 variables, and 118 constraints, problems are : Problem set: 15 solved, 156 unsolved in 14970 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 172/275 variables, 103/116 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 1/117 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 156/273 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/273 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 1/276 variables, 1/274 constraints. Problems are: Problem set: 15 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:03] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 1/275 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/275 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 0/276 variables, 0/275 constraints. Problems are: Problem set: 15 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/277 variables, and 275 constraints, problems are : Problem set: 15 solved, 156 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 156/171 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45008ms problems are : Problem set: 15 solved, 156 unsolved
Search for dead transitions found 15 dead transitions in 45009ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 104/203 places, 161/295 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 160
Applied a total of 2 rules in 10 ms. Remains 103 /104 variables (removed 1) and now considering 160/161 (removed 1) transitions.
[2025-06-02 17:31:21] [INFO ] Flow matrix only has 157 transitions (discarded 3 similar events)
// Phase 1: matrix 157 rows 103 cols
[2025-06-02 17:31:21] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:31:21] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-02 17:31:21] [INFO ] Flow matrix only has 157 transitions (discarded 3 similar events)
[2025-06-02 17:31:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:31:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:31:21] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 103/203 places, 160/295 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 45843 ms. Remains : 103/203 places, 160/295 transitions.
[2025-06-02 17:31:21] [INFO ] Flatten gal took : 3 ms
[2025-06-02 17:31:21] [INFO ] Flatten gal took : 3 ms
[2025-06-02 17:31:21] [INFO ] Input system was already deterministic with 160 transitions.
[2025-06-02 17:31:21] [INFO ] Flatten gal took : 4 ms
[2025-06-02 17:31:21] [INFO ] Flatten gal took : 4 ms
[2025-06-02 17:31:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality12475286110484072507.gal : 1 ms
[2025-06-02 17:31:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality284811984138658152.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/CTLCardinality12475286110484072507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality284811984138658152.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,88387,0.431529,14080,2,2087,5,33408,6,0,570,37927,0
Converting to forward existential form...Done !
original formula: AG((EF((p191==1)) + ((p214==1) * EF((p37==0)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p214==1) * E(TRUE U (p37==0))))) * !(E(TRUE U (p191==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t14, t24, t31, t38, t40, t41, t45, t46, t48, t54, t55, t107, t116, t120, t138, t139, t140, t1...295
(forward)formula 0,0,4.2667,97012,1,0,399,567836,339,198,3939,344442,467
FORMULA FireWire-PT-15-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-02 17:31:25] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:31:25] [INFO ] Flatten gal took : 8 ms
Total runtime 887479 ms.
BK_STOP 1748885486039
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-15"
export BK_EXAMINATION="CTLCardinality"
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-15, examination is CTLCardinality"
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-174860102300353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-15.tgz
mv FireWire-PT-15 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;