About the Execution of ITS-Tools for Peterson-PT-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1504076.00 | 0.00 | 0.00 | TFFTFTTFTFFTTFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812900602.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 Peterson-PT-3, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812900602
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 189K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 237K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 284K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-CTLFireability-2025-00
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-01
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-02
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-03
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-04
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-05
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-06
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-07
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-08
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-09
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-10
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-11
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-12
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-13
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-14
FORMULA_NAME Peterson-PT-3-CTLFireability-2025-15
=== Now, execution of the tool begins
BK_START 1748940415832
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 08:46:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 08:46:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 08:46:57] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2025-06-03 08:46:57] [INFO ] Transformed 244 places.
[2025-06-03 08:46:57] [INFO ] Transformed 332 transitions.
[2025-06-03 08:46:57] [INFO ] Found NUPN structural information;
[2025-06-03 08:46:57] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Support contains 222 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 20 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2025-06-03 08:46:57] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2025-06-03 08:46:57] [INFO ] Computed 15 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:46:57] [INFO ] Implicit Places using invariants in 287 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 326 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 22 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 382 ms. Remains : 240/244 places, 332/332 transitions.
Support contains 222 out of 240 places after structural reductions.
[2025-06-03 08:46:57] [INFO ] Flatten gal took : 46 ms
[2025-06-03 08:46:57] [INFO ] Flatten gal took : 37 ms
[2025-06-03 08:46:58] [INFO ] Input system was already deterministic with 332 transitions.
Support contains 221 out of 240 places (down from 222) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 54 to 51
RANDOM walk for 40000 steps (8 resets) in 1693 ms. (23 steps per ms) remains 16/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
[2025-06-03 08:46:59] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2025-06-03 08:46:59] [INFO ] Computed 11 invariants in 7 ms
[2025-06-03 08:46:59] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 2 (OVERLAPS) 196/239 variables, 10/53 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 196/249 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:46:59] [INFO ] Deduced a trap composed of 9 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-03 08:46:59] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:46:59] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 7 ms to minimize.
Problem AtomicPropp39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:46:59] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:46:59] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 8 ms to minimize.
Problem AtomicPropp50 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 5/254 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:46:59] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:46:59] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:00] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:00] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 4/258 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:00] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:00] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/260 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/260 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/240 variables, 1/261 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/262 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:01] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:01] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:01] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 3/265 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:01] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 13 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 1/266 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:01] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:01] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 14 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 2/268 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/268 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 308/548 variables, 240/508 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 57/565 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/565 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:03] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:03] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 12 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/548 variables, 2/567 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:03] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 1/568 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/548 variables, and 568 constraints, problems are : Problem set: 4 solved, 11 unsolved in 5010 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 203/226 variables, 6/29 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 203/232 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/232 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/228 variables, 2/234 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 2/236 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/236 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 308/536 variables, 228/464 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 57/521 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 11/532 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 0/532 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 12/548 variables, 12/544 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/548 variables, 12/556 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/548 variables, 3/559 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 20/579 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:05] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:05] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:05] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:06] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 13 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 4/583 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:06] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:07] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:07] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:07] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:07] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:07] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 14 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/548 variables, 6/589 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:08] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 1/590 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 590 constraints, problems are : Problem set: 4 solved, 11 unsolved in 5008 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 11/15 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10066ms problems are : Problem set: 4 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 240 transition count 257
Reduce places removed 75 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 77 rules applied. Total rules applied 152 place count 165 transition count 255
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 154 place count 163 transition count 255
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 154 place count 163 transition count 206
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 252 place count 114 transition count 206
Applied a total of 252 rules in 37 ms. Remains 114 /240 variables (removed 126) and now considering 206/332 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 114/240 places, 206/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 354 ms. (112 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 11/11 properties
Probably explored full state space saw : 149149 states, properties seen :10
Probabilistic random walk after 745745 steps, saw 149149 distinct states, run finished after 1706 ms. (steps per millisecond=437 ) properties seen :10
Explored full state space saw : 149150 states, properties seen :0
Exhaustive walk after 745750 steps, saw 149150 distinct states, run finished after 963 ms. (steps per millisecond=774 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA Peterson-PT-3-CTLFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 08:47:12] [INFO ] Flatten gal took : 19 ms
[2025-06-03 08:47:12] [INFO ] Flatten gal took : 20 ms
[2025-06-03 08:47:12] [INFO ] Input system was already deterministic with 332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 12 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2025-06-03 08:47:12] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 08:47:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:47:12] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-03 08:47:12] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 08:47:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:47:12] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 08:47:12] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2025-06-03 08:47:12] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 08:47:12] [INFO ] Invariant cache hit.
[2025-06-03 08:47:12] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:14] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:14] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:14] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:14] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:14] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:14] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:14] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:15] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:15] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:15] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:15] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:15] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:15] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:15] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:15] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:15] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:15] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:15] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:15] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:16] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:16] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:16] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:16] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:16] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:17] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:17] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:17] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:17] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:17] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:17] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:17] [INFO ] Deduced a trap composed of 56 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-03 08:47:17] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:17] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:17] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:18] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:18] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:18] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:18] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:18] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:18] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:22] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:22] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:22] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:22] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:22] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:22] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:22] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:22] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:23] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:23] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:23] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:23] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:23] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:23] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:23] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:23] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:23] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:23] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:24] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:24] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:25] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:26] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:26] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:26] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:26] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:26] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:27] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:27] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:27] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:28] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:31] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:32] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:33] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:47:39] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/548 variables, and 325 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30029 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 74/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 308/548 variables, 240/565 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 57/622 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 950 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30032 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Finished structural reductions in LTL mode , in 1 iterations and 60570 ms. Remains : 240/240 places, 332/332 transitions.
[2025-06-03 08:48:13] [INFO ] Flatten gal took : 20 ms
[2025-06-03 08:48:13] [INFO ] Flatten gal took : 13 ms
[2025-06-03 08:48:13] [INFO ] Input system was already deterministic with 332 transitions.
[2025-06-03 08:48:13] [INFO ] Flatten gal took : 12 ms
[2025-06-03 08:48:13] [INFO ] Flatten gal took : 14 ms
[2025-06-03 08:48:13] [INFO ] Time to serialize gal into /tmp/CTLFireability14745463392748396754.gal : 7 ms
[2025-06-03 08:48:13] [INFO ] Time to serialize properties into /tmp/CTLFireability12302445039884889151.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14745463392748396754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12302445039884889151.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,3.40795e+06,14.127,388900,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 08:48:43] [INFO ] Flatten gal took : 15 ms
[2025-06-03 08:48:43] [INFO ] Applying decomposition
[2025-06-03 08:48:43] [INFO ] Flatten gal took : 27 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/graph5990984352449570773.txt' '-o' '/tmp/graph5990984352449570773.bin' '-w' '/tmp/graph5990984352449570773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5990984352449570773.bin' '-l' '-1' '-v' '-w' '/tmp/graph5990984352449570773.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:48:43] [INFO ] Decomposing Gal with order
[2025-06-03 08:48:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:48:43] [INFO ] Removed a total of 214 redundant transitions.
[2025-06-03 08:48:43] [INFO ] Flatten gal took : 109 ms
[2025-06-03 08:48:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 15 ms.
[2025-06-03 08:48:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10272133373574910681.gal : 6 ms
[2025-06-03 08:48:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12842385022556847522.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10272133373574910681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12842385022556847522.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,3.40795e+06,6.67531,147776,3456,146,220853,3263,728,821053,82,20899,0
Converting to forward existential form...Done !
original formula: EF(AX(AX(AF(((((((i3.u70.TestTurn_3_2==0)||(i3.u70.Turn_2_3==0))&&((i2.u24.TestTurn_2_0==0)||(i2.u24.Turn_0_2==0)))&&(((i2.u25.TestTurn_1...657
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EX(!(!(EG(!(((((((i3.u70.TestTurn_3_2==0)||(i3.u70.Turn_2_3==0))&&((i2.u24.TestTurn...727
Reverse transition relation is NOT exact ! Due to transitions t24, t64, t65, t66, t67, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t15...833
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,10.4578,198336,1,0,277710,3263,3828,1.39158e+06,426,20899,726423
FORMULA Peterson-PT-3-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 9 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2025-06-03 08:48:54] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 08:48:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:48:54] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-03 08:48:54] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 08:48:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:48:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 08:48:54] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2025-06-03 08:48:54] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 08:48:54] [INFO ] Invariant cache hit.
[2025-06-03 08:48:54] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:56] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:56] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:56] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:56] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:56] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:56] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:56] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:56] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:56] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:56] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:56] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:56] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:57] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:57] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:57] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:57] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:57] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:57] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:57] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:57] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:58] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:58] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:58] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:58] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:58] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:58] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:58] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:58] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:58] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:58] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:59] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:59] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:59] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:59] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:59] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:59] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:59] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:59] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:48:59] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:00] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:03] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:03] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:03] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:03] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:03] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:03] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:04] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:04] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:04] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:04] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:04] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:04] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:04] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:04] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:04] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:05] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:05] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:05] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:05] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:05] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:06] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:07] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:07] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:07] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:07] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:08] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:08] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:08] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:09] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:09] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:12] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:13] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:14] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:21] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/548 variables, and 325 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30012 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 74/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 308/548 variables, 240/565 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 57/622 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 950 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30030 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60076ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Finished structural reductions in LTL mode , in 1 iterations and 60534 ms. Remains : 240/240 places, 332/332 transitions.
[2025-06-03 08:49:54] [INFO ] Flatten gal took : 13 ms
[2025-06-03 08:49:54] [INFO ] Flatten gal took : 11 ms
[2025-06-03 08:49:54] [INFO ] Input system was already deterministic with 332 transitions.
[2025-06-03 08:49:54] [INFO ] Flatten gal took : 11 ms
[2025-06-03 08:49:54] [INFO ] Flatten gal took : 10 ms
[2025-06-03 08:49:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8057957790978611903.gal : 2 ms
[2025-06-03 08:49:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7134863084923968769.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8057957790978611903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7134863084923968769.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,3.40795e+06,16.1238,388952,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
original formula: AX(A((!((((((((TestIdentity_0_0_3==1)||(TestIdentity_1_2_2==1))||((TestIdentity_0_2_2==1)||(TestIdentity_1_1_2==1)))||(((TestIdentity_3_2...4070
=> equivalent forward existential formula: (([(FwdU(((FwdU(EY(Init),!((((((((TestIdentity_0_0_3==1)||(TestIdentity_1_2_2==1))||((TestIdentity_0_2_2==1)||(T...8217
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 08:50:24] [INFO ] Flatten gal took : 10 ms
[2025-06-03 08:50:24] [INFO ] Applying decomposition
[2025-06-03 08:50:24] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1759023228626105250.txt' '-o' '/tmp/graph1759023228626105250.bin' '-w' '/tmp/graph1759023228626105250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1759023228626105250.bin' '-l' '-1' '-v' '-w' '/tmp/graph1759023228626105250.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:50:24] [INFO ] Decomposing Gal with order
[2025-06-03 08:50:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:50:24] [INFO ] Removed a total of 214 redundant transitions.
[2025-06-03 08:50:24] [INFO ] Flatten gal took : 17 ms
[2025-06-03 08:50:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2025-06-03 08:50:24] [INFO ] Time to serialize gal into /tmp/CTLFireability11263606386123882929.gal : 3 ms
[2025-06-03 08:50:24] [INFO ] Time to serialize properties into /tmp/CTLFireability4668327899342175661.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/CTLFireability11263606386123882929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4668327899342175661.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,3.40795e+06,11.1018,235320,3157,184,325123,4315,700,1.35662e+06,91,24647,0
Converting to forward existential form...Done !
original formula: AX(A((!((((((((i8.i1.u39.TestIdentity_0_0_3==1)||(i10.u83.TestIdentity_1_2_2==1))||((i15.i0.u50.TestIdentity_0_2_2==1)||(i12.i1.u85.TestI...5553
=> equivalent forward existential formula: (([(FwdU(((FwdU(EY(Init),!((((((((i8.i1.u39.TestIdentity_0_0_3==1)||(i10.u83.TestIdentity_1_2_2==1))||((i15.i0.u...12238
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2025-06-03 08:50:54] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 08:50:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:50:55] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-03 08:50:55] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 08:50:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:50:55] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 08:50:55] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2025-06-03 08:50:55] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 08:50:55] [INFO ] Invariant cache hit.
[2025-06-03 08:50:55] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:56] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:56] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:56] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:57] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:58] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:58] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:58] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:58] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:59] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:59] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:59] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:59] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:59] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:59] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:59] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:59] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:59] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:59] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:59] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:00] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:00] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:00] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:00] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:00] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:00] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:00] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:00] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:04] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:04] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:04] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:04] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:04] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:04] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:05] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:05] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:05] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:05] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:05] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:05] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:05] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:05] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:05] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:05] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:06] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:06] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:06] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:06] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:07] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:08] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:08] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:08] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:08] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:09] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:09] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:09] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:10] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:10] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:13] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:14] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:15] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:21] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/548 variables, and 325 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30020 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 74/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 308/548 variables, 240/565 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 57/622 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 950 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30023 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Finished structural reductions in LTL mode , in 1 iterations and 60438 ms. Remains : 240/240 places, 332/332 transitions.
[2025-06-03 08:51:55] [INFO ] Flatten gal took : 9 ms
[2025-06-03 08:51:55] [INFO ] Flatten gal took : 25 ms
[2025-06-03 08:51:55] [INFO ] Input system was already deterministic with 332 transitions.
[2025-06-03 08:51:55] [INFO ] Flatten gal took : 9 ms
[2025-06-03 08:51:55] [INFO ] Flatten gal took : 24 ms
[2025-06-03 08:51:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8486281689608055460.gal : 2 ms
[2025-06-03 08:51:55] [INFO ] Time to serialize properties into /tmp/CTLFireability5856562763127624701.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8486281689608055460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5856562763127624701.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,3.40795e+06,14.5002,389048,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
original formula: ((EF(EX(((((((((TestTurn_3_1==1)&&(Turn_1_1==1))||((TestTurn_0_1==1)&&(Turn_1_3==1)))||(((TestTurn_3_2==1)&&(Turn_2_1==1))||((TestTurn_3_...5789
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EX(((((((((TestTurn_3_1==1)&&(Turn_1_1==1))||((TestTurn_0_1==1)&&(Turn_1_3==1)))||(((TestT...6498
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 08:52:25] [INFO ] Flatten gal took : 10 ms
[2025-06-03 08:52:25] [INFO ] Applying decomposition
[2025-06-03 08:52:25] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14028716897281467038.txt' '-o' '/tmp/graph14028716897281467038.bin' '-w' '/tmp/graph14028716897281467038.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14028716897281467038.bin' '-l' '-1' '-v' '-w' '/tmp/graph14028716897281467038.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:52:25] [INFO ] Decomposing Gal with order
[2025-06-03 08:52:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:52:25] [INFO ] Removed a total of 208 redundant transitions.
[2025-06-03 08:52:25] [INFO ] Flatten gal took : 23 ms
[2025-06-03 08:52:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2025-06-03 08:52:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3884088556869343629.gal : 3 ms
[2025-06-03 08:52:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8483112843386260292.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/CTLFireability3884088556869343629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8483112843386260292.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40795e+06,6.8567,156736,3598,241,220031,3720,701,984117,109,25771,0
Converting to forward existential form...Done !
original formula: ((EF(EX(((((((((i8.u19.TestTurn_3_1==1)&&(i8.u18.Turn_1_1==1))||((i8.u18.TestTurn_0_1==1)&&(i8.u18.Turn_1_3==1)))||(((i15.u67.TestTurn_3_...8023
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EX(((((((((i8.u19.TestTurn_3_1==1)&&(i8.u18.Turn_1_1==1))||((i8.u18.TestTurn_0_1==1)&&(i8....10563
Reverse transition relation is NOT exact ! Due to transitions t24, t64, t65, t66, t67, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t15...806
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,12.6982,270084,1,0,386400,5510,4123,1.83908e+06,602,33923,831340
FORMULA Peterson-PT-3-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 240 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 144 transition count 236
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 192 place count 144 transition count 192
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 280 place count 100 transition count 192
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 304 place count 88 transition count 180
Applied a total of 304 rules in 35 ms. Remains 88 /240 variables (removed 152) and now considering 180/332 (removed 152) transitions.
[2025-06-03 08:52:38] [INFO ] Flow matrix only has 156 transitions (discarded 24 similar events)
// Phase 1: matrix 156 rows 88 cols
[2025-06-03 08:52:38] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:52:38] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-03 08:52:38] [INFO ] Flow matrix only has 156 transitions (discarded 24 similar events)
[2025-06-03 08:52:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:52:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 08:52:38] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 08:52:38] [INFO ] Redundant transitions in 8 ms returned []
Running 176 sub problems to find dead transitions.
[2025-06-03 08:52:38] [INFO ] Flow matrix only has 156 transitions (discarded 24 similar events)
[2025-06-03 08:52:38] [INFO ] Invariant cache hit.
[2025-06-03 08:52:38] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:39] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:40] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:41] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:41] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:41] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:41] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:41] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:41] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:42] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:42] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:42] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:42] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:42] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:42] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:42] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:42] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 9/148 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:43] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:44] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 156/244 variables, 88/238 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 57/295 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (OVERLAPS) 0/244 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 295 constraints, problems are : Problem set: 0 solved, 176 unsolved in 17176 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 88/88 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 51/150 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:56] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:56] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:56] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:57] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:58] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:52:58] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 156/244 variables, 88/244 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 57/301 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 176/477 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (OVERLAPS) 0/244 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 477 constraints, problems are : Problem set: 0 solved, 176 unsolved in 21027 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 88/88 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38219ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 38220ms
Starting structural reductions in SI_CTL mode, iteration 1 : 88/240 places, 180/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38424 ms. Remains : 88/240 places, 180/332 transitions.
[2025-06-03 08:53:16] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:53:16] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:53:16] [INFO ] Input system was already deterministic with 180 transitions.
[2025-06-03 08:53:16] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:53:16] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:53:16] [INFO ] Time to serialize gal into /tmp/CTLFireability5561830683810135229.gal : 1 ms
[2025-06-03 08:53:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13466455099529695811.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/CTLFireability5561830683810135229.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13466455099529695811.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,69084,1.03182,37292,2,8284,5,100137,6,0,535,120750,0
Converting to forward existential form...Done !
original formula: (EG(((((WantSection_3_T==1)&&(CS_3==1))||((WantSection_0_T==1)&&(CS_0==1)))||(((WantSection_1_T==1)&&(CS_1==1))||((WantSection_2_T==1)&&(...1693
=> equivalent forward existential formula: ([FwdG(Init,((((WantSection_3_T==1)&&(CS_3==1))||((WantSection_0_T==1)&&(CS_0==1)))||(((WantSection_1_T==1)&&(CS...1761
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t6, t7, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t54, t73, t74, t7...615
(forward)formula 0,1,4.18728,131972,1,0,468,699122,391,195,3839,560692,389
FORMULA Peterson-PT-3-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 240 transition count 324
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 232 transition count 324
Applied a total of 16 rules in 27 ms. Remains 232 /240 variables (removed 8) and now considering 324/332 (removed 8) transitions.
[2025-06-03 08:53:21] [INFO ] Flow matrix only has 300 transitions (discarded 24 similar events)
// Phase 1: matrix 300 rows 232 cols
[2025-06-03 08:53:21] [INFO ] Computed 11 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:53:21] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-03 08:53:21] [INFO ] Flow matrix only has 300 transitions (discarded 24 similar events)
[2025-06-03 08:53:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:53:21] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 08:53:21] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 08:53:21] [INFO ] Redundant transitions in 15 ms returned []
Running 320 sub problems to find dead transitions.
[2025-06-03 08:53:21] [INFO ] Flow matrix only has 300 transitions (discarded 24 similar events)
[2025-06-03 08:53:21] [INFO ] Invariant cache hit.
[2025-06-03 08:53:21] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 232/232 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 11/243 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:23] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:23] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:23] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:23] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:23] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:23] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:23] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:23] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:23] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:23] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:23] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:23] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:24] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:24] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:24] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:24] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:24] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:24] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:24] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:24] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:25] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:25] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:25] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:25] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:25] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:25] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:25] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:25] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:26] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:26] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:26] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:26] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:26] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:26] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:26] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:26] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:26] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:26] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:27] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:27] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 20/283 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:30] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:30] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:30] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:30] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:30] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:31] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:31] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:31] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:31] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:31] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:31] [INFO ] Deduced a trap composed of 17 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-03 08:53:31] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:32] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:32] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:32] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:32] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:32] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:32] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:33] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:33] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:34] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:34] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:35] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:35] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:35] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:35] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:35] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:35] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:35] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:35] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:36] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:53:37] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 12/315 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 300/532 variables, 232/547 constraints. Problems are: Problem set: 0 solved, 320 unsolved
SMT process timed out in 30058ms, After SMT, problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 30059ms
Starting structural reductions in SI_CTL mode, iteration 1 : 232/240 places, 324/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30482 ms. Remains : 232/240 places, 324/332 transitions.
[2025-06-03 08:53:51] [INFO ] Flatten gal took : 8 ms
[2025-06-03 08:53:51] [INFO ] Flatten gal took : 8 ms
[2025-06-03 08:53:51] [INFO ] Input system was already deterministic with 324 transitions.
[2025-06-03 08:53:51] [INFO ] Flatten gal took : 20 ms
[2025-06-03 08:53:51] [INFO ] Flatten gal took : 37 ms
[2025-06-03 08:53:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6090394429465609618.gal : 2 ms
[2025-06-03 08:53:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15506108011426864268.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/CTLFireability6090394429465609618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15506108011426864268.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,2.94767e+06,12.4751,355784,2,62626,5,953869,6,0,1255,1.47014e+06,0
Converting to forward existential form...Done !
original formula: AG((!(E(EF(((((((((WantSection_1_T==1)&&(TestAlone_2_0_1==1))||((WantSection_1_T==1)&&(TestAlone_0_1_1==1)))||(((WantSection_1_T==1)&&(Te...9809
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),E(TRUE U ((((((((WantSection_1_T==1)&&(TestAlone_2_0_1==1))||((WantSection_1_T==1)&&(Tes...6574
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-03 08:54:21] [INFO ] Flatten gal took : 14 ms
[2025-06-03 08:54:21] [INFO ] Applying decomposition
[2025-06-03 08:54:21] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1565728491086145705.txt' '-o' '/tmp/graph1565728491086145705.bin' '-w' '/tmp/graph1565728491086145705.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1565728491086145705.bin' '-l' '-1' '-v' '-w' '/tmp/graph1565728491086145705.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:54:21] [INFO ] Decomposing Gal with order
[2025-06-03 08:54:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:54:21] [INFO ] Removed a total of 226 redundant transitions.
[2025-06-03 08:54:21] [INFO ] Flatten gal took : 29 ms
[2025-06-03 08:54:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 4 ms.
[2025-06-03 08:54:22] [INFO ] Time to serialize gal into /tmp/CTLFireability9696207276890221351.gal : 19 ms
[2025-06-03 08:54:22] [INFO ] Time to serialize properties into /tmp/CTLFireability2384732412982171004.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9696207276890221351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2384732412982171004.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.94767e+06,4.89689,139568,2714,547,206862,6383,727,737840,126,51744,0
Converting to forward existential form...Done !
original formula: AG((!(E(EF(((((((((i8.i1.u51.WantSection_1_T==1)&&(i2.i1.u56.TestAlone_2_0_1==1))||((i8.i1.u51.WantSection_1_T==1)&&(i7.i2.u57.TestAlone_...13624
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),E(TRUE U ((((((((i8.i1.u51.WantSection_1_T==1)&&(i2.i1.u56.TestAlone_2_0_1==1))||((i8.i1...13731
Reverse transition relation is NOT exact ! Due to transitions t19, t53, t54, t55, t56, t60, t130, t131, t132, t133, t134, t135, t136, t137, t138, t139, t14...700
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,16.3694,457548,1,0,668811,18155,4906,2.7501e+06,749,119997,1589483
FORMULA Peterson-PT-3-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 240 transition count 300
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 208 transition count 300
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 64 place count 208 transition count 264
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 136 place count 172 transition count 264
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 152 place count 164 transition count 256
Applied a total of 152 rules in 16 ms. Remains 164 /240 variables (removed 76) and now considering 256/332 (removed 76) transitions.
[2025-06-03 08:54:38] [INFO ] Flow matrix only has 232 transitions (discarded 24 similar events)
// Phase 1: matrix 232 rows 164 cols
[2025-06-03 08:54:38] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:54:38] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-06-03 08:54:38] [INFO ] Flow matrix only has 232 transitions (discarded 24 similar events)
[2025-06-03 08:54:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:54:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 08:54:38] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 08:54:38] [INFO ] Redundant transitions in 3 ms returned []
Running 252 sub problems to find dead transitions.
[2025-06-03 08:54:39] [INFO ] Flow matrix only has 232 transitions (discarded 24 similar events)
[2025-06-03 08:54:39] [INFO ] Invariant cache hit.
[2025-06-03 08:54:39] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 11/175 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:39] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:39] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:40] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:41] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:41] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:41] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:41] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:41] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:41] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:41] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:41] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:41] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:42] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:42] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:42] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:42] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:42] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:42] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:42] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:42] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:42] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:42] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:42] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:42] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:43] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:43] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:43] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:44] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:44] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:44] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:44] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:45] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:45] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:45] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:45] [INFO ] Deduced a trap composed of 26 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-03 08:54:45] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:45] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:45] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:45] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:46] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 13/228 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 232/396 variables, 164/392 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 57/449 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:55] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:55] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:55] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:55] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:54:55] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 5/454 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:55:06] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/396 variables, and 455 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30027 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 11/175 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 59/234 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:55:10] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:55:12] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:55:13] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:55:15] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 232/396 variables, 164/402 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 57/459 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 252/711 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 711 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30033 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in SI_CTL mode, iteration 1 : 164/240 places, 256/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60626 ms. Remains : 164/240 places, 256/332 transitions.
[2025-06-03 08:55:39] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:55:39] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:55:39] [INFO ] Input system was already deterministic with 256 transitions.
[2025-06-03 08:55:39] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:55:39] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:55:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8465367839545485102.gal : 1 ms
[2025-06-03 08:55:39] [INFO ] Time to serialize properties into /tmp/CTLFireability10100199469994682164.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/CTLFireability8465367839545485102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10100199469994682164.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,946822,8.15516,229608,2,43038,5,609709,6,0,915,923617,0
Converting to forward existential form...Done !
original formula: AG(EF(EG(E((((((((TestIdentity_0_0_3==1)||(TestIdentity_1_2_2==1))||((TestIdentity_0_2_2==1)||(TestIdentity_1_1_2==1)))||(((TestIdentity_...1080
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(E((((((((TestIdentity_0_0_3==1)||(TestIdentity_1_2_2==1))||((TestIdentity_0_2_...1140
Reverse transition relation is NOT exact ! Due to transitions t7, t41, t42, t43, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75, t76, t89, t102, t10...624
Detected timeout of ITS tools.
[2025-06-03 08:56:09] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:56:09] [INFO ] Applying decomposition
[2025-06-03 08:56:09] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17385025043206108798.txt' '-o' '/tmp/graph17385025043206108798.bin' '-w' '/tmp/graph17385025043206108798.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17385025043206108798.bin' '-l' '-1' '-v' '-w' '/tmp/graph17385025043206108798.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:56:09] [INFO ] Decomposing Gal with order
[2025-06-03 08:56:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:56:09] [INFO ] Removed a total of 225 redundant transitions.
[2025-06-03 08:56:09] [INFO ] Flatten gal took : 14 ms
[2025-06-03 08:56:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 9 ms.
[2025-06-03 08:56:09] [INFO ] Time to serialize gal into /tmp/CTLFireability14696963441314213714.gal : 4 ms
[2025-06-03 08:56:09] [INFO ] Time to serialize properties into /tmp/CTLFireability3287817291462919509.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/CTLFireability14696963441314213714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3287817291462919509.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,946822,0.989919,39060,1422,173,57863,1258,652,158607,107,8283,0
Converting to forward existential form...Done !
original formula: AG(EF(EG(E((((((((i3.i0.u39.TestIdentity_0_0_3==1)||(i6.u38.TestIdentity_1_2_2==1))||((i5.u42.TestIdentity_0_2_2==1)||(i4.i1.u41.TestIden...1423
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(E((((((((i3.i0.u39.TestIdentity_0_0_3==1)||(i6.u38.TestIdentity_1_2_2==1))||((...1483
Reverse transition relation is NOT exact ! Due to transitions t7, t41, t42, t43, t66, t67, t68, t69, t70, t72, t73, t74, t76, t89, t102, t103, t104, t107, ...602
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
(forward)formula 0,1,11.092,364276,1,0,466839,4688,3757,2.50102e+06,608,29738,726619
FORMULA Peterson-PT-3-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 240 transition count 329
Reduce places removed 3 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 15 rules applied. Total rules applied 18 place count 237 transition count 317
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 30 place count 225 transition count 317
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 30 place count 225 transition count 305
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 54 place count 213 transition count 305
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 3 with 18 rules applied. Total rules applied 72 place count 204 transition count 296
Applied a total of 72 rules in 25 ms. Remains 204 /240 variables (removed 36) and now considering 296/332 (removed 36) transitions.
[2025-06-03 08:56:20] [INFO ] Flow matrix only has 272 transitions (discarded 24 similar events)
// Phase 1: matrix 272 rows 204 cols
[2025-06-03 08:56:20] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:56:20] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-03 08:56:20] [INFO ] Flow matrix only has 272 transitions (discarded 24 similar events)
[2025-06-03 08:56:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:56:20] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 08:56:20] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 08:56:20] [INFO ] Redundant transitions in 12 ms returned []
Running 292 sub problems to find dead transitions.
[2025-06-03 08:56:20] [INFO ] Flow matrix only has 272 transitions (discarded 24 similar events)
[2025-06-03 08:56:20] [INFO ] Invariant cache hit.
[2025-06-03 08:56:20] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 204/204 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 11/215 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:22] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:22] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:22] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:22] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:22] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:22] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:22] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:22] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:22] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:22] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:23] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:23] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:23] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:23] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:23] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:23] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:23] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:23] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:23] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:23] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:24] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:24] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:24] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:24] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:24] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:24] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:24] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:24] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:24] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:25] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:25] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:25] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:25] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:25] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:25] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:25] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:25] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:25] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:25] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:26] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:28] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:28] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:28] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:28] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:28] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:29] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:29] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:29] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:29] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:29] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:29] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:29] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:29] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:30] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:30] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:31] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:31] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 17/272 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:32] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:34] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:37] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:37] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:42] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:56:44] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 292 unsolved
SMT process timed out in 30057ms, After SMT, problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 30057ms
Starting structural reductions in SI_CTL mode, iteration 1 : 204/240 places, 296/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30532 ms. Remains : 204/240 places, 296/332 transitions.
[2025-06-03 08:56:51] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:56:51] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:56:51] [INFO ] Input system was already deterministic with 296 transitions.
[2025-06-03 08:56:51] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:56:51] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:56:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16142907847769787533.gal : 1 ms
[2025-06-03 08:56:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11181665544645721511.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/CTLFireability16142907847769787533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11181665544645721511.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,2.15341e+06,11.1196,318864,2,58601,5,893501,6,0,1115,1.31947e+06,0
Converting to forward existential form...Done !
original formula: AF(((((((EG((((((((BeginLoop_1_0_0==0)&&(BeginLoop_0_2_0==0))&&((BeginLoop_3_0_0==0)&&(BeginLoop_2_0_0==0)))&&(((BeginLoop_1_0_1==0)&&(Be...2908
=> equivalent forward existential formula: [FwdG(Init,!(((((((EG((((((((BeginLoop_1_0_0==0)&&(BeginLoop_0_2_0==0))&&((BeginLoop_3_0_0==0)&&(BeginLoop_2_0_0...1187
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-03 08:57:21] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:57:21] [INFO ] Applying decomposition
[2025-06-03 08:57:21] [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/graph8385174780200957554.txt' '-o' '/tmp/graph8385174780200957554.bin' '-w' '/tmp/graph8385174780200957554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8385174780200957554.bin' '-l' '-1' '-v' '-w' '/tmp/graph8385174780200957554.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:57:21] [INFO ] Decomposing Gal with order
[2025-06-03 08:57:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:57:21] [INFO ] Removed a total of 238 redundant transitions.
[2025-06-03 08:57:21] [INFO ] Flatten gal took : 13 ms
[2025-06-03 08:57:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 4 ms.
[2025-06-03 08:57:21] [INFO ] Time to serialize gal into /tmp/CTLFireability475922108342566798.gal : 2 ms
[2025-06-03 08:57:21] [INFO ] Time to serialize properties into /tmp/CTLFireability8546031724453601585.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/CTLFireability475922108342566798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8546031724453601585.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.15341e+06,0.900622,33244,1545,137,54686,806,716,96796,98,3638,0
Converting to forward existential form...Done !
original formula: AF(((((((EG((((((((i2.i1.u21.BeginLoop_1_0_0==0)&&(i0.i0.u3.BeginLoop_0_2_0==0))&&((i7.i0.u22.BeginLoop_3_0_0==0)&&(i1.i0.u59.BeginLoop_2...4073
=> equivalent forward existential formula: [FwdG(Init,!(((((((EG((((((((i2.i1.u21.BeginLoop_1_0_0==0)&&(i0.i0.u3.BeginLoop_0_2_0==0))&&((i7.i0.u22.BeginLoo...4118
Reverse transition relation is NOT exact ! Due to transitions t92, t93, t94, t95, t96, t97, t98, t99, t100, t101, t102, t103, t116, t135, t136, t137, t138,...597
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,6.627,203996,1,0,336825,2326,3827,1.00326e+06,443,10874,643266
FORMULA Peterson-PT-3-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 11 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2025-06-03 08:57:27] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2025-06-03 08:57:27] [INFO ] Computed 11 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:57:27] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-03 08:57:27] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 08:57:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:57:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 08:57:28] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2025-06-03 08:57:28] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 08:57:28] [INFO ] Invariant cache hit.
[2025-06-03 08:57:28] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:29] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:29] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:29] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:29] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:30] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:30] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:30] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:30] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:30] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:30] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:30] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:30] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:30] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:30] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:30] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:30] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:30] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:31] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:31] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:31] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:31] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:32] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:32] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:32] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:32] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:32] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:32] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:32] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:32] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:32] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:32] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:32] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:33] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:33] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:33] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:33] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:33] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:33] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:33] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:33] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:37] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:37] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:37] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:37] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:37] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:37] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:37] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:38] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:38] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:38] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:38] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:38] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:38] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:38] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:38] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:38] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:38] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:39] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:39] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:39] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:40] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:41] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:41] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:41] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:41] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:42] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:42] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:42] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:42] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:43] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:46] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:47] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:48] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:57:54] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/548 variables, and 325 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30023 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 74/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 308/548 variables, 240/565 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 57/622 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 950 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30020 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Finished structural reductions in LTL mode , in 1 iterations and 60489 ms. Remains : 240/240 places, 332/332 transitions.
[2025-06-03 08:58:28] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:58:28] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:58:28] [INFO ] Input system was already deterministic with 332 transitions.
[2025-06-03 08:58:28] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:58:28] [INFO ] Flatten gal took : 8 ms
[2025-06-03 08:58:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12094483747468588861.gal : 2 ms
[2025-06-03 08:58:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12247040709979954730.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/CTLFireability12094483747468588861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12247040709979954730.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,3.40795e+06,14.9479,389196,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
original formula: EF((!(A(EF(((((((((Turn_0_1==1)&&(AskForSection_2_0==1))||((Turn_0_0==1)&&(AskForSection_1_0==1)))||(((Turn_0_1==1)&&(AskForSection_1_0==...4904
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!((E(!((((((((TestTurn_3_2==1)&&(Turn_2_3==1))||((TestTurn_2_0==1)&&(Turn_0_2==1)))||(((T...3287
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 08:58:58] [INFO ] Flatten gal took : 7 ms
[2025-06-03 08:58:58] [INFO ] Applying decomposition
[2025-06-03 08:58:58] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8740615384704133846.txt' '-o' '/tmp/graph8740615384704133846.bin' '-w' '/tmp/graph8740615384704133846.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8740615384704133846.bin' '-l' '-1' '-v' '-w' '/tmp/graph8740615384704133846.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:58:58] [INFO ] Decomposing Gal with order
[2025-06-03 08:58:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:58:58] [INFO ] Removed a total of 216 redundant transitions.
[2025-06-03 08:58:58] [INFO ] Flatten gal took : 17 ms
[2025-06-03 08:58:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2025-06-03 08:58:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13677047248125793283.gal : 4 ms
[2025-06-03 08:58:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4865147328464323547.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/CTLFireability13677047248125793283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4865147328464323547.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,3.40795e+06,2.96649,104584,2501,165,153172,4007,799,571759,98,24805,0
Converting to forward existential form...Done !
original formula: EF((!(A(EF(((((((((i1.u89.Turn_0_1==1)&&(i1.u20.AskForSection_2_0==1))||((i1.u89.Turn_0_0==1)&&(i1.u57.AskForSection_1_0==1)))||(((i1.u89...6810
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!((E(!((((((((i10.i0.u90.TestTurn_3_2==1)&&(i10.i0.u90.Turn_2_3==1))||((i1.u20.TestTurn_2...8995
Reverse transition relation is NOT exact ! Due to transitions t24, t36, t37, t64, t65, t66, t67, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149,...811
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,20.64,558624,1,0,651696,8661,5284,4.36438e+06,546,43168,1211330
FORMULA Peterson-PT-3-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 240 transition count 242
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 91 rules applied. Total rules applied 181 place count 150 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 149 transition count 241
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 182 place count 149 transition count 194
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 276 place count 102 transition count 194
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 3 with 22 rules applied. Total rules applied 298 place count 91 transition count 183
Applied a total of 298 rules in 16 ms. Remains 91 /240 variables (removed 149) and now considering 183/332 (removed 149) transitions.
[2025-06-03 08:59:19] [INFO ] Flow matrix only has 159 transitions (discarded 24 similar events)
// Phase 1: matrix 159 rows 91 cols
[2025-06-03 08:59:19] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:59:19] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-03 08:59:19] [INFO ] Flow matrix only has 159 transitions (discarded 24 similar events)
[2025-06-03 08:59:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:59:19] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 08:59:19] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 08:59:19] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2025-06-03 08:59:19] [INFO ] Flow matrix only has 159 transitions (discarded 24 similar events)
[2025-06-03 08:59:19] [INFO ] Invariant cache hit.
[2025-06-03 08:59:19] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:21] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:22] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:22] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:22] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:22] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:22] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:23] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:24] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:24] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 18/160 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:24] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:25] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 159/250 variables, 91/253 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 57/310 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/250 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 310 constraints, problems are : Problem set: 0 solved, 179 unsolved in 20186 ms.
Refiners :[Domain max(s): 91/91 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 91/91 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 60/162 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 159/250 variables, 91/253 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 57/310 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 179/489 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:59:51] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/250 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 0/250 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 490 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30018 ms.
Refiners :[Domain max(s): 91/91 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 91/91 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50228ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 50229ms
Starting structural reductions in SI_CTL mode, iteration 1 : 91/240 places, 183/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50500 ms. Remains : 91/240 places, 183/332 transitions.
[2025-06-03 09:00:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 09:00:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 09:00:09] [INFO ] Input system was already deterministic with 183 transitions.
[2025-06-03 09:00:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 09:00:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 09:00:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13412932425610938779.gal : 1 ms
[2025-06-03 09:00:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15706378781506575679.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/CTLFireability13412932425610938779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15706378781506575679.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,82766,1.10571,44684,2,9437,5,117116,6,0,550,145605,0
Converting to forward existential form...Done !
original formula: EF((E((TestIdentity_0_0_3!=1) U (AG((TestIdentity_1_2_2==1)) + (BeginLoop_0_0_2==1))) * (IsEndLoop_1_0_3!=1)))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * (IsEndLoop_1_0_3!=1)),(TestIdentity_0_0_3!=1)) * !(E(TRUE U !((TestIdentity_1_2_2==1)...279
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t8, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t55, t74, t75, t7...617
Hit Full ! (commute/partial/dont) 181/0/2
(forward)formula 0,1,5.01768,153568,1,0,456,812265,397,187,3952,674490,381
FORMULA Peterson-PT-3-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2025-06-03 09:00:14] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2025-06-03 09:00:14] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:00:15] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-03 09:00:15] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:00:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:00:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 09:00:15] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2025-06-03 09:00:15] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:00:15] [INFO ] Invariant cache hit.
[2025-06-03 09:00:15] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:16] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:17] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:18] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:18] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:18] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:18] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:19] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:19] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:19] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:19] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:19] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:19] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:19] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:19] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:19] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:19] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:19] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:19] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:20] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:20] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:20] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:20] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:20] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:20] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:20] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:20] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:24] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:24] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:24] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:24] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:24] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:24] [INFO ] Deduced a trap composed of 13 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-03 09:00:25] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:25] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:25] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:25] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:25] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:25] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:25] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:25] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:25] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:25] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:26] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:26] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:26] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:26] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:27] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:28] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:28] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:28] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:28] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:29] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:29] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:29] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:30] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:30] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:33] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:34] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:35] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:00:41] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/548 variables, and 325 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30013 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 74/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 308/548 variables, 240/565 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 57/622 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 950 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30029 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Finished structural reductions in LTL mode , in 1 iterations and 60589 ms. Remains : 240/240 places, 332/332 transitions.
[2025-06-03 09:01:15] [INFO ] Flatten gal took : 6 ms
[2025-06-03 09:01:15] [INFO ] Flatten gal took : 7 ms
[2025-06-03 09:01:15] [INFO ] Input system was already deterministic with 332 transitions.
[2025-06-03 09:01:15] [INFO ] Flatten gal took : 6 ms
[2025-06-03 09:01:15] [INFO ] Flatten gal took : 6 ms
[2025-06-03 09:01:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10163555719170398797.gal : 1 ms
[2025-06-03 09:01:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5233987469460954653.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/CTLFireability10163555719170398797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5233987469460954653.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,3.40795e+06,15.7646,389048,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 09:01:45] [INFO ] Flatten gal took : 9 ms
[2025-06-03 09:01:45] [INFO ] Applying decomposition
[2025-06-03 09:01:45] [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/graph12427364839469000349.txt' '-o' '/tmp/graph12427364839469000349.bin' '-w' '/tmp/graph12427364839469000349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12427364839469000349.bin' '-l' '-1' '-v' '-w' '/tmp/graph12427364839469000349.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:01:45] [INFO ] Decomposing Gal with order
[2025-06-03 09:01:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:01:45] [INFO ] Removed a total of 202 redundant transitions.
[2025-06-03 09:01:45] [INFO ] Flatten gal took : 20 ms
[2025-06-03 09:01:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 2 ms.
[2025-06-03 09:01:45] [INFO ] Time to serialize gal into /tmp/CTLFireability7525888202312071979.gal : 2 ms
[2025-06-03 09:01:45] [INFO ] Time to serialize properties into /tmp/CTLFireability2330463416161074195.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/CTLFireability7525888202312071979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2330463416161074195.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40795e+06,25.555,496988,3652,332,558672,16564,687,3.61825e+06,112,159172,0
Converting to forward existential form...Done !
original formula: AF(E((AG((((i12.u68.IsEndLoop_2_1_3==1)||((i15.i0.u53.WantSection_1_F==1)&&(i3.i0.u77.TestAlone_0_0_1==1)))||(((i2.i1.u51.WantSection_2_T...536
=> equivalent forward existential formula: [FwdG(Init,!(E((!(E(TRUE U !((((i12.u68.IsEndLoop_2_1_3==1)||((i15.i0.u53.WantSection_1_F==1)&&(i3.i0.u77.TestAl...700
Reverse transition relation is NOT exact ! Due to transitions t24, t64, t65, t66, t67, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t15...751
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 9 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2025-06-03 09:02:15] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:02:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:02:15] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-03 09:02:15] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:02:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:02:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 09:02:16] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2025-06-03 09:02:16] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:02:16] [INFO ] Invariant cache hit.
[2025-06-03 09:02:16] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:17] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:17] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:17] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:17] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:17] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:18] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:18] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:18] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:18] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:18] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:18] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:18] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:18] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:18] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:18] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:18] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:18] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:18] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:19] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:19] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:19] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:19] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:19] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:19] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:20] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:20] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:20] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:20] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:20] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:20] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:20] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:20] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:20] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:20] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:20] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:21] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:21] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:21] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:21] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:21] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:24] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:25] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:25] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:25] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:25] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:25] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:25] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:25] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:26] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:26] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:26] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:26] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:26] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:26] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:26] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:26] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:26] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:26] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:27] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:27] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:28] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:29] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:29] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:29] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:29] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:29] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:30] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:30] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:30] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:31] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:34] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:35] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:36] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:02:42] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/548 variables, and 325 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30022 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 74/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 308/548 variables, 240/565 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 57/622 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 950 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30036 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in LTL mode , in 1 iterations and 60615 ms. Remains : 240/240 places, 332/332 transitions.
[2025-06-03 09:03:16] [INFO ] Flatten gal took : 5 ms
[2025-06-03 09:03:16] [INFO ] Flatten gal took : 5 ms
[2025-06-03 09:03:16] [INFO ] Input system was already deterministic with 332 transitions.
[2025-06-03 09:03:16] [INFO ] Flatten gal took : 6 ms
[2025-06-03 09:03:16] [INFO ] Flatten gal took : 6 ms
[2025-06-03 09:03:16] [INFO ] Time to serialize gal into /tmp/CTLFireability7417507882881656736.gal : 1 ms
[2025-06-03 09:03:16] [INFO ] Time to serialize properties into /tmp/CTLFireability15401255859147263751.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/CTLFireability7417507882881656736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15401255859147263751.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,3.40795e+06,16.4679,389224,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 09:03:46] [INFO ] Flatten gal took : 6 ms
[2025-06-03 09:03:46] [INFO ] Applying decomposition
[2025-06-03 09:03:46] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph929366153343726108.txt' '-o' '/tmp/graph929366153343726108.bin' '-w' '/tmp/graph929366153343726108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph929366153343726108.bin' '-l' '-1' '-v' '-w' '/tmp/graph929366153343726108.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:03:46] [INFO ] Decomposing Gal with order
[2025-06-03 09:03:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:03:46] [INFO ] Removed a total of 210 redundant transitions.
[2025-06-03 09:03:46] [INFO ] Flatten gal took : 26 ms
[2025-06-03 09:03:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 2 ms.
[2025-06-03 09:03:46] [INFO ] Time to serialize gal into /tmp/CTLFireability12120898931082812797.gal : 2 ms
[2025-06-03 09:03:46] [INFO ] Time to serialize properties into /tmp/CTLFireability14897332172680662939.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/CTLFireability12120898931082812797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14897332172680662939.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,3.40795e+06,10.0631,224184,3151,264,326650,11502,726,1.2631e+06,107,90263,0
Converting to forward existential form...Done !
original formula: AG((AX(AF(((i5.u20.Turn_2_1==0)||(i5.u18.AskForSection_3_2==0)))) + (EG((((i5.u82.Turn_2_0==1)&&(i5.u18.AskForSection_3_2==1))||((i5.u20....266
=> equivalent forward existential formula: [FwdG(EY((FwdU(Init,TRUE) * !((EG((((i5.u82.Turn_2_0==1)&&(i5.u18.AskForSection_3_2==1))||((i5.u20.TestTurn_1_2=...321
Reverse transition relation is NOT exact ! Due to transitions t24, t64, t65, t66, t67, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t15...790
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,12.9649,224184,1,0,326650,11502,4363,1.2631e+06,625,90263,724881
FORMULA Peterson-PT-3-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2025-06-03 09:03:59] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:03:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:03:59] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-03 09:03:59] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:03:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:03:59] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 09:04:00] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2025-06-03 09:04:00] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:04:00] [INFO ] Invariant cache hit.
[2025-06-03 09:04:00] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:01] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:01] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:01] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:01] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:01] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:01] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:02] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:02] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:02] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:02] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:02] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:02] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:02] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:02] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:02] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:02] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:02] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:02] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:03] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:03] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:03] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:03] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:03] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:03] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:04] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:04] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:04] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:04] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:04] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:04] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:04] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:04] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:04] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:04] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:04] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:05] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:05] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:05] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:05] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:05] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:08] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:09] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:09] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:09] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:09] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:09] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:09] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:09] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:10] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:10] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:10] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:10] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:10] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:10] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:10] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:10] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:10] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:10] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:11] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:11] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:12] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:13] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:13] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:13] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:13] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:13] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:14] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:14] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:14] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:15] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:18] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:19] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:20] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:26] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/548 variables, and 325 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30018 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 74/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 308/548 variables, 240/565 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 57/622 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 950 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30028 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Finished structural reductions in LTL mode , in 1 iterations and 60638 ms. Remains : 240/240 places, 332/332 transitions.
[2025-06-03 09:05:00] [INFO ] Flatten gal took : 9 ms
[2025-06-03 09:05:00] [INFO ] Flatten gal took : 6 ms
[2025-06-03 09:05:00] [INFO ] Input system was already deterministic with 332 transitions.
[2025-06-03 09:05:00] [INFO ] Flatten gal took : 5 ms
[2025-06-03 09:05:00] [INFO ] Flatten gal took : 5 ms
[2025-06-03 09:05:00] [INFO ] Time to serialize gal into /tmp/CTLFireability1054351606051137730.gal : 1 ms
[2025-06-03 09:05:00] [INFO ] Time to serialize properties into /tmp/CTLFireability148062389591143055.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/CTLFireability1054351606051137730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability148062389591143055.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,3.40795e+06,16.003,389160,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 09:05:30] [INFO ] Flatten gal took : 5 ms
[2025-06-03 09:05:30] [INFO ] Applying decomposition
[2025-06-03 09:05:30] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11631264500569132188.txt' '-o' '/tmp/graph11631264500569132188.bin' '-w' '/tmp/graph11631264500569132188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11631264500569132188.bin' '-l' '-1' '-v' '-w' '/tmp/graph11631264500569132188.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:05:30] [INFO ] Decomposing Gal with order
[2025-06-03 09:05:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:05:30] [INFO ] Removed a total of 222 redundant transitions.
[2025-06-03 09:05:30] [INFO ] Flatten gal took : 20 ms
[2025-06-03 09:05:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 09:05:30] [INFO ] Time to serialize gal into /tmp/CTLFireability5526215025374254333.gal : 3 ms
[2025-06-03 09:05:30] [INFO ] Time to serialize properties into /tmp/CTLFireability18370895462622361705.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/CTLFireability5526215025374254333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18370895462622361705.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,3.40795e+06,8.22814,199520,3358,97,240606,4360,830,1.39936e+06,73,23217,0
Converting to forward existential form...Done !
original formula: E((!((((i1.i1.u53.WantSection_0_T==1)&&(i6.i1.u32.TestAlone_1_2_0==1)) + !(EG(((i7.u52.WantSection_3_F==1)&&(i5.u44.TestAlone_1_0_3==1)))...392
=> equivalent forward existential formula: ([(FwdU(Init,(!((((i1.i1.u53.WantSection_0_T==1)&&(i6.i1.u32.TestAlone_1_2_0==1)) + !(EG(((i7.u52.WantSection_3_...770
Reverse transition relation is NOT exact ! Due to transitions t24, t36, t37, t64, t65, t66, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150...855
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2025-06-03 09:06:00] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:06:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:06:00] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-03 09:06:00] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:06:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:06:00] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 09:06:00] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2025-06-03 09:06:00] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:06:00] [INFO ] Invariant cache hit.
[2025-06-03 09:06:00] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:02] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:02] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:02] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:02] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:02] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:02] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:02] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:02] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:02] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:03] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:03] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:03] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:03] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:03] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:03] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:03] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:03] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:03] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:03] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:03] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:04] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:04] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:04] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:04] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:04] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:04] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:04] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:05] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:05] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:05] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:05] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:05] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:05] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:05] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:05] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:05] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:06] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:06] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:06] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:06] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:09] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:09] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:09] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:10] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:10] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:10] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:10] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:10] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:10] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:10] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:11] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:11] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:11] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:11] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:11] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:11] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:11] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:11] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:11] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:11] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:13] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:13] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:14] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:14] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:14] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:14] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:14] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:14] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:15] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:15] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:18] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:19] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:20] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:27] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/548 variables, and 325 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30019 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 74/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 308/548 variables, 240/565 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 57/622 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 950 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30033 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Finished structural reductions in LTL mode , in 1 iterations and 60622 ms. Remains : 240/240 places, 332/332 transitions.
[2025-06-03 09:07:00] [INFO ] Flatten gal took : 7 ms
[2025-06-03 09:07:00] [INFO ] Flatten gal took : 5 ms
[2025-06-03 09:07:00] [INFO ] Input system was already deterministic with 332 transitions.
[2025-06-03 09:07:00] [INFO ] Flatten gal took : 5 ms
[2025-06-03 09:07:01] [INFO ] Flatten gal took : 5 ms
[2025-06-03 09:07:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13175819124265561596.gal : 2 ms
[2025-06-03 09:07:01] [INFO ] Time to serialize properties into /tmp/CTLFireability13410740736415418818.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/CTLFireability13175819124265561596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13410740736415418818.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,3.40795e+06,16.577,389048,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 09:07:31] [INFO ] Flatten gal took : 9 ms
[2025-06-03 09:07:31] [INFO ] Applying decomposition
[2025-06-03 09:07:31] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9488001238366778195.txt' '-o' '/tmp/graph9488001238366778195.bin' '-w' '/tmp/graph9488001238366778195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9488001238366778195.bin' '-l' '-1' '-v' '-w' '/tmp/graph9488001238366778195.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:07:31] [INFO ] Decomposing Gal with order
[2025-06-03 09:07:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:07:31] [INFO ] Removed a total of 208 redundant transitions.
[2025-06-03 09:07:31] [INFO ] Flatten gal took : 12 ms
[2025-06-03 09:07:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 2 ms.
[2025-06-03 09:07:31] [INFO ] Time to serialize gal into /tmp/CTLFireability2690372179591218355.gal : 3 ms
[2025-06-03 09:07:31] [INFO ] Time to serialize properties into /tmp/CTLFireability11564975392173674823.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/CTLFireability2690372179591218355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11564975392173674823.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,3.40795e+06,7.02413,196908,3443,244,269043,4411,692,1.30716e+06,110,27191,0
Converting to forward existential form...Done !
original formula: AX(EF(((AG((((i7.u21.TestTurn_2_1==0)||(i7.u20.Turn_1_1==0))||(i11.i1.u11.BeginLoop_1_0_3==1))) * (i6.u19.AskForSection_0_2==1)) * (i6.u1...172
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((!(E(TRUE U !((((i7.u21.TestTurn_2_1==0)||(i7.u20.Turn_1_1==0))||(i11.i1.u11.BeginLoop_...237
Reverse transition relation is NOT exact ! Due to transitions t24, t64, t65, t66, t67, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t15...779
(forward)formula 0,1,25.7185,565288,1,0,663258,4622,3975,4.09767e+06,599,27191,1659576
FORMULA Peterson-PT-3-CTLFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2025-06-03 09:07:56] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:07:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:07:57] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-03 09:07:57] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:07:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:07:57] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 09:07:57] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2025-06-03 09:07:57] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:07:57] [INFO ] Invariant cache hit.
[2025-06-03 09:07:57] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:58] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:59] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:00] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:00] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:00] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:00] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:00] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:01] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:01] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:01] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:01] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:01] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:01] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:01] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:01] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:01] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:01] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:02] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:02] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:02] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:02] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:02] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:02] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:02] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:02] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:02] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:03] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:06] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:06] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:06] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:06] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:06] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:06] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:07] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:07] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:07] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:07] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:07] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:07] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:07] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:07] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:07] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:08] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:08] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:08] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:08] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:08] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:09] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:10] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:10] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:10] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:10] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:11] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:11] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:11] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:12] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:12] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:15] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:16] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:17] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:24] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/548 variables, and 325 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30015 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 74/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 308/548 variables, 240/565 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 57/622 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 950 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30024 ms.
Refiners :[Domain max(s): 240/240 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in LTL mode , in 1 iterations and 60614 ms. Remains : 240/240 places, 332/332 transitions.
[2025-06-03 09:08:57] [INFO ] Flatten gal took : 5 ms
[2025-06-03 09:08:57] [INFO ] Flatten gal took : 6 ms
[2025-06-03 09:08:57] [INFO ] Input system was already deterministic with 332 transitions.
[2025-06-03 09:08:57] [INFO ] Flatten gal took : 5 ms
[2025-06-03 09:08:57] [INFO ] Flatten gal took : 5 ms
[2025-06-03 09:08:57] [INFO ] Time to serialize gal into /tmp/CTLFireability9075315538281153799.gal : 1 ms
[2025-06-03 09:08:57] [INFO ] Time to serialize properties into /tmp/CTLFireability2694171805230528395.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/CTLFireability9075315538281153799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2694171805230528395.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,3.40795e+06,16.6947,388976,2,67085,5,1.03827e+06,6,0,1295,1.68407e+06,0
Converting to forward existential form...Done !
original formula: ((EX(EF((TestIdentity_3_0_2==0))) * !(A((IsEndLoop_1_1_0==1) U ((WantSection_2_T==1)&&(TestAlone_0_1_2==1))))) * AX(AG(AX(((WantSection_0...188
=> equivalent forward existential formula: (([(Init * !(EX(E(TRUE U (TestIdentity_3_0_2==0)))))] = FALSE * [((Init * !(EG(!(((WantSection_2_T==1)&&(TestAlo...406
(forward)formula 0,0,26.0319,414372,1,0,9,1.16757e+06,10,2,2616,1.88686e+06,5
FORMULA Peterson-PT-3-CTLFireability-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 240 transition count 242
Reduce places removed 90 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 92 rules applied. Total rules applied 182 place count 150 transition count 240
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 184 place count 148 transition count 240
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 184 place count 148 transition count 194
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 276 place count 102 transition count 194
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 300 place count 90 transition count 182
Applied a total of 300 rules in 17 ms. Remains 90 /240 variables (removed 150) and now considering 182/332 (removed 150) transitions.
[2025-06-03 09:09:23] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 90 cols
[2025-06-03 09:09:23] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:09:23] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-03 09:09:23] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
[2025-06-03 09:09:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:09:23] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 09:09:24] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:09:24] [INFO ] Redundant transitions in 0 ms returned []
Running 178 sub problems to find dead transitions.
[2025-06-03 09:09:24] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
[2025-06-03 09:09:24] [INFO ] Invariant cache hit.
[2025-06-03 09:09:24] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:24] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:24] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:24] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:24] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:24] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:24] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:24] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:24] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:24] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:24] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:27] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:27] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:27] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:27] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:27] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:28] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:28] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:28] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:28] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:28] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:29] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:29] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:29] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:29] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:29] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:29] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:29] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:29] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 158/248 variables, 90/249 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 57/306 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 306 constraints, problems are : Problem set: 0 solved, 178 unsolved in 16861 ms.
Refiners :[Domain max(s): 90/90 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 90/90 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 58/159 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:42] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:43] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:45] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 158/248 variables, 90/252 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 57/309 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 178/487 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (OVERLAPS) 0/248 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 487 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30013 ms.
Refiners :[Domain max(s): 90/90 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 90/90 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46893ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 46894ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/240 places, 182/332 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47135 ms. Remains : 90/240 places, 182/332 transitions.
[2025-06-03 09:10:10] [INFO ] Flatten gal took : 4 ms
[2025-06-03 09:10:10] [INFO ] Flatten gal took : 3 ms
[2025-06-03 09:10:10] [INFO ] Input system was already deterministic with 182 transitions.
[2025-06-03 09:10:10] [INFO ] Flatten gal took : 4 ms
[2025-06-03 09:10:10] [INFO ] Flatten gal took : 3 ms
[2025-06-03 09:10:11] [INFO ] Time to serialize gal into /tmp/CTLFireability645720268425714758.gal : 1 ms
[2025-06-03 09:10:11] [INFO ] Time to serialize properties into /tmp/CTLFireability7835036439335973079.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/CTLFireability645720268425714758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7835036439335973079.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,84866,1.51794,53780,2,11274,5,150327,6,0,545,186100,0
Converting to forward existential form...Done !
original formula: EF(((AG((BeginLoop_1_2_1==0)) * AF(((TestIdentity_0_1_0==1)&&(TestIdentity_3_1_2==1)))) * ((TestTurn_1_0==0)||(Turn_0_2==0))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((TestTurn_1_0==0)||(Turn_0_2==0))) * !(E(TRUE U !((BeginLoop_1_2_1==0))))) * !(EG(!(((Tes...214
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t54, t73, t74, t75, t98, ...621
(forward)formula 0,1,19.521,522436,1,0,547,3.54364e+06,395,237,3926,2.06564e+06,492
FORMULA Peterson-PT-3-CTLFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 09:10:30] [INFO ] Flatten gal took : 6 ms
[2025-06-03 09:10:30] [INFO ] Flatten gal took : 6 ms
[2025-06-03 09:10:30] [INFO ] Applying decomposition
[2025-06-03 09:10:30] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15896995061449342588.txt' '-o' '/tmp/graph15896995061449342588.bin' '-w' '/tmp/graph15896995061449342588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15896995061449342588.bin' '-l' '-1' '-v' '-w' '/tmp/graph15896995061449342588.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:10:30] [INFO ] Decomposing Gal with order
[2025-06-03 09:10:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:10:30] [INFO ] Removed a total of 202 redundant transitions.
[2025-06-03 09:10:30] [INFO ] Flatten gal took : 14 ms
[2025-06-03 09:10:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 2 ms.
[2025-06-03 09:10:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10252679384347408380.gal : 3 ms
[2025-06-03 09:10:30] [INFO ] Time to serialize properties into /tmp/CTLFireability13868736709625367831.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/CTLFireability10252679384347408380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13868736709625367831.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40795e+06,7.89084,204900,3829,348,273633,11237,706,1.33914e+06,117,100813,0
Converting to forward existential form...Done !
original formula: AX(A((!((((((((i12.i1.u78.TestIdentity_0_0_3==1)||(i3.i0.u77.TestIdentity_1_2_2==1))||((i7.i1.u36.TestIdentity_0_2_2==1)||(i6.i1.u79.Test...5591
=> equivalent forward existential formula: (([(FwdU(((FwdU(EY(Init),!((((((((i12.i1.u78.TestIdentity_0_0_3==1)||(i3.i0.u77.TestIdentity_1_2_2==1))||((i7.i1...12301
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,9.95811,204900,1,0,273633,11237,2450,1.33914e+06,496,100813,320814
FORMULA Peterson-PT-3-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF(E((AG((((i15.u64.IsEndLoop_2_1_3==1)||((i12.i0.u47.WantSection_1_F==1)&&(i9.u48.TestAlone_0_0_1==1)))||(((i7.i1.u46.WantSection_2_T==1...536
=> equivalent forward existential formula: [FwdG(Init,!(E((!(E(TRUE U !((((i15.u64.IsEndLoop_2_1_3==1)||((i12.i0.u47.WantSection_1_F==1)&&(i9.u48.TestAlone...700
Reverse transition relation is NOT exact ! Due to transitions t24, t64, t65, t66, t67, t71, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t15...749
(forward)formula 1,0,22.4752,474656,1,0,628701,18262,5069,3.23728e+06,758,151175,1745670
FORMULA Peterson-PT-3-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E((!((((i2.i1.u43.WantSection_0_T==1)&&(i4.u72.TestAlone_1_2_0==1)) + !(EG(((i10.u45.WantSection_3_F==1)&&(i8.i1.u75.TestAlone_1_0_3==1))...393
=> equivalent forward existential formula: ([(FwdU(Init,(!((((i2.i1.u43.WantSection_0_T==1)&&(i4.u72.TestAlone_1_2_0==1)) + !(EG(((i10.u45.WantSection_3_F=...770
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 2,1,88.4869,1891104,1,0,2.29172e+06,20903,5254,1.50478e+07,782,184047,3817229
FORMULA Peterson-PT-3-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Total runtime 1502811 ms.
BK_STOP 1748941919908
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-3"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Peterson-PT-3, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876812900602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;