About the Execution of ITS-Tools for NoC3x3-PT-2A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 204574.00 | 0.00 | 0.00 | FTFTTFFFTTFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812100171.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 NoC3x3-PT-2A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812100171
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 127K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748815561829
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 22:06:03] [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-01 22:06:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 22:06:03] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2025-06-01 22:06:03] [INFO ] Transformed 361 places.
[2025-06-01 22:06:03] [INFO ] Transformed 428 transitions.
[2025-06-01 22:06:03] [INFO ] Found NUPN structural information;
[2025-06-01 22:06:03] [INFO ] Parsed PT model containing 361 places and 428 transitions and 1697 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-2A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 428/428 transitions.
Ensure Unique test removed 24 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 337 transition count 428
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 119 place count 242 transition count 310
Ensure Unique test removed 30 places
Iterating global reduction 1 with 125 rules applied. Total rules applied 244 place count 212 transition count 310
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 298 place count 212 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 318 place count 212 transition count 236
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 324 place count 206 transition count 236
Applied a total of 324 rules in 66 ms. Remains 206 /361 variables (removed 155) and now considering 236/428 (removed 192) transitions.
[2025-06-01 22:06:03] [INFO ] Flow matrix only has 227 transitions (discarded 9 similar events)
// Phase 1: matrix 227 rows 206 cols
[2025-06-01 22:06:03] [INFO ] Computed 67 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:06:03] [INFO ] Implicit Places using invariants in 277 ms returned [7, 60, 122, 127, 152, 167, 172]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 308 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/361 places, 236/428 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 395 ms. Remains : 199/361 places, 236/428 transitions.
Support contains 25 out of 199 places after structural reductions.
[2025-06-01 22:06:03] [INFO ] Flatten gal took : 45 ms
[2025-06-01 22:06:04] [INFO ] Flatten gal took : 19 ms
[2025-06-01 22:06:04] [INFO ] Input system was already deterministic with 236 transitions.
Support contains 24 out of 199 places (down from 25) after GAL structural reductions.
RANDOM walk for 36816 steps (8 resets) in 1138 ms. (32 steps per ms) remains 0/14 properties
Computed a total of 2 stabilizing places and 1 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' '!(G(F(p0)))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 236/236 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 197 transition count 171
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 151 place count 125 transition count 157
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 154 place count 122 transition count 153
Ensure Unique test removed 2 places
Iterating global reduction 2 with 5 rules applied. Total rules applied 159 place count 120 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 163 place count 120 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 165 place count 118 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 118 transition count 148
Applied a total of 166 rules in 24 ms. Remains 118 /199 variables (removed 81) and now considering 148/236 (removed 88) transitions.
// Phase 1: matrix 148 rows 118 cols
[2025-06-01 22:06:04] [INFO ] Computed 49 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:06:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-01 22:06:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:06:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 22:06:04] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:06:04] [INFO ] Redundant transitions in 66 ms returned [23, 30, 31, 46, 47, 58, 59, 60, 61, 62, 69, 70, 73, 84, 99, 100, 102, 106, 111, 112, 118, 119, 120, 122, 126, 129, 130, 131, 132, 138, 139, 140, 141, 147]
Found 34 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 34 transitions
Redundant transitions reduction (with SMT) removed 34 transitions.
Running 89 sub problems to find dead transitions.
// Phase 1: matrix 114 rows 118 cols
[2025-06-01 22:06:04] [INFO ] Computed 49 invariants in 1 ms
[2025-06-01 22:06:05] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 14/118 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 113/231 variables, 118/167 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/232 variables, and 176 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1982 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 118/118 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 14/118 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 113/231 variables, 118/167 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 89/265 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/231 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/232 variables, and 265 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2603 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 118/118 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4616ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4625ms
Starting structural reductions in SI_LTL mode, iteration 1 : 118/199 places, 114/236 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 118 transition count 101
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 92 transition count 101
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 92 transition count 96
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 44 edges and 82 vertex of which 16 / 82 are part of one of the 8 SCC in 1 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 74 transition count 91
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 70 place count 73 transition count 82
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 94 place count 57 transition count 74
Graph (trivial) has 36 edges and 57 vertex of which 14 / 57 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 50 transition count 74
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 102 place count 50 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 117 place count 50 transition count 52
Applied a total of 117 rules in 23 ms. Remains 50 /118 variables (removed 68) and now considering 52/114 (removed 62) transitions.
// Phase 1: matrix 52 rows 50 cols
[2025-06-01 22:06:09] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:06:09] [INFO ] Implicit Places using invariants in 35 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/199 places, 52/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4973 ms. Remains : 49/199 places, 52/236 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-00 finished in 5207 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((G(F(p0)) U p1)))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 236/236 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 189 transition count 225
Ensure Unique test removed 2 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 187 transition count 225
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 30 place count 187 transition count 217
Applied a total of 30 rules in 11 ms. Remains 187 /199 variables (removed 12) and now considering 217/236 (removed 19) transitions.
[2025-06-01 22:06:09] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
// Phase 1: matrix 209 rows 187 cols
[2025-06-01 22:06:09] [INFO ] Computed 58 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:06:09] [INFO ] Implicit Places using invariants in 71 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/199 places, 217/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 186 /186 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 186/199 places, 217/236 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 526 ms.
Product exploration explored 100000 steps with 50000 reset in 414 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-2A-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-2A-LTLCardinality-01 finished in 1236 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(X((G(p0) U X(G(p1))))))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 236/236 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 188 transition count 224
Ensure Unique test removed 2 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 24 place count 186 transition count 224
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 33 place count 186 transition count 215
Applied a total of 33 rules in 12 ms. Remains 186 /199 variables (removed 13) and now considering 215/236 (removed 21) transitions.
[2025-06-01 22:06:11] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
// Phase 1: matrix 207 rows 186 cols
[2025-06-01 22:06:11] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:06:11] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-01 22:06:11] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2025-06-01 22:06:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:06:11] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-01 22:06:11] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-01 22:06:11] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2025-06-01 22:06:11] [INFO ] Invariant cache hit.
[2025-06-01 22:06:11] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/392 variables, 186/244 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 1/393 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/393 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 255 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8279 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 186/186 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/392 variables, 186/244 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 214/468 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/393 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/393 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 469 constraints, problems are : Problem set: 0 solved, 214 unsolved in 20932 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 186/186 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29258ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 29261ms
Starting structural reductions in LTL mode, iteration 1 : 186/199 places, 215/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29517 ms. Remains : 186/199 places, 215/236 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-04
Product exploration explored 100000 steps with 20021 reset in 366 ms.
Product exploration explored 100000 steps with 20012 reset in 423 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/186 stabilizing places and 1/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 307 ms. (129 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
[2025-06-01 22:06:42] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2025-06-01 22:06:42] [INFO ] Invariant cache hit.
[2025-06-01 22:06:42] [INFO ] State equation strengthened by 11 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 172/186 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 206/392 variables, 186/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/393 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/393 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1276 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 186/186 constraints, ReadFeed: 11/11 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 14/393 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 4/58 constraints, State Equation: 0/186 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1309ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 325 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
[2025-06-01 22:06:44] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2025-06-01 22:06:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 22:06:44] [INFO ] [Real]Absence check using 58 positive place invariants in 8 ms returned sat
[2025-06-01 22:06:44] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-06-01 22:06:44] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-01 22:06:44] [INFO ] [Real]Added 11 Read/Feed constraints in 3 ms returned sat
[2025-06-01 22:06:44] [INFO ] Computed and/alt/rep : 205/616/205 causal constraints (skipped 1 transitions) in 15 ms.
[2025-06-01 22:06:44] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 215/215 transitions.
Applied a total of 0 rules in 1 ms. Remains 186 /186 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2025-06-01 22:06:44] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2025-06-01 22:06:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:06:44] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-01 22:06:44] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2025-06-01 22:06:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:06:44] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-01 22:06:44] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-01 22:06:44] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2025-06-01 22:06:44] [INFO ] Invariant cache hit.
[2025-06-01 22:06:44] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/392 variables, 186/244 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 1/393 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/393 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 255 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8342 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 186/186 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/392 variables, 186/244 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 214/468 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/393 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/393 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 469 constraints, problems are : Problem set: 0 solved, 214 unsolved in 21029 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 186/186 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29408ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 29410ms
Finished structural reductions in LTL mode , in 1 iterations and 29635 ms. Remains : 186/186 places, 215/215 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/186 stabilizing places and 1/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
RANDOM walk for 5611 steps (1 resets) in 25 ms. (215 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
[2025-06-01 22:07:15] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2025-06-01 22:07:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 22:07:15] [INFO ] [Real]Absence check using 58 positive place invariants in 8 ms returned sat
[2025-06-01 22:07:15] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-06-01 22:07:15] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-01 22:07:15] [INFO ] [Real]Added 11 Read/Feed constraints in 1 ms returned sat
[2025-06-01 22:07:15] [INFO ] Computed and/alt/rep : 205/616/205 causal constraints (skipped 1 transitions) in 9 ms.
[2025-06-01 22:07:15] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Product exploration explored 100000 steps with 20003 reset in 300 ms.
Product exploration explored 100000 steps with 20061 reset in 328 ms.
Applying partial POR strategy [false, false, true, false, false, true, true]
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 215/215 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 186 transition count 215
Deduced a syphon composed of 60 places in 1 ms
Applied a total of 60 rules in 17 ms. Remains 186 /186 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:07:16] [INFO ] Redundant transitions in 7 ms returned []
Running 214 sub problems to find dead transitions.
[2025-06-01 22:07:16] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
// Phase 1: matrix 207 rows 186 cols
[2025-06-01 22:07:16] [INFO ] Computed 58 invariants in 1 ms
[2025-06-01 22:07:16] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:18] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 9 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:18] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:18] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:18] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD77 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD81 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 20/78 constraints. Problems are: Problem set: 45 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
Problem TDEAD114 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD136 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD138 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
Problem TDEAD145 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:07:20] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD154 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 11/89 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/89 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 206/392 variables, 186/275 constraints. Problems are: Problem set: 60 solved, 154 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 34/309 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/309 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 1/393 variables, 1/310 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/310 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/393 variables, 0/310 constraints. Problems are: Problem set: 60 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 310 constraints, problems are : Problem set: 60 solved, 154 unsolved in 7720 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 186/186 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 60 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 61/186 variables, 58/58 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 31/89 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/89 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 206/392 variables, 186/275 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 34/309 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 154/463 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/463 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 1/393 variables, 1/464 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/464 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/393 variables, 0/464 constraints. Problems are: Problem set: 60 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 464 constraints, problems are : Problem set: 60 solved, 154 unsolved in 16356 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 186/186 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 154/214 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24111ms problems are : Problem set: 60 solved, 154 unsolved
Search for dead transitions found 60 dead transitions in 24113ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 186/186 places, 155/215 transitions.
Graph (complete) has 437 edges and 186 vertex of which 126 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.5 ms
Discarding 60 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 126 /186 variables (removed 60) and now considering 155/155 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 126/186 places, 155/215 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24158 ms. Remains : 126/186 places, 155/215 transitions.
Built C files in :
/tmp/ltsmin18379945990146921401
[2025-06-01 22:07:40] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18379945990146921401
Running compilation step : cd /tmp/ltsmin18379945990146921401;'/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'
Compilation finished in 482 ms.
Running link step : cd /tmp/ltsmin18379945990146921401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin18379945990146921401;'/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' '--hoa' '/tmp/stateBased10277314701126050687.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 186 /186 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2025-06-01 22:07:56] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
// Phase 1: matrix 207 rows 186 cols
[2025-06-01 22:07:56] [INFO ] Computed 58 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:07:56] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-01 22:07:56] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2025-06-01 22:07:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:07:56] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-01 22:07:56] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-01 22:07:56] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2025-06-01 22:07:56] [INFO ] Invariant cache hit.
[2025-06-01 22:07:56] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/392 variables, 186/244 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 1/393 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/393 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 255 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8249 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 186/186 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/392 variables, 186/244 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 214/468 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/393 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/393 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 469 constraints, problems are : Problem set: 0 solved, 214 unsolved in 20793 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 186/186 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29063ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 29064ms
Finished structural reductions in LTL mode , in 1 iterations and 29331 ms. Remains : 186/186 places, 215/215 transitions.
Built C files in :
/tmp/ltsmin1752072942723672178
[2025-06-01 22:08:25] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1752072942723672178
Running compilation step : cd /tmp/ltsmin1752072942723672178;'/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'
Compilation finished in 338 ms.
Running link step : cd /tmp/ltsmin1752072942723672178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1752072942723672178;'/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' '--hoa' '/tmp/stateBased9475293968169131857.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 22:08:40] [INFO ] Flatten gal took : 13 ms
[2025-06-01 22:08:40] [INFO ] Flatten gal took : 12 ms
[2025-06-01 22:08:40] [INFO ] Time to serialize gal into /tmp/LTL1922799199071882008.gal : 4 ms
[2025-06-01 22:08:40] [INFO ] Time to serialize properties into /tmp/LTL14124934573502804409.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/LTL1922799199071882008.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6207255752197667520.hoa' '-atoms' '/tmp/LTL14124934573502804409.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/LTL14124934573502804409.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6207255752197667520.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-01 22:08:55] [INFO ] Flatten gal took : 12 ms
[2025-06-01 22:08:55] [INFO ] Flatten gal took : 11 ms
[2025-06-01 22:08:55] [INFO ] Time to serialize gal into /tmp/LTL12641415240854098104.gal : 2 ms
[2025-06-01 22:08:55] [INFO ] Time to serialize properties into /tmp/LTL1615332778567672653.ltl : 3 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/LTL12641415240854098104.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1615332778567672653.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 : !((X(X((G("((p282==0)||(p272==1))"))U(X(G("(p75==1)")))))))
Formula 0 simplified : XX(F!"((p282==0)||(p272==1))" R XF!"(p75==1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-01 22:09:10] [INFO ] Flatten gal took : 17 ms
[2025-06-01 22:09:10] [INFO ] Applying decomposition
[2025-06-01 22:09:10] [INFO ] Flatten gal took : 13 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/graph11343028325405084589.txt' '-o' '/tmp/graph11343028325405084589.bin' '-w' '/tmp/graph11343028325405084589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11343028325405084589.bin' '-l' '-1' '-v' '-w' '/tmp/graph11343028325405084589.weights' '-q' '0' '-e' '0.001'
[2025-06-01 22:09:10] [INFO ] Decomposing Gal with order
[2025-06-01 22:09:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 22:09:10] [INFO ] Removed a total of 44 redundant transitions.
[2025-06-01 22:09:10] [INFO ] Flatten gal took : 48 ms
[2025-06-01 22:09:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2025-06-01 22:09:10] [INFO ] Time to serialize gal into /tmp/LTL4347914000794561737.gal : 5 ms
[2025-06-01 22:09:10] [INFO ] Time to serialize properties into /tmp/LTL6555061599765262875.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/LTL4347914000794561737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6555061599765262875.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 : !((X(X((G("((i6.u34.p282==0)||(i6.u37.p272==1))"))U(X(G("(i2.i0.u8.p75==1)")))))))
Formula 0 simplified : XX(F!"((i6.u34.p282==0)||(i6.u37.p272==1))" R XF!"(i2.i0.u8.p75==1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
0 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
44 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.468857,33120,1,0,34560,1145,2180,50153,290,5014,73564
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NoC3x3-PT-2A-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property NoC3x3-PT-2A-LTLCardinality-04 finished in 180417 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)))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 236/236 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 197 transition count 170
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 155 place count 123 transition count 155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 159 place count 119 transition count 150
Ensure Unique test removed 2 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 165 place count 117 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 168 place count 117 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 169 place count 116 transition count 147
Applied a total of 169 rules in 21 ms. Remains 116 /199 variables (removed 83) and now considering 147/236 (removed 89) transitions.
// Phase 1: matrix 147 rows 116 cols
[2025-06-01 22:09:11] [INFO ] Computed 48 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:11] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 22:09:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 22:09:11] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:09:11] [INFO ] Redundant transitions in 67 ms returned [23, 30, 31, 44, 45, 56, 57, 58, 61, 68, 69, 72, 83, 98, 99, 101, 105, 108, 109, 110, 116, 117, 118, 120, 124, 127, 128, 129, 130, 133, 136, 137, 138, 139]
Found 34 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 34 transitions
Redundant transitions reduction (with SMT) removed 34 transitions.
Running 88 sub problems to find dead transitions.
// Phase 1: matrix 113 rows 116 cols
[2025-06-01 22:09:11] [INFO ] Computed 48 invariants in 0 ms
[2025-06-01 22:09:11] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 12/116 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/228 variables, 116/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/229 variables, and 173 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1622 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 12/116 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/228 variables, 116/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 88/261 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/229 variables, and 261 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2342 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3972ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 3972ms
Starting structural reductions in SI_LTL mode, iteration 1 : 116/199 places, 113/236 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 116 transition count 101
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 92 transition count 101
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 92 transition count 97
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 48 edges and 84 vertex of which 16 / 84 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 53 place count 76 transition count 93
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 61 place count 76 transition count 85
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 88 place count 58 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 57 transition count 75
Graph (trivial) has 39 edges and 57 vertex of which 16 / 57 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 49 transition count 75
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 99 place count 49 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 116 place count 49 transition count 50
Applied a total of 116 rules in 18 ms. Remains 49 /116 variables (removed 67) and now considering 50/113 (removed 63) transitions.
// Phase 1: matrix 50 rows 49 cols
[2025-06-01 22:09:15] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:15] [INFO ] Implicit Places using invariants in 39 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/199 places, 50/236 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 50
Applied a total of 1 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 47 cols
[2025-06-01 22:09:15] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:15] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-01 22:09:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 22:09:15] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 47/199 places, 50/236 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4351 ms. Remains : 47/199 places, 50/236 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 92 ms.
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-07 finished in 4489 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))&&F(p1)))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 236/236 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 191 transition count 227
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 17 place count 190 transition count 227
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 23 place count 190 transition count 221
Applied a total of 23 rules in 6 ms. Remains 190 /199 variables (removed 9) and now considering 221/236 (removed 15) transitions.
[2025-06-01 22:09:16] [INFO ] Flow matrix only has 213 transitions (discarded 8 similar events)
// Phase 1: matrix 213 rows 190 cols
[2025-06-01 22:09:16] [INFO ] Computed 59 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:16] [INFO ] Implicit Places using invariants in 71 ms returned [44, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/199 places, 221/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 188/199 places, 221/236 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Product exploration explored 100000 steps with 50000 reset in 336 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-2A-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-2A-LTLCardinality-08 finished in 890 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(X(G(p0))))'
Support contains 1 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 236/236 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 188 transition count 224
Ensure Unique test removed 2 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 24 place count 186 transition count 224
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 33 place count 186 transition count 215
Applied a total of 33 rules in 6 ms. Remains 186 /199 variables (removed 13) and now considering 215/236 (removed 21) transitions.
[2025-06-01 22:09:16] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
// Phase 1: matrix 207 rows 186 cols
[2025-06-01 22:09:16] [INFO ] Computed 58 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:16] [INFO ] Implicit Places using invariants in 76 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/199 places, 215/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 185 /185 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 185/199 places, 215/236 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-10 finished in 194 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((p0&&F(p1))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 236/236 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 190 transition count 226
Ensure Unique test removed 1 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 19 place count 189 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 26 place count 189 transition count 219
Applied a total of 26 rules in 8 ms. Remains 189 /199 variables (removed 10) and now considering 219/236 (removed 17) transitions.
[2025-06-01 22:09:17] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 189 cols
[2025-06-01 22:09:17] [INFO ] Computed 59 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:17] [INFO ] Implicit Places using invariants in 79 ms returned [21, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/199 places, 219/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 187 /187 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 187/199 places, 219/236 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-12 finished in 228 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(G(p0)))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 236/236 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 190 transition count 227
Ensure Unique test removed 2 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 20 place count 188 transition count 227
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 188 transition count 219
Applied a total of 28 rules in 10 ms. Remains 188 /199 variables (removed 11) and now considering 219/236 (removed 17) transitions.
[2025-06-01 22:09:17] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 188 cols
[2025-06-01 22:09:17] [INFO ] Computed 58 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:17] [INFO ] Implicit Places using invariants in 76 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/199 places, 219/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 187 /187 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 187/199 places, 219/236 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-13 finished in 198 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 G(!p0)))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 236/236 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 197 transition count 171
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 152 place count 124 transition count 157
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 156 place count 120 transition count 152
Ensure Unique test removed 2 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 118 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 166 place count 118 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 168 place count 116 transition count 148
Applied a total of 168 rules in 13 ms. Remains 116 /199 variables (removed 83) and now considering 148/236 (removed 88) transitions.
// Phase 1: matrix 148 rows 116 cols
[2025-06-01 22:09:17] [INFO ] Computed 48 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:17] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-01 22:09:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 22:09:17] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:09:17] [INFO ] Redundant transitions in 59 ms returned [23, 30, 31, 44, 45, 56, 57, 58, 59, 60, 67, 68, 73, 84, 99, 100, 102, 106, 109, 112, 118, 119, 120, 122, 126, 129, 130, 131, 132, 135, 138, 139, 140, 141, 147]
Found 35 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 35 transitions
Redundant transitions reduction (with SMT) removed 35 transitions.
Running 88 sub problems to find dead transitions.
// Phase 1: matrix 113 rows 116 cols
[2025-06-01 22:09:17] [INFO ] Computed 48 invariants in 0 ms
[2025-06-01 22:09:17] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 13/116 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/228 variables, 116/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/229 variables, and 173 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 13/116 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/228 variables, 116/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 88/261 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/229 variables, and 261 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2358 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4073ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 4074ms
Starting structural reductions in SI_LTL mode, iteration 1 : 116/199 places, 113/236 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 116 transition count 100
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 90 transition count 100
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 90 transition count 95
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 46 edges and 80 vertex of which 16 / 80 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 72 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 72 transition count 82
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 92 place count 56 transition count 74
Graph (trivial) has 38 edges and 56 vertex of which 16 / 56 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 48 transition count 74
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 101 place count 48 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 117 place count 48 transition count 50
Applied a total of 117 rules in 12 ms. Remains 48 /116 variables (removed 68) and now considering 50/113 (removed 63) transitions.
// Phase 1: matrix 50 rows 48 cols
[2025-06-01 22:09:21] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:21] [INFO ] Implicit Places using invariants in 35 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/199 places, 50/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4356 ms. Remains : 47/199 places, 50/236 transitions.
Stuttering acceptance computed with spot in 84 ms :[p0, true, p0]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-14 finished in 4458 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' '!(G(F(p0)))'
Support contains 1 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 236/236 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 197 transition count 170
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 154 place count 123 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 158 place count 119 transition count 151
Ensure Unique test removed 2 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 164 place count 117 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 168 place count 117 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 170 place count 115 transition count 147
Applied a total of 170 rules in 14 ms. Remains 115 /199 variables (removed 84) and now considering 147/236 (removed 89) transitions.
// Phase 1: matrix 147 rows 115 cols
[2025-06-01 22:09:21] [INFO ] Computed 48 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:22] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-01 22:09:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:22] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 22:09:22] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:09:22] [INFO ] Redundant transitions in 68 ms returned [23, 30, 31, 44, 47, 58, 59, 60, 61, 62, 69, 70, 73, 84, 99, 100, 102, 106, 109, 110, 111, 117, 118, 119, 121, 125, 128, 129, 130, 131, 134, 137, 138, 139, 140, 146]
Found 36 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 36 transitions
Redundant transitions reduction (with SMT) removed 36 transitions.
Running 86 sub problems to find dead transitions.
// Phase 1: matrix 111 rows 115 cols
[2025-06-01 22:09:22] [INFO ] Computed 48 invariants in 0 ms
[2025-06-01 22:09:22] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 13/115 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 110/225 variables, 115/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 86 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/226 variables, and 172 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1629 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 13/115 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 110/225 variables, 115/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 86/258 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/226 variables, and 258 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2275 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3910ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3910ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/199 places, 111/236 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 115 transition count 98
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 89 transition count 98
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 89 transition count 93
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 46 edges and 79 vertex of which 16 / 79 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 71 transition count 88
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 71 transition count 80
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 95 place count 53 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 52 transition count 70
Graph (trivial) has 37 edges and 52 vertex of which 16 / 52 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 44 transition count 70
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 106 place count 44 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 123 place count 44 transition count 45
Applied a total of 123 rules in 11 ms. Remains 44 /115 variables (removed 71) and now considering 45/111 (removed 66) transitions.
// Phase 1: matrix 45 rows 44 cols
[2025-06-01 22:09:26] [INFO ] Computed 21 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:26] [INFO ] Implicit Places using invariants in 30 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/199 places, 45/236 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 45
Applied a total of 1 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 43 cols
[2025-06-01 22:09:26] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:26] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-01 22:09:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 22:09:26] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 43/199 places, 45/236 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4272 ms. Remains : 43/199 places, 45/236 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-15 finished in 4368 ms.
All properties solved by simple procedures.
Total runtime 203301 ms.
BK_STOP 1748815766403
--------------------
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="NoC3x3-PT-2A"
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 NoC3x3-PT-2A, 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 r142-tall-174876812100171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-2A.tgz
mv NoC3x3-PT-2A 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 ;