About the Execution of ITS-Tools for TokenRing-PT-015
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | TFTTTTTTF?FFF?T? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915589600347.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 TokenRing-PT-015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915589600347
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 47M
-rw-r--r-- 1 mcc users 404K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8M May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 11M May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 124K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 460K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.9M May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 426K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6M May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17M May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 71K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.7M May 29 14:33 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 TokenRing-PT-015-LTLCardinality-00
FORMULA_NAME TokenRing-PT-015-LTLCardinality-01
FORMULA_NAME TokenRing-PT-015-LTLCardinality-02
FORMULA_NAME TokenRing-PT-015-LTLCardinality-03
FORMULA_NAME TokenRing-PT-015-LTLCardinality-04
FORMULA_NAME TokenRing-PT-015-LTLCardinality-05
FORMULA_NAME TokenRing-PT-015-LTLCardinality-06
FORMULA_NAME TokenRing-PT-015-LTLCardinality-07
FORMULA_NAME TokenRing-PT-015-LTLCardinality-08
FORMULA_NAME TokenRing-PT-015-LTLCardinality-09
FORMULA_NAME TokenRing-PT-015-LTLCardinality-10
FORMULA_NAME TokenRing-PT-015-LTLCardinality-11
FORMULA_NAME TokenRing-PT-015-LTLCardinality-12
FORMULA_NAME TokenRing-PT-015-LTLCardinality-13
FORMULA_NAME TokenRing-PT-015-LTLCardinality-14
FORMULA_NAME TokenRing-PT-015-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749223383041
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-015
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 15:23:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 15:23:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 15:23:05] [INFO ] Load time of PNML (sax parser for PT used): 1236 ms
[2025-06-06 15:23:05] [INFO ] Transformed 256 places.
[2025-06-06 15:23:05] [INFO ] Transformed 3616 transitions.
[2025-06-06 15:23:05] [INFO ] Found NUPN structural information;
[2025-06-06 15:23:05] [INFO ] Parsed PT model containing 256 places and 3616 transitions and 14464 arcs in 1368 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA TokenRing-PT-015-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA TokenRing-PT-015-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 83 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2025-06-06 15:23:06] [INFO ] Computed 16 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:23:06] [INFO ] Implicit Places using invariants in 670 ms returned []
[2025-06-06 15:23:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:23:07] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:23:18] [INFO ] Implicit Places using invariants and state equation in 11996 ms returned []
Implicit Place search using SMT with State Equation took 12716 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:23:20] [INFO ] Invariant cache hit.
[2025-06-06 15:23:20] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:23:44] [INFO ] Deduced a trap composed of 129 places in 2342 ms of which 2006 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:23:45] [INFO ] Deduced a trap composed of 129 places in 440 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:23:53] [INFO ] Deduced a trap composed of 130 places in 8002 ms of which 7656 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:23:53] [INFO ] Deduced a trap composed of 129 places in 456 ms of which 169 ms to minimize.
SMT process timed out in 33134ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 34876ms
Finished structural reductions in LTL mode , in 1 iterations and 47731 ms. Remains : 256/256 places, 3616/3616 transitions.
Support contains 28 out of 256 places after structural reductions.
[2025-06-06 15:23:54] [INFO ] Flatten gal took : 231 ms
[2025-06-06 15:23:54] [INFO ] Flatten gal took : 129 ms
[2025-06-06 15:23:54] [INFO ] Input system was already deterministic with 3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 2651 ms. (15 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 503 ms. (79 steps per ms) remains 1/1 properties
[2025-06-06 15:23:55] [INFO ] Invariant cache hit.
[2025-06-06 15:23:55] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 60/64 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 960/1024 variables, 64/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1024 variables, 225/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1140/2164 variables, 1350/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2164 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 172/2336 variables, 96/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2336 variables, 96/1899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2336 variables, 6/1905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2336 variables, 0/1905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1350/3686 variables, 1140/3045 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3686 variables, 585/3630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3686 variables, 0/3630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 186/3872 variables, 96/3726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3872 variables, 96/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3872 variables, 6/3828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3872 variables, 90/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3021 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 60/64 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 960/1024 variables, 64/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1024 variables, 225/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1140/2164 variables, 1350/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2164 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 172/2336 variables, 96/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2336 variables, 96/1899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2336 variables, 6/1905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2336 variables, 1/1906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2336 variables, 0/1906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1350/3686 variables, 1140/3046 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3686 variables, 585/3631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3686 variables, 0/3631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 186/3872 variables, 96/3727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3872 variables, 96/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3872 variables, 6/3829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3872 variables, 90/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2837 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5913ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 375 ms.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 251 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 443 ms. (90 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 375 ms. (106 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 122461 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 1
Probabilistic random walk after 122461 steps, saw 24077 distinct states, run finished after 3006 ms. (steps per millisecond=40 ) properties seen :0
[2025-06-06 15:24:05] [INFO ] Invariant cache hit.
[2025-06-06 15:24:05] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 60/64 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 960/1024 variables, 64/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1024 variables, 225/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1140/2164 variables, 1350/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2164 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 172/2336 variables, 96/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2336 variables, 96/1899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2336 variables, 6/1905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2336 variables, 0/1905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1350/3686 variables, 1140/3045 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3686 variables, 585/3630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3686 variables, 0/3630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 186/3872 variables, 96/3726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3872 variables, 96/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3872 variables, 6/3828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3872 variables, 90/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2903 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 60/64 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 960/1024 variables, 64/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1024 variables, 225/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1140/2164 variables, 1350/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2164 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 172/2336 variables, 96/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2336 variables, 96/1899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2336 variables, 6/1905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2336 variables, 1/1906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2336 variables, 0/1906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1350/3686 variables, 1140/3046 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3686 variables, 585/3631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3686 variables, 0/3631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 186/3872 variables, 96/3727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3872 variables, 96/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3872 variables, 6/3829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3872 variables, 90/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2656 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 306 ms.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 72 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 81 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:24:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:24:11] [INFO ] Implicit Places using invariants in 348 ms returned []
[2025-06-06 15:24:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:24:12] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:24:23] [INFO ] Implicit Places using invariants and state equation in 11739 ms returned []
Implicit Place search using SMT with State Equation took 12092 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:24:23] [INFO ] Redundant transitions in 271 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:24:23] [INFO ] Invariant cache hit.
[2025-06-06 15:24:23] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:24:47] [INFO ] Deduced a trap composed of 129 places in 2288 ms of which 1999 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:24:47] [INFO ] Deduced a trap composed of 129 places in 404 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:24:55] [INFO ] Deduced a trap composed of 130 places in 7874 ms of which 7575 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:24:56] [INFO ] Deduced a trap composed of 129 places in 471 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:24:57] [INFO ] Deduced a trap composed of 130 places in 1119 ms of which 840 ms to minimize.
SMT process timed out in 33328ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33340ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45806 ms. Remains : 256/256 places, 3616/3616 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3496 edges and 256 vertex of which 252 / 256 are part of one of the 16 SCC in 6 ms
Free SCC test removed 236 places
Drop transitions (Empty/Sink Transition effects.) removed 3496 transitions
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 3608 transitions.
Graph (complete) has 8 edges and 20 vertex of which 8 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 30 ms. Remains 8 /256 variables (removed 248) and now considering 8/3616 (removed 3608) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 8 cols
[2025-06-06 15:24:57] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 15:24:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-06 15:24:57] [INFO ] After 5ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 15:24:57] [INFO ] After 38ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-06 15:24:57] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 148 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))||(p1 U G(p2))))'
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 23 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2025-06-06 15:24:57] [INFO ] Computed 16 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:24:57] [INFO ] Implicit Places using invariants in 348 ms returned []
[2025-06-06 15:24:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:24:58] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:25:09] [INFO ] Implicit Places using invariants and state equation in 11539 ms returned []
Implicit Place search using SMT with State Equation took 11890 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:25:09] [INFO ] Invariant cache hit.
[2025-06-06 15:25:09] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:25:33] [INFO ] Deduced a trap composed of 129 places in 2251 ms of which 1973 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:25:33] [INFO ] Deduced a trap composed of 129 places in 403 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:25:41] [INFO ] Deduced a trap composed of 130 places in 7907 ms of which 7606 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:25:42] [INFO ] Deduced a trap composed of 129 places in 418 ms of which 167 ms to minimize.
SMT process timed out in 32714ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32725ms
Finished structural reductions in LTL mode , in 1 iterations and 44657 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 648 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : TokenRing-PT-015-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 441 steps with 0 reset in 9 ms.
FORMULA TokenRing-PT-015-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TokenRing-PT-015-LTLCardinality-08 finished in 45393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((X(p1)||F((G(F(!p2))||(F(!p2)&&G(!p3)))))))))'
Support contains 6 out of 256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 95 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:25:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:25:43] [INFO ] Implicit Places using invariants in 375 ms returned []
[2025-06-06 15:25:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:25:43] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:25:53] [INFO ] Implicit Places using invariants and state equation in 10383 ms returned []
Implicit Place search using SMT with State Equation took 10761 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:25:54] [INFO ] Redundant transitions in 276 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:25:54] [INFO ] Invariant cache hit.
[2025-06-06 15:25:54] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:26:16] [INFO ] Deduced a trap composed of 129 places in 2281 ms of which 1993 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:26:17] [INFO ] Deduced a trap composed of 129 places in 389 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:26:25] [INFO ] Deduced a trap composed of 130 places in 7799 ms of which 7526 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:26:25] [INFO ] Deduced a trap composed of 129 places in 461 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:26:26] [INFO ] Deduced a trap composed of 130 places in 1169 ms of which 853 ms to minimize.
SMT process timed out in 32736ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32741ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43885 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0))]
Running random walk in product with property : TokenRing-PT-015-LTLCardinality-09
Product exploration explored 100000 steps with 394 reset in 571 ms.
Product exploration explored 100000 steps with 385 reset in 506 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) p1 p2)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 157 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 806 ms. (49 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 392 ms. (101 steps per ms) remains 1/1 properties
[2025-06-06 15:26:28] [INFO ] Invariant cache hit.
[2025-06-06 15:26:28] [INFO ] State equation strengthened by 3390 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/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 74/80 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1200/1280 variables, 80/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 225/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1280 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1170/2450 variables, 1590/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2450 variables, 0/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 142/2592 variables, 96/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2592 variables, 96/2172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2592 variables, 6/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2592 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 690/3282 variables, 900/3078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3282 variables, 0/3078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 78/3360 variables, 48/3126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3360 variables, 48/3174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3360 variables, 3/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3360 variables, 0/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 450/3810 variables, 450/3627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3810 variables, 195/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3810 variables, 0/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/3872 variables, 32/3854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3872 variables, 32/3886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3872 variables, 2/3888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3641 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 74/80 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1200/1280 variables, 80/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 225/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1280 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1170/2450 variables, 1590/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2450 variables, 0/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 142/2592 variables, 96/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2592 variables, 96/2172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2592 variables, 6/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2592 variables, 1/2179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2592 variables, 0/2179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 690/3282 variables, 900/3079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3282 variables, 0/3079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 78/3360 variables, 48/3127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3360 variables, 48/3175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3360 variables, 3/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3360 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 450/3810 variables, 450/3628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3810 variables, 195/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3810 variables, 0/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 62/3872 variables, 32/3855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3872 variables, 32/3887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3872 variables, 2/3889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3872 variables, 30/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3772 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7439ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 244 ms.
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 63 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 483 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 449 ms. (88 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 107663 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 107663 steps, saw 21339 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2025-06-06 15:26:39] [INFO ] Invariant cache hit.
[2025-06-06 15:26:39] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 74/80 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1200/1280 variables, 80/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 225/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1280 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1170/2450 variables, 1590/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2450 variables, 0/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 142/2592 variables, 96/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2592 variables, 96/2172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2592 variables, 6/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2592 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 690/3282 variables, 900/3078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3282 variables, 0/3078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 78/3360 variables, 48/3126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3360 variables, 48/3174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3360 variables, 3/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3360 variables, 0/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 450/3810 variables, 450/3627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3810 variables, 195/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3810 variables, 0/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/3872 variables, 32/3854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3872 variables, 32/3886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3872 variables, 2/3888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3674 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 74/80 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1200/1280 variables, 80/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 225/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1280 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1170/2450 variables, 1590/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2450 variables, 0/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 142/2592 variables, 96/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2592 variables, 96/2172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2592 variables, 6/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2592 variables, 1/2179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2592 variables, 0/2179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 690/3282 variables, 900/3079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3282 variables, 0/3079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 78/3360 variables, 48/3127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3360 variables, 48/3175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3360 variables, 3/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3360 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 450/3810 variables, 450/3628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3810 variables, 195/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3810 variables, 0/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 62/3872 variables, 32/3855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3872 variables, 32/3887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3872 variables, 2/3889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3872 variables, 30/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3670 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7377ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 214 ms.
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 69 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 59 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:26:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:26:47] [INFO ] Implicit Places using invariants in 346 ms returned []
[2025-06-06 15:26:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:26:48] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:26:58] [INFO ] Implicit Places using invariants and state equation in 10957 ms returned []
Implicit Place search using SMT with State Equation took 11306 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:26:58] [INFO ] Redundant transitions in 165 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:26:58] [INFO ] Invariant cache hit.
[2025-06-06 15:26:58] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:27:21] [INFO ] Deduced a trap composed of 129 places in 2262 ms of which 1977 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:27:22] [INFO ] Deduced a trap composed of 129 places in 371 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:27:30] [INFO ] Deduced a trap composed of 130 places in 8101 ms of which 7775 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:27:30] [INFO ] Deduced a trap composed of 129 places in 500 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:27:31] [INFO ] Deduced a trap composed of 130 places in 1107 ms of which 842 ms to minimize.
SMT process timed out in 33001ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33008ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44551 ms. Remains : 256/256 places, 3616/3616 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3438 edges and 256 vertex of which 250 / 256 are part of one of the 16 SCC in 2 ms
Free SCC test removed 234 places
Drop transitions (Empty/Sink Transition effects.) removed 3438 transitions
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 3602 transitions.
Graph (complete) has 14 edges and 22 vertex of which 11 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 11 transition count 11
Applied a total of 5 rules in 17 ms. Remains 11 /256 variables (removed 245) and now considering 11/3616 (removed 3605) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 11 cols
[2025-06-06 15:27:31] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 15:27:31] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 15:27:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-06 15:27:31] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 15:27:31] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 15:27:31] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 79 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) p1 p2)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F p0), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 15 factoid took 322 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
Support contains 6 out of 256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 69 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2025-06-06 15:27:32] [INFO ] Computed 16 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:27:32] [INFO ] Implicit Places using invariants in 326 ms returned []
[2025-06-06 15:27:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:27:33] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:27:43] [INFO ] Implicit Places using invariants and state equation in 10619 ms returned []
Implicit Place search using SMT with State Equation took 10949 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:27:43] [INFO ] Redundant transitions in 160 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:27:43] [INFO ] Invariant cache hit.
[2025-06-06 15:27:43] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:28:06] [INFO ] Deduced a trap composed of 129 places in 2285 ms of which 1986 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:28:07] [INFO ] Deduced a trap composed of 129 places in 390 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:28:15] [INFO ] Deduced a trap composed of 130 places in 7910 ms of which 7601 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:28:15] [INFO ] Deduced a trap composed of 129 places in 479 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:28:16] [INFO ] Deduced a trap composed of 130 places in 1144 ms of which 845 ms to minimize.
SMT process timed out in 33026ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33031ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44230 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p0) p2 p1)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 106 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 446 ms. (89 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 362 ms. (110 steps per ms) remains 1/1 properties
[2025-06-06 15:28:17] [INFO ] Invariant cache hit.
[2025-06-06 15:28:17] [INFO ] State equation strengthened by 3390 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/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 74/80 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1200/1280 variables, 80/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 225/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1280 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1170/2450 variables, 1590/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2450 variables, 0/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 142/2592 variables, 96/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2592 variables, 96/2172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2592 variables, 6/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2592 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 690/3282 variables, 900/3078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3282 variables, 0/3078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 78/3360 variables, 48/3126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3360 variables, 48/3174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3360 variables, 3/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3360 variables, 0/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 450/3810 variables, 450/3627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3810 variables, 195/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3810 variables, 0/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/3872 variables, 32/3854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3872 variables, 32/3886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3872 variables, 2/3888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3720 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 74/80 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1200/1280 variables, 80/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 225/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1280 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1170/2450 variables, 1590/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2450 variables, 0/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 142/2592 variables, 96/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2592 variables, 96/2172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2592 variables, 6/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2592 variables, 1/2179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2592 variables, 0/2179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 690/3282 variables, 900/3079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3282 variables, 0/3079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 78/3360 variables, 48/3127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3360 variables, 48/3175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3360 variables, 3/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3360 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 450/3810 variables, 450/3628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3810 variables, 195/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3810 variables, 0/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 62/3872 variables, 32/3855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3872 variables, 32/3887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3872 variables, 2/3889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3872 variables, 30/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3741 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7492ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 268 ms.
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 65 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 371 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 365 ms. (109 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 108965 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 1
Probabilistic random walk after 108965 steps, saw 21593 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2025-06-06 15:28:28] [INFO ] Invariant cache hit.
[2025-06-06 15:28:28] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 74/80 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1200/1280 variables, 80/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 225/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1280 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1170/2450 variables, 1590/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2450 variables, 0/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 142/2592 variables, 96/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2592 variables, 96/2172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2592 variables, 6/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2592 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 690/3282 variables, 900/3078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3282 variables, 0/3078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 78/3360 variables, 48/3126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3360 variables, 48/3174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3360 variables, 3/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3360 variables, 0/3177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 450/3810 variables, 450/3627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3810 variables, 195/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3810 variables, 0/3822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 62/3872 variables, 32/3854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3872 variables, 32/3886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3872 variables, 2/3888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3872 variables, 30/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3635 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 74/80 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1200/1280 variables, 80/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 225/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1280 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1170/2450 variables, 1590/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2450 variables, 0/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 142/2592 variables, 96/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2592 variables, 96/2172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2592 variables, 6/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2592 variables, 1/2179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2592 variables, 0/2179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 690/3282 variables, 900/3079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3282 variables, 0/3079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 78/3360 variables, 48/3127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3360 variables, 48/3175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3360 variables, 3/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3360 variables, 0/3178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 450/3810 variables, 450/3628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3810 variables, 195/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3810 variables, 0/3823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 62/3872 variables, 32/3855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3872 variables, 32/3887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3872 variables, 2/3889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3872 variables, 30/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3872 variables, 0/3919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3872/3872 variables, and 3919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3715 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7377ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 202 ms.
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 62 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 62 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:28:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:28:36] [INFO ] Implicit Places using invariants in 353 ms returned []
[2025-06-06 15:28:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:28:36] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:28:47] [INFO ] Implicit Places using invariants and state equation in 11454 ms returned []
Implicit Place search using SMT with State Equation took 11809 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:28:47] [INFO ] Redundant transitions in 166 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:28:47] [INFO ] Invariant cache hit.
[2025-06-06 15:28:47] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:10] [INFO ] Deduced a trap composed of 129 places in 2250 ms of which 1951 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:11] [INFO ] Deduced a trap composed of 129 places in 374 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:18] [INFO ] Deduced a trap composed of 130 places in 7866 ms of which 7568 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:19] [INFO ] Deduced a trap composed of 129 places in 449 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:20] [INFO ] Deduced a trap composed of 130 places in 1134 ms of which 845 ms to minimize.
SMT process timed out in 32646ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32657ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44713 ms. Remains : 256/256 places, 3616/3616 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3438 edges and 256 vertex of which 250 / 256 are part of one of the 16 SCC in 1 ms
Free SCC test removed 234 places
Drop transitions (Empty/Sink Transition effects.) removed 3438 transitions
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 3602 transitions.
Graph (complete) has 14 edges and 22 vertex of which 11 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 11 transition count 11
Applied a total of 5 rules in 5 ms. Remains 11 /256 variables (removed 245) and now considering 11/3616 (removed 3605) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 11 cols
[2025-06-06 15:29:20] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 15:29:20] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 15:29:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-06 15:29:20] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 15:29:20] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 15:29:20] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 71 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p0) p2 p1)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F p0), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 15 factoid took 297 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 385 reset in 431 ms.
Product exploration explored 100000 steps with 390 reset in 519 ms.
Built C files in :
/tmp/ltsmin4332385957017968890
[2025-06-06 15:29:22] [INFO ] Too many transitions (3616) to apply POR reductions. Disabling POR matrices.
[2025-06-06 15:29:22] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4332385957017968890
Running compilation step : cd /tmp/ltsmin4332385957017968890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4332385957017968890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4332385957017968890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 61 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2025-06-06 15:29:25] [INFO ] Computed 16 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:29:25] [INFO ] Implicit Places using invariants in 346 ms returned []
[2025-06-06 15:29:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:29:26] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:29:36] [INFO ] Implicit Places using invariants and state equation in 11221 ms returned []
Implicit Place search using SMT with State Equation took 11585 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:29:37] [INFO ] Redundant transitions in 159 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:29:37] [INFO ] Invariant cache hit.
[2025-06-06 15:29:37] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:29:59] [INFO ] Deduced a trap composed of 129 places in 2260 ms of which 1988 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:30:00] [INFO ] Deduced a trap composed of 129 places in 391 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:30:08] [INFO ] Deduced a trap composed of 130 places in 7957 ms of which 7668 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:30:08] [INFO ] Deduced a trap composed of 129 places in 465 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:30:09] [INFO ] Deduced a trap composed of 130 places in 1131 ms of which 841 ms to minimize.
SMT process timed out in 32655ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32661ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44478 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin7304824376169304974
[2025-06-06 15:30:09] [INFO ] Too many transitions (3616) to apply POR reductions. Disabling POR matrices.
[2025-06-06 15:30:09] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7304824376169304974
Running compilation step : cd /tmp/ltsmin7304824376169304974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7304824376169304974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7304824376169304974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 15:30:13] [INFO ] Flatten gal took : 98 ms
[2025-06-06 15:30:13] [INFO ] Flatten gal took : 90 ms
[2025-06-06 15:30:13] [INFO ] Time to serialize gal into /tmp/LTL6808523680310209568.gal : 22 ms
[2025-06-06 15:30:13] [INFO ] Time to serialize properties into /tmp/LTL17801446042265522573.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6808523680310209568.gal' '-t' 'CGAL' '-hoa' '/tmp/aut176197925756510040.hoa' '-atoms' '/tmp/LTL17801446042265522573.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL17801446042265522573.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut176197925756510040.hoa
Detected timeout of ITS tools.
[2025-06-06 15:30:28] [INFO ] Flatten gal took : 82 ms
[2025-06-06 15:30:28] [INFO ] Flatten gal took : 83 ms
[2025-06-06 15:30:28] [INFO ] Time to serialize gal into /tmp/LTL5883858979723493766.gal : 17 ms
[2025-06-06 15:30:28] [INFO ] Time to serialize properties into /tmp/LTL9131532458133796267.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5883858979723493766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9131532458133796267.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("((State_15_11==0)&&(State_10_13==1))"))||(G((X("((State_11_5==0)||(State_3_15==1))"))||(F((G(F("((State_13_1==1)&&(State_15_8...257
Formula 0 simplified : G(F!"((State_15_11==0)&&(State_10_13==1))" & F(X!"((State_11_5==0)||(State_3_15==1))" & G(FG!"((State_13_1==1)&&(State_15_8==0))" & ...237
Detected timeout of ITS tools.
[2025-06-06 15:30:43] [INFO ] Flatten gal took : 74 ms
[2025-06-06 15:30:43] [INFO ] Applying decomposition
[2025-06-06 15:30:43] [INFO ] Flatten gal took : 76 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/graph13856679938350783614.txt' '-o' '/tmp/graph13856679938350783614.bin' '-w' '/tmp/graph13856679938350783614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13856679938350783614.bin' '-l' '-1' '-v' '-w' '/tmp/graph13856679938350783614.weights' '-q' '0' '-e' '0.001'
[2025-06-06 15:30:43] [INFO ] Decomposing Gal with order
[2025-06-06 15:30:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 15:30:44] [INFO ] Removed a total of 8106 redundant transitions.
[2025-06-06 15:30:44] [INFO ] Flatten gal took : 307 ms
[2025-06-06 15:30:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 97 ms.
[2025-06-06 15:30:44] [INFO ] Time to serialize gal into /tmp/LTL5236352879871567520.gal : 20 ms
[2025-06-06 15:30:44] [INFO ] Time to serialize properties into /tmp/LTL6294841944704629126.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5236352879871567520.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6294841944704629126.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("((i0.u89.State_15_11==0)&&(i2.i0.i0.u26.State_10_13==1))"))||(G((X("((i0.u94.State_11_5==0)||(i3.u58.State_3_15==1))"))||(F((...341
Formula 0 simplified : G(F!"((i0.u89.State_15_11==0)&&(i2.i0.i0.u26.State_10_13==1))" & F(X!"((i0.u94.State_11_5==0)||(i3.u58.State_3_15==1))" & G(FG!"((i0...321
Detected timeout of ITS tools.
Treatment of property TokenRing-PT-015-LTLCardinality-09 finished in 316714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&G(F(p2))))'
Support contains 8 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 62 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:30:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:31:00] [INFO ] Implicit Places using invariants in 367 ms returned []
[2025-06-06 15:31:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:31:00] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:31:11] [INFO ] Implicit Places using invariants and state equation in 11019 ms returned []
Implicit Place search using SMT with State Equation took 11391 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:31:11] [INFO ] Redundant transitions in 162 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:31:11] [INFO ] Invariant cache hit.
[2025-06-06 15:31:11] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:31:34] [INFO ] Deduced a trap composed of 129 places in 2231 ms of which 1986 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:31:34] [INFO ] Deduced a trap composed of 129 places in 381 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:31:42] [INFO ] Deduced a trap composed of 130 places in 8026 ms of which 7737 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:31:42] [INFO ] Deduced a trap composed of 129 places in 463 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:31:44] [INFO ] Deduced a trap composed of 130 places in 1138 ms of which 854 ms to minimize.
SMT process timed out in 32846ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32853ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44481 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : TokenRing-PT-015-LTLCardinality-13
Product exploration explored 100000 steps with 363 reset in 440 ms.
Product exploration explored 100000 steps with 362 reset in 405 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 120 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 1092 steps (0 resets) in 26 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 11 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p2), (NOT p2)]
[2025-06-06 15:31:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:31:47] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-06 15:31:47] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2025-06-06 15:31:47] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:31:48] [INFO ] [Real]Added 3390 Read/Feed constraints in 483 ms returned sat
[2025-06-06 15:31:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:31:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-06 15:31:50] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2025-06-06 15:31:51] [INFO ] [Nat]Added 3390 Read/Feed constraints in 694 ms returned sat
[2025-06-06 15:31:51] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 342 ms.
[2025-06-06 15:31:52] [INFO ] Added : 0 causal constraints over 0 iterations in 626 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 62 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:31:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:31:52] [INFO ] Implicit Places using invariants in 323 ms returned []
[2025-06-06 15:31:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:31:53] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:32:03] [INFO ] Implicit Places using invariants and state equation in 11374 ms returned []
Implicit Place search using SMT with State Equation took 11701 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:32:04] [INFO ] Redundant transitions in 168 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:32:04] [INFO ] Invariant cache hit.
[2025-06-06 15:32:04] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:32:28] [INFO ] Deduced a trap composed of 129 places in 2357 ms of which 2035 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:32:28] [INFO ] Deduced a trap composed of 129 places in 424 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:32:36] [INFO ] Deduced a trap composed of 130 places in 8257 ms of which 7946 ms to minimize.
SMT process timed out in 32751ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32758ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44702 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 1098 steps (0 resets) in 26 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p2), (NOT p2)]
[2025-06-06 15:32:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:32:39] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-06 15:32:39] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2025-06-06 15:32:39] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:32:40] [INFO ] [Real]Added 3390 Read/Feed constraints in 444 ms returned sat
[2025-06-06 15:32:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:32:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-06 15:32:42] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2025-06-06 15:32:43] [INFO ] [Nat]Added 3390 Read/Feed constraints in 607 ms returned sat
[2025-06-06 15:32:43] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 234 ms.
[2025-06-06 15:32:43] [INFO ] Added : 0 causal constraints over 0 iterations in 494 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 362 reset in 386 ms.
Product exploration explored 100000 steps with 361 reset in 408 ms.
Built C files in :
/tmp/ltsmin13260764620140553989
[2025-06-06 15:32:44] [INFO ] Too many transitions (3616) to apply POR reductions. Disabling POR matrices.
[2025-06-06 15:32:44] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13260764620140553989
Running compilation step : cd /tmp/ltsmin13260764620140553989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13260764620140553989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13260764620140553989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 65 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:32:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:32:48] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-06-06 15:32:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:32:48] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:32:58] [INFO ] Implicit Places using invariants and state equation in 10472 ms returned []
Implicit Place search using SMT with State Equation took 10798 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:32:58] [INFO ] Redundant transitions in 166 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:32:58] [INFO ] Invariant cache hit.
[2025-06-06 15:32:58] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:33:21] [INFO ] Deduced a trap composed of 129 places in 2271 ms of which 1985 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:33:21] [INFO ] Deduced a trap composed of 129 places in 389 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:33:29] [INFO ] Deduced a trap composed of 130 places in 8048 ms of which 7716 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:33:30] [INFO ] Deduced a trap composed of 129 places in 477 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:33:31] [INFO ] Deduced a trap composed of 130 places in 1141 ms of which 844 ms to minimize.
SMT process timed out in 32964ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32971ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44022 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin11627036784603260660
[2025-06-06 15:33:31] [INFO ] Too many transitions (3616) to apply POR reductions. Disabling POR matrices.
[2025-06-06 15:33:31] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11627036784603260660
Running compilation step : cd /tmp/ltsmin11627036784603260660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11627036784603260660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11627036784603260660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 15:33:34] [INFO ] Flatten gal took : 67 ms
[2025-06-06 15:33:34] [INFO ] Flatten gal took : 69 ms
[2025-06-06 15:33:34] [INFO ] Time to serialize gal into /tmp/LTL14105112756145569949.gal : 12 ms
[2025-06-06 15:33:34] [INFO ] Time to serialize properties into /tmp/LTL8138633378888345925.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14105112756145569949.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8753193820303565943.hoa' '-atoms' '/tmp/LTL8138633378888345925.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8138633378888345925.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8753193820303565943.hoa
Detected timeout of ITS tools.
[2025-06-06 15:33:50] [INFO ] Flatten gal took : 67 ms
[2025-06-06 15:33:50] [INFO ] Flatten gal took : 69 ms
[2025-06-06 15:33:50] [INFO ] Time to serialize gal into /tmp/LTL14472122484977129895.gal : 10 ms
[2025-06-06 15:33:50] [INFO ] Time to serialize properties into /tmp/LTL4215854789485360383.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14472122484977129895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4215854789485360383.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("((State_5_1==0)||(State_13_3==1))")U("((((State_6_8==0)||(State_1_12==1))&&((State_5_15==0)||(State_13_5==1)))&&((State_13_2==0)...224
Formula 0 simplified : (!"((State_5_1==0)||(State_13_3==1))" R !"((((State_6_8==0)||(State_1_12==1))&&((State_5_15==0)||(State_13_5==1)))&&((State_13_2==0)...217
Detected timeout of ITS tools.
[2025-06-06 15:34:05] [INFO ] Flatten gal took : 61 ms
[2025-06-06 15:34:05] [INFO ] Applying decomposition
[2025-06-06 15:34:05] [INFO ] Flatten gal took : 64 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/graph4731085684081099370.txt' '-o' '/tmp/graph4731085684081099370.bin' '-w' '/tmp/graph4731085684081099370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4731085684081099370.bin' '-l' '-1' '-v' '-w' '/tmp/graph4731085684081099370.weights' '-q' '0' '-e' '0.001'
[2025-06-06 15:34:05] [INFO ] Decomposing Gal with order
[2025-06-06 15:34:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 15:34:05] [INFO ] Removed a total of 8050 redundant transitions.
[2025-06-06 15:34:05] [INFO ] Flatten gal took : 145 ms
[2025-06-06 15:34:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 233 labels/synchronizations in 62 ms.
[2025-06-06 15:34:05] [INFO ] Time to serialize gal into /tmp/LTL3189805356195758456.gal : 22 ms
[2025-06-06 15:34:05] [INFO ] Time to serialize properties into /tmp/LTL15012895634163558182.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3189805356195758456.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15012895634163558182.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((("((i2.i0.i3.u44.State_5_1==0)||(i0.u65.State_13_3==1))")U("((((i3.u59.State_6_8==0)||(i3.u72.State_1_12==1))&&((i3.u27.State_5_15...301
Formula 0 simplified : (!"((i2.i0.i3.u44.State_5_1==0)||(i0.u65.State_13_3==1))" R !"((((i3.u59.State_6_8==0)||(i3.u72.State_1_12==1))&&((i3.u27.State_5_15...294
Detected timeout of ITS tools.
Treatment of property TokenRing-PT-015-LTLCardinality-13 finished in 201289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0))&&(!p1 U (p2||G(!p1)))) U X(p0)))'
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 27 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:34:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:34:21] [INFO ] Implicit Places using invariants in 362 ms returned []
[2025-06-06 15:34:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:34:21] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:34:33] [INFO ] Implicit Places using invariants and state equation in 12268 ms returned []
Implicit Place search using SMT with State Equation took 12637 ms to find 0 implicit places.
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:34:33] [INFO ] Invariant cache hit.
[2025-06-06 15:34:33] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:34:56] [INFO ] Deduced a trap composed of 129 places in 2273 ms of which 1987 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:34:56] [INFO ] Deduced a trap composed of 129 places in 409 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:05] [INFO ] Deduced a trap composed of 130 places in 8340 ms of which 8052 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:05] [INFO ] Deduced a trap composed of 129 places in 483 ms of which 172 ms to minimize.
SMT process timed out in 32229ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32235ms
Finished structural reductions in LTL mode , in 1 iterations and 44906 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p2) p1), (OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-015-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 381 ms.
Product exploration explored 100000 steps with 50000 reset in 384 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 17 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TokenRing-PT-015-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TokenRing-PT-015-LTLCardinality-14 finished in 45972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 59 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:35:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:35:07] [INFO ] Implicit Places using invariants in 356 ms returned []
[2025-06-06 15:35:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:35:07] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:35:20] [INFO ] Implicit Places using invariants and state equation in 13459 ms returned []
Implicit Place search using SMT with State Equation took 13817 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:35:20] [INFO ] Redundant transitions in 161 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:35:20] [INFO ] Invariant cache hit.
[2025-06-06 15:35:20] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:43] [INFO ] Deduced a trap composed of 129 places in 2285 ms of which 2009 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:44] [INFO ] Deduced a trap composed of 129 places in 403 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:52] [INFO ] Deduced a trap composed of 130 places in 8091 ms of which 7807 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:52] [INFO ] Deduced a trap composed of 129 places in 461 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:35:54] [INFO ] Deduced a trap composed of 130 places in 1139 ms of which 846 ms to minimize.
SMT process timed out in 33121ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33127ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47182 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : TokenRing-PT-015-LTLCardinality-15
Product exploration explored 100000 steps with 516 reset in 400 ms.
Product exploration explored 100000 steps with 515 reset in 401 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 779 steps (0 resets) in 15 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2025-06-06 15:35:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:35:56] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-06 15:35:57] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2025-06-06 15:35:57] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:35:57] [INFO ] [Real]Added 3390 Read/Feed constraints in 535 ms returned sat
[2025-06-06 15:35:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:35:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-06 15:35:59] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2025-06-06 15:36:00] [INFO ] [Nat]Added 3390 Read/Feed constraints in 628 ms returned sat
[2025-06-06 15:36:00] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 241 ms.
[2025-06-06 15:36:00] [INFO ] Added : 2 causal constraints over 1 iterations in 623 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 62 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:36:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:36:01] [INFO ] Implicit Places using invariants in 350 ms returned []
[2025-06-06 15:36:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:36:02] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:36:14] [INFO ] Implicit Places using invariants and state equation in 12974 ms returned []
Implicit Place search using SMT with State Equation took 13330 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:36:14] [INFO ] Redundant transitions in 167 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:36:14] [INFO ] Invariant cache hit.
[2025-06-06 15:36:14] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:36:37] [INFO ] Deduced a trap composed of 129 places in 2268 ms of which 1998 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:36:38] [INFO ] Deduced a trap composed of 129 places in 367 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:36:46] [INFO ] Deduced a trap composed of 130 places in 8043 ms of which 7772 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:36:46] [INFO ] Deduced a trap composed of 129 places in 435 ms of which 168 ms to minimize.
SMT process timed out in 32269ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 32274ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45851 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 784 steps (0 resets) in 14 ms. (52 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2025-06-06 15:36:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:36:48] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-06 15:36:48] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2025-06-06 15:36:49] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:36:49] [INFO ] [Real]Added 3390 Read/Feed constraints in 516 ms returned sat
[2025-06-06 15:36:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 15:36:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-06 15:36:51] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2025-06-06 15:36:52] [INFO ] [Nat]Added 3390 Read/Feed constraints in 590 ms returned sat
[2025-06-06 15:36:52] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 319 ms.
[2025-06-06 15:36:52] [INFO ] Added : 2 causal constraints over 1 iterations in 694 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 518 reset in 409 ms.
Product exploration explored 100000 steps with 516 reset in 407 ms.
Built C files in :
/tmp/ltsmin2761394638845223272
[2025-06-06 15:36:53] [INFO ] Too many transitions (3616) to apply POR reductions. Disabling POR matrices.
[2025-06-06 15:36:53] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2761394638845223272
Running compilation step : cd /tmp/ltsmin2761394638845223272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2761394638845223272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2761394638845223272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 63 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2025-06-06 15:36:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:36:57] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-06-06 15:36:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 15:36:57] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2025-06-06 15:37:09] [INFO ] Implicit Places using invariants and state equation in 12492 ms returned []
Implicit Place search using SMT with State Equation took 12857 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 15:37:09] [INFO ] Redundant transitions in 161 ms returned []
Running 3601 sub problems to find dead transitions.
[2025-06-06 15:37:09] [INFO ] Invariant cache hit.
[2025-06-06 15:37:09] [INFO ] State equation strengthened by 3390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:33] [INFO ] Deduced a trap composed of 129 places in 2299 ms of which 2034 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:33] [INFO ] Deduced a trap composed of 129 places in 389 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:41] [INFO ] Deduced a trap composed of 130 places in 7933 ms of which 7645 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:41] [INFO ] Deduced a trap composed of 129 places in 462 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 15:37:43] [INFO ] Deduced a trap composed of 130 places in 1131 ms of which 839 ms to minimize.
SMT process timed out in 33233ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 33239ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46334 ms. Remains : 256/256 places, 3616/3616 transitions.
Built C files in :
/tmp/ltsmin9978352556056797274
[2025-06-06 15:37:43] [INFO ] Too many transitions (3616) to apply POR reductions. Disabling POR matrices.
[2025-06-06 15:37:43] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9978352556056797274
Running compilation step : cd /tmp/ltsmin9978352556056797274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9978352556056797274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9978352556056797274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 15:37:46] [INFO ] Flatten gal took : 70 ms
[2025-06-06 15:37:46] [INFO ] Flatten gal took : 67 ms
[2025-06-06 15:37:46] [INFO ] Time to serialize gal into /tmp/LTL6361978273485736717.gal : 14 ms
[2025-06-06 15:37:46] [INFO ] Time to serialize properties into /tmp/LTL3869303086165730890.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6361978273485736717.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15159426126620462669.hoa' '-atoms' '/tmp/LTL3869303086165730890.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3869303086165730890.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15159426126620462669.hoa
Detected timeout of ITS tools.
[2025-06-06 15:38:01] [INFO ] Flatten gal took : 59 ms
[2025-06-06 15:38:01] [INFO ] Flatten gal took : 62 ms
[2025-06-06 15:38:01] [INFO ] Time to serialize gal into /tmp/LTL6737666343269366313.gal : 9 ms
[2025-06-06 15:38:01] [INFO ] Time to serialize properties into /tmp/LTL13052493501357179825.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6737666343269366313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13052493501357179825.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("((State_3_10==1)&&(State_9_0==0))")))
Formula 0 simplified : G!"((State_3_10==1)&&(State_9_0==0))"
Detected timeout of ITS tools.
[2025-06-06 15:38:16] [INFO ] Flatten gal took : 58 ms
[2025-06-06 15:38:16] [INFO ] Applying decomposition
[2025-06-06 15:38:16] [INFO ] Flatten gal took : 61 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/graph2252336937596658877.txt' '-o' '/tmp/graph2252336937596658877.bin' '-w' '/tmp/graph2252336937596658877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2252336937596658877.bin' '-l' '-1' '-v' '-w' '/tmp/graph2252336937596658877.weights' '-q' '0' '-e' '0.001'
[2025-06-06 15:38:16] [INFO ] Decomposing Gal with order
[2025-06-06 15:38:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 15:38:17] [INFO ] Removed a total of 8064 redundant transitions.
[2025-06-06 15:38:17] [INFO ] Flatten gal took : 114 ms
[2025-06-06 15:38:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 25 ms.
[2025-06-06 15:38:17] [INFO ] Time to serialize gal into /tmp/LTL16199581740723729084.gal : 14 ms
[2025-06-06 15:38:17] [INFO ] Time to serialize properties into /tmp/LTL9646345754839315173.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16199581740723729084.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9646345754839315173.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F("((i3.i1.u24.State_3_10==1)&&(i1.i0.u0.State_9_0==0))")))
Formula 0 simplified : G!"((i3.i1.u24.State_3_10==1)&&(i1.i0.u0.State_9_0==0))"
Detected timeout of ITS tools.
Treatment of property TokenRing-PT-015-LTLCardinality-15 finished in 205299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((X(p1)||F((G(F(!p2))||(F(!p2)&&G(!p3)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&G(F(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2025-06-06 15:38:32] [INFO ] Flatten gal took : 63 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16578622865206956342
[2025-06-06 15:38:32] [INFO ] Too many transitions (3616) to apply POR reductions. Disabling POR matrices.
[2025-06-06 15:38:32] [INFO ] Applying decomposition
[2025-06-06 15:38:32] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16578622865206956342
Running compilation step : cd /tmp/ltsmin16578622865206956342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-06 15:38:32] [INFO ] Flatten gal took : 65 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/graph34915405666377213.txt' '-o' '/tmp/graph34915405666377213.bin' '-w' '/tmp/graph34915405666377213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph34915405666377213.bin' '-l' '-1' '-v' '-w' '/tmp/graph34915405666377213.weights' '-q' '0' '-e' '0.001'
[2025-06-06 15:38:32] [INFO ] Decomposing Gal with order
[2025-06-06 15:38:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 15:38:33] [INFO ] Removed a total of 8120 redundant transitions.
[2025-06-06 15:38:33] [INFO ] Flatten gal took : 112 ms
[2025-06-06 15:38:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 33 ms.
[2025-06-06 15:38:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality2829292018915174015.gal : 13 ms
[2025-06-06 15:38:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality9927939421641758401.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2829292018915174015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9927939421641758401.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((F((G("((i0.u33.State_15_11==0)&&(i0.u42.State_10_13==1))"))||(G((X("((i0.u18.State_11_5==0)||(i10.u41.State_3_15==1))"))||(F((G(F(!...345
Formula 0 simplified : G(F!"((i0.u33.State_15_11==0)&&(i0.u42.State_10_13==1))" & F(X!"((i0.u18.State_11_5==0)||(i10.u41.State_3_15==1))" & G(FG"((i0.u34.S...313
Compilation finished in 8322 ms.
Running link step : cd /tmp/ltsmin16578622865206956342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin16578622865206956342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((X((LTLAPp1==true))||<>(([](<>(!(LTLAPp2==true)))||(<>(!(LTLAPp2==true))&&[](!(LTLAPp3==true)))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t28, t36, t37, t49, t64, t70, t76, t79, t81, t101, t114, t116, t130, t136, t138, t1...7802
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin16578622865206956342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((X((LTLAPp1==true))||<>(([](<>(!(LTLAPp2==true)))||(<>(!(LTLAPp2==true))&&[](!(LTLAPp3==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16578622865206956342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(((LTLAPp4==true) U (LTLAPp5==true))&&[](<>((LTLAPp6==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin16578622865206956342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(((LTLAPp4==true) U (LTLAPp5==true))&&[](<>((LTLAPp6==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16578622865206956342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp7==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin16578622865206956342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp7==true))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin16578622865206956342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((X((LTLAPp1==true))||<>(([](<>(!(LTLAPp2==true)))||(<>(!(LTLAPp2==true))&&[](!(LTLAPp3==true)))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-06 16:03:43] [INFO ] Applying decomposition
[2025-06-06 16:03:43] [INFO ] Flatten gal took : 196 ms
[2025-06-06 16:03:43] [INFO ] Decomposing Gal with order
[2025-06-06 16:03:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 16:03:44] [INFO ] Removed a total of 3360 redundant transitions.
[2025-06-06 16:03:44] [INFO ] Flatten gal took : 1235 ms
[2025-06-06 16:03:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 3600 labels/synchronizations in 599 ms.
[2025-06-06 16:03:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality10158232242310979826.gal : 20 ms
[2025-06-06 16:03:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality16210167677356837010.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10158232242310979826.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16210167677356837010.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((F((G("((u16.State_15_11==0)&&(u11.State_10_13==1))"))||(G((X("((u12.State_11_5==0)||(u4.State_3_15==1))"))||(F((G(F(!("((u14.State_...303
Formula 0 simplified : G(F!"((u16.State_15_11==0)&&(u11.State_10_13==1))" & F(X!"((u12.State_11_5==0)||(u4.State_3_15==1))" & G(FG"((u14.State_13_1==0)||(u...271
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t13, t20, t30, t34, t68, t69, t79, t81, t85, t128, t131, t144, t155, t162, t165, t171...1854
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="TokenRing-PT-015"
export BK_EXAMINATION="LTLCardinality"
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 TokenRing-PT-015, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r240-tall-174915589600347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-015.tgz
mv TokenRing-PT-015 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;