About the Execution of ITS-Tools for UtilityControlRoom-PT-Z4T3N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFTFTFFTFTTFFFF? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590600859.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 UtilityControlRoom-PT-Z4T3N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590600859
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 35K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 171K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 119K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 468K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 30K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 56K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 162K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 34K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 254K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 905K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 319K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749278631583
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T3N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 06:43:53] [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-07 06:43:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 06:43:53] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2025-06-07 06:43:53] [INFO ] Transformed 376 places.
[2025-06-07 06:43:53] [INFO ] Transformed 750 transitions.
[2025-06-07 06:43:53] [INFO ] Parsed PT model containing 376 places and 750 transitions and 2410 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 279 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Applied a total of 0 rules in 15 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2025-06-07 06:43:53] [INFO ] Computed 23 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:43:53] [INFO ] Implicit Places using invariants in 290 ms returned []
[2025-06-07 06:43:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:43:54] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2025-06-07 06:43:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/376 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/966 variables, 376/399 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 966/966 variables, and 399 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/376 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/966 variables, 376/399 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/966 variables, 580/979 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 966/966 variables, and 979 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60607ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60622ms
Finished structural reductions in LTL mode , in 1 iterations and 61278 ms. Remains : 376/376 places, 590/590 transitions.
Support contains 279 out of 376 places after structural reductions.
[2025-06-07 06:44:55] [INFO ] Flatten gal took : 70 ms
[2025-06-07 06:44:55] [INFO ] Flatten gal took : 35 ms
[2025-06-07 06:44:55] [INFO ] Input system was already deterministic with 590 transitions.
RANDOM walk for 40000 steps (8 resets) in 2030 ms. (19 steps per ms) remains 4/31 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
[2025-06-07 06:44:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp30 is UNSAT
After SMT solving in domain Real declared 323/966 variables, and 8 constraints, problems are : Problem set: 4 solved, 0 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 8/23 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 201 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 366 transition count 580
Applied a total of 20 rules in 41 ms. Remains 366 /376 variables (removed 10) and now considering 580/590 (removed 10) transitions.
// Phase 1: matrix 580 rows 366 cols
[2025-06-07 06:44:56] [INFO ] Computed 23 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:44:57] [INFO ] Implicit Places using invariants in 579 ms returned [295]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 582 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 365/376 places, 580/590 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 325 transition count 540
Applied a total of 80 rules in 32 ms. Remains 325 /365 variables (removed 40) and now considering 540/580 (removed 40) transitions.
// Phase 1: matrix 540 rows 325 cols
[2025-06-07 06:44:57] [INFO ] Computed 22 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:44:57] [INFO ] Implicit Places using invariants in 401 ms returned []
[2025-06-07 06:44:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:44:58] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 325/376 places, 540/590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1586 ms. Remains : 325/376 places, 540/590 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 1040 ms.
Stack based approach found an accepted trace after 35347 steps with 21 reset with depth 35165 and stack size 35164 in 355 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-01 finished in 3328 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(X(X(G(p0)))))||G((p1&&X(G(p2))))))'
Support contains 90 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 18 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2025-06-07 06:45:00] [INFO ] Computed 23 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:45:00] [INFO ] Implicit Places using invariants in 90 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 405 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-03 finished in 553 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 14 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 376 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 216 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 216 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 176 transition count 350
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 480 place count 156 transition count 330
Applied a total of 480 rules in 45 ms. Remains 156 /376 variables (removed 220) and now considering 330/590 (removed 260) transitions.
// Phase 1: matrix 330 rows 156 cols
[2025-06-07 06:45:00] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:45:00] [INFO ] Implicit Places using invariants in 133 ms returned [95]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/376 places, 330/590 transitions.
Applied a total of 0 rules in 12 ms. Remains 155 /155 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 155/376 places, 330/590 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 471 ms.
Stack based approach found an accepted trace after 23565 steps with 0 reset with depth 23566 and stack size 23566 in 123 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-05 finished in 835 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(X(p0)))&&(F(p1) U X(p2))))'
Support contains 54 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 9 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2025-06-07 06:45:01] [INFO ] Computed 23 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:45:01] [INFO ] Implicit Places using invariants in 181 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 182 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 195 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-06 finished in 530 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||X(X(F(p1))))))'
Support contains 21 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 8 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2025-06-07 06:45:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:45:02] [INFO ] Implicit Places using invariants in 281 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 282 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 293 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 261 ms.
Product exploration explored 100000 steps with 50000 reset in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-07 finished in 968 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&&G((F(p1) U p2))&&X(p0)))))'
Support contains 6 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 12 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2025-06-07 06:45:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:45:03] [INFO ] Implicit Places using invariants in 347 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 356 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-08
Product exploration explored 100000 steps with 1675 reset in 324 ms.
Product exploration explored 100000 steps with 1673 reset in 331 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 375 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1951 steps (0 resets) in 44 ms. (43 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR p2 p1) (OR p0 p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 11 factoid took 797 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
// Phase 1: matrix 470 rows 255 cols
[2025-06-07 06:45:06] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:45:07] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-06-07 06:45:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:45:07] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 06:45:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 1.0)
(t4 1.0)
(t5 1.0)
(t6 1.0)
(t7 1.0)
(t8 1.0)
(t9 1.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 0.0)
(t154 0.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 0.0)
(t160 0.0)
(t161 0.0)
(t162 0.0)
(t163 0.0)
(t164 0.0)
(t165 0.0)
(t166 0.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 1.0)
(t174 0.0)
(t175 0.0)
(t176 0.0)
(t177 1.0)
(t178 0.0)
(t179 0.0)
(t180 0.0)
(t181 1.0)
(t182 0.0)
(t183 0.0)
(t184 0.0)
(t185 1.0)
(t186 0.0)
(t187 0.0)
(t188 0.0)
(t189 1.0)
(t190 0.0)
(t191 0.0)
(t192 0.0)
(t193 1.0)
(t194 0.0)
(t195 0.0)
(t196 0.0)
(t197 1.0)
(t198 0.0)
(t199 0.0)
(t200 0.0)
(t201 1.0)
(t202 0.0)
(t203 0.0)
(t204 0.0)
(t205 1.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 1.0)
(t210 0.0)
(t211 0.0)
(t212 0.0)
(t213 0.0)
(t214 0.0)
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 0.0)
(t221 0.0)
(t222 0.0)
(t223 0.0)
(t224 0.0)
(t225 0.0)
(t226 0.0)
(t227 0.0)
(t228 0.0)
(t229 0.0)
(t230 0.0)
(t231 0.0)
(t232 0.0)
(t233 0.0)
(t234 0.0)
(t235 0.0)
(t236 0.0)
(t237 0.0)
(t238 0.0)
(t239 0.0)
(t240 0.0)
(t241 0.0)
(t242 0.0)
(t243 0.0)
(t244 0.0)
(t245 0.0)
(t246 0.0)
(t247 0.0)
(t248 0.0)
(t249 0.0)
(t250 0.0)
(t251 0.0)
(t252 0.0)
(t253 0.0)
(t254 0.0)
(t255 0.0)
(t256 0.0)
(t257 0.0)
(t258 0.0)
(t259 0.0)
(t260 0.0)
(t261 0.0)
(t262 0.0)
(t263 0.0)
(t264 0.0)
(t265 0.0)
(t266 0.0)
(t267 0.0)
(t268 0.0)
(t269 0.0)
(t270 0.0)
(t271 0.0)
(t272 0.0)
(t273 0.0)
(t274 0.0)
(t275 0.0)
(t276 0.0)
(t277 0.0)
(t278 0.0)
(t279 0.0)
(t280 0.0)
(t281 0.0)
(t282 0.0)
(t283 0.0)
(t284 0.0)
(t285 0.0)
(t286 0.0)
(t287 0.0)
(t288 0.0)
(t289 0.0)
(t290 0.0)
(t291 0.0)
(t292 0.0)
(t293 0.0)
(t294 0.0)
(t295 0.0)
(t296 0.0)
(t297 0.0)
(t298 0.0)
(t299 0.0)
(t300 0.0)
(t301 0.0)
(t302 0.0)
(t303 0.0)
(t304 0.0)
(t305 0.0)
(t306 0.0)
(t307 0.0)
(t308 0.0)
(t309 0.0)
(t310 0.0)
(t311 0.0)
(t312 0.0)
(t313 0.0)
(t314 0.0)
(t315 0.0)
(t316 0.0)
(t317 0.0)
(t318 0.0)
(t319 0.0)
(t320 0.0)
(t321 0.0)
(t322 0.0)
(t323 0.0)
(t324 0.0)
(t325 0.0)
(t326 0.0)
(t327 0.0)
(t328 0.0)
(t329 0.0)
(t330 0.0)
(t331 0.0)
(t332 0.0)
(t333 0.0)
(t334 0.0)
(t335 0.0)
(t336 0.0)
(t337 0.0)
(t338 0.0)
(t339 0.0)
(t340 0.0)
(t341 0.0)
(t342 0.0)
(t343 0.0)
(t344 0.0)
(t345 0.0)
(t346 0.0)
(t347 0.0)
(t348 0.0)
(t349 0.0)
(t350 0.0)
(t351 0.0)
(t352 0.0)
(t353 0.0)
(t354 0.0)
(t355 0.0)
(t356 0.0)
(t357 0.0)
(t358 0.0)
(t359 0.0)
(t360 0.0)
(t361 0.0)
(t362 0.0)
(t363 0.0)
(t364 0.0)
(t365 0.0)
(t366 0.0)
(t367 0.0)
(t368 0.0)
(t369 0.0)
(t370 0.0)
(t371 0.0)
(t372 0.0)
(t373 0.0)
(t374 0.0)
(t375 0.0)
(t376 0.0)
(t377 0.0)
(t378 0.0)
(t379 0.0)
(t380 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60357ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60362ms
Finished structural reductions in LTL mode , in 1 iterations and 60942 ms. Remains : 255/255 places, 470/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p2), (X p0), (X (NOT (AND (NOT p2) p0))), (X p1), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p2)), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 376 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1142 steps (0 resets) in 31 ms. (35 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p2), (X p0), (X (NOT (AND (NOT p2) p0))), (X p1), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p2)), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR p2 p1) (OR p0 p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 11 factoid took 779 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1738 reset in 334 ms.
Product exploration explored 100000 steps with 1609 reset in 339 ms.
Built C files in :
/tmp/ltsmin8038753663701259595
[2025-06-07 06:46:11] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8038753663701259595
Running compilation step : cd /tmp/ltsmin8038753663701259595;'/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 910 ms.
Running link step : cd /tmp/ltsmin8038753663701259595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin8038753663701259595;'/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/stateBased2301510893352609689.hoa' '--buchi-type=spotba'
LTSmin run took 295 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-08 finished in 69740 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||X(F(p1)))))'
Support contains 4 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 12 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2025-06-07 06:46:12] [INFO ] Computed 23 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:46:13] [INFO ] Implicit Places using invariants in 373 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 375 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 392 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-10 finished in 957 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)||X(G(p1))) U G(p2))))'
Support contains 5 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 119 place count 257 transition count 471
Iterating global reduction 0 with 119 rules applied. Total rules applied 238 place count 257 transition count 471
Applied a total of 238 rules in 9 ms. Remains 257 /376 variables (removed 119) and now considering 471/590 (removed 119) transitions.
// Phase 1: matrix 471 rows 257 cols
[2025-06-07 06:46:13] [INFO ] Computed 23 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:46:14] [INFO ] Implicit Places using invariants in 303 ms returned []
[2025-06-07 06:46:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:46:14] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2025-06-07 06:46:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/257 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/728 variables, 257/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/728 variables, and 280 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/257 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/728 variables, 257/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 461/741 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/728 variables, and 741 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60315ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60317ms
Starting structural reductions in LTL mode, iteration 1 : 257/376 places, 471/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60910 ms. Remains : 257/376 places, 471/590 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-13
Product exploration explored 100000 steps with 14008 reset in 320 ms.
Product exploration explored 100000 steps with 16109 reset in 422 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge based reduction with 9 factoid took 473 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 325 ms. (122 steps per ms) remains 1/10 properties
BEST_FIRST walk for 1888 steps (0 resets) in 13 ms. (134 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F p0), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 (NOT p2) p0))), (F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p1), (F (NOT (OR (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 823 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 244 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
[2025-06-07 06:47:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:47:18] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2025-06-07 06:47:18] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2025-06-07 06:47:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:47:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 43 ms returned sat
[2025-06-07 06:47:18] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2025-06-07 06:47:19] [INFO ] Computed and/alt/rep : 421/691/421 causal constraints (skipped 40 transitions) in 26 ms.
[2025-06-07 06:47:19] [INFO ] Added : 113 causal constraints over 23 iterations in 718 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 471/471 transitions.
Applied a total of 0 rules in 2 ms. Remains 257 /257 variables (removed 0) and now considering 471/471 (removed 0) transitions.
[2025-06-07 06:47:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:47:19] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-07 06:47:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:47:20] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2025-06-07 06:47:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/257 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/728 variables, 257/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/728 variables, and 280 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/257 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/728 variables, 257/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 461/741 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/728 variables, and 741 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60339ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60341ms
Finished structural reductions in LTL mode , in 1 iterations and 60817 ms. Remains : 257/257 places, 471/471 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge based reduction with 9 factoid took 490 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 220 ms. (180 steps per ms) remains 1/10 properties
BEST_FIRST walk for 1494 steps (0 resets) in 6 ms. (213 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) p0 p1))), (F p2), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) p0))), (F p0), (F p1)]
Knowledge based reduction with 9 factoid took 837 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
[2025-06-07 06:48:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:48:22] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2025-06-07 06:48:23] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2025-06-07 06:48:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:48:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 44 ms returned sat
[2025-06-07 06:48:23] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2025-06-07 06:48:23] [INFO ] Computed and/alt/rep : 421/691/421 causal constraints (skipped 40 transitions) in 27 ms.
[2025-06-07 06:48:24] [INFO ] Added : 113 causal constraints over 23 iterations in 625 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 14637 reset in 296 ms.
Product exploration explored 100000 steps with 13824 reset in 327 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Support contains 5 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 471/471 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 257 transition count 511
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 257 transition count 511
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 0 with 59 rules applied. Total rules applied 99 place count 257 transition count 538
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 139 place count 257 transition count 498
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 255 transition count 418
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 255 transition count 418
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 162 place count 236 transition count 399
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 181 place count 236 transition count 399
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 219 place count 198 transition count 323
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 257 place count 198 transition count 323
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 293 place count 162 transition count 270
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 329 place count 162 transition count 270
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 362 place count 162 transition count 237
Deduced a syphon composed of 61 places in 0 ms
Applied a total of 362 rules in 35 ms. Remains 162 /257 variables (removed 95) and now considering 237/471 (removed 234) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:48:25] [INFO ] Redundant transitions in 8 ms returned []
Running 216 sub problems to find dead transitions.
// Phase 1: matrix 237 rows 162 cols
[2025-06-07 06:48:25] [INFO ] Computed 23 invariants in 3 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:48:26] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 10/162 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:48:28] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:48:28] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:48:28] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:48:28] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:48:28] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:48:28] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:48:29] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:48:29] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:48:29] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:48:29] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 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 TDEAD56 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 10/34 constraints. Problems are: Problem set: 93 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/34 constraints. Problems are: Problem set: 93 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 237/399 variables, 162/196 constraints. Problems are: Problem set: 93 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/196 constraints. Problems are: Problem set: 93 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/399 variables, 0/196 constraints. Problems are: Problem set: 93 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 196 constraints, problems are : Problem set: 93 solved, 123 unsolved in 7737 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 93 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 93 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 93 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 71/162 variables, 23/24 constraints. Problems are: Problem set: 93 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 10/34 constraints. Problems are: Problem set: 93 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/34 constraints. Problems are: Problem set: 93 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 237/399 variables, 162/196 constraints. Problems are: Problem set: 93 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 123/319 constraints. Problems are: Problem set: 93 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/319 constraints. Problems are: Problem set: 93 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/399 variables, 0/319 constraints. Problems are: Problem set: 93 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 319 constraints, problems are : Problem set: 93 solved, 123 unsolved in 9363 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 123/216 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17143ms problems are : Problem set: 93 solved, 123 unsolved
Search for dead transitions found 93 dead transitions in 17144ms
Found 93 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 93 transitions
Dead transitions reduction (with SMT) removed 93 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 162/257 places, 144/471 transitions.
Graph (complete) has 283 edges and 162 vertex of which 101 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.1 ms
Discarding 61 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 101 /162 variables (removed 61) and now considering 144/144 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/257 places, 144/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17206 ms. Remains : 101/257 places, 144/471 transitions.
Built C files in :
/tmp/ltsmin10461955184144733917
[2025-06-07 06:48:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10461955184144733917
Running compilation step : cd /tmp/ltsmin10461955184144733917;'/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 735 ms.
Running link step : cd /tmp/ltsmin10461955184144733917;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10461955184144733917;'/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/stateBased4617720939693164594.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 471/471 transitions.
Applied a total of 0 rules in 8 ms. Remains 257 /257 variables (removed 0) and now considering 471/471 (removed 0) transitions.
// Phase 1: matrix 471 rows 257 cols
[2025-06-07 06:48:58] [INFO ] Computed 23 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:48:58] [INFO ] Implicit Places using invariants in 475 ms returned []
[2025-06-07 06:48:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:48:58] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2025-06-07 06:48:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/257 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/728 variables, 257/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/728 variables, and 280 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 10/257 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 471/728 variables, 257/280 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 461/741 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/728 variables, and 741 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Finished structural reductions in LTL mode , in 1 iterations and 61077 ms. Remains : 257/257 places, 471/471 transitions.
Built C files in :
/tmp/ltsmin357814510927326117
[2025-06-07 06:49:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin357814510927326117
Running compilation step : cd /tmp/ltsmin357814510927326117;'/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 733 ms.
Running link step : cd /tmp/ltsmin357814510927326117;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin357814510927326117;'/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/stateBased15391342496900495319.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 06:50:14] [INFO ] Flatten gal took : 26 ms
[2025-06-07 06:50:14] [INFO ] Flatten gal took : 23 ms
[2025-06-07 06:50:14] [INFO ] Time to serialize gal into /tmp/LTL16477721966141883420.gal : 6 ms
[2025-06-07 06:50:14] [INFO ] Time to serialize properties into /tmp/LTL7449627843171035713.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16477721966141883420.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4268546254175788597.hoa' '-atoms' '/tmp/LTL7449627843171035713.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/LTL7449627843171035713.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4268546254175788597.hoa
Detected timeout of ITS tools.
[2025-06-07 06:50:29] [INFO ] Flatten gal took : 33 ms
[2025-06-07 06:50:29] [INFO ] Flatten gal took : 22 ms
[2025-06-07 06:50:29] [INFO ] Time to serialize gal into /tmp/LTL2504519417706720711.gal : 4 ms
[2025-06-07 06:50:29] [INFO ] Time to serialize properties into /tmp/LTL11677737352788513300.ltl : 12 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/LTL2504519417706720711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11677737352788513300.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(((F("(DoSecuring_4_0>MovetoZ_0_1_0)"))||(X(G("(IdleTechs_1>=2)"))))U(G("(NumClientsReq>OpenRequests_8_3)")))))
Formula 0 simplified : X((G!"(DoSecuring_4_0>MovetoZ_0_1_0)" & XF!"(IdleTechs_1>=2)") R F!"(NumClientsReq>OpenRequests_8_3)")
Detected timeout of ITS tools.
[2025-06-07 06:50:44] [INFO ] Flatten gal took : 20 ms
[2025-06-07 06:50:44] [INFO ] Applying decomposition
[2025-06-07 06:50:44] [INFO ] Flatten gal took : 17 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/graph16896704724637260777.txt' '-o' '/tmp/graph16896704724637260777.bin' '-w' '/tmp/graph16896704724637260777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16896704724637260777.bin' '-l' '-1' '-v' '-w' '/tmp/graph16896704724637260777.weights' '-q' '0' '-e' '0.001'
[2025-06-07 06:50:44] [INFO ] Decomposing Gal with order
[2025-06-07 06:50:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 06:50:45] [INFO ] Removed a total of 745 redundant transitions.
[2025-06-07 06:50:45] [INFO ] Flatten gal took : 83 ms
[2025-06-07 06:50:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 18 ms.
[2025-06-07 06:50:45] [INFO ] Time to serialize gal into /tmp/LTL8568857351125801968.gal : 5 ms
[2025-06-07 06:50:45] [INFO ] Time to serialize properties into /tmp/LTL8976218238033811058.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8568857351125801968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8976218238033811058.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(((F("(gu86.DoSecuring_4_0>gu86.MovetoZ_0_1_0)"))||(X(G("(gi1.gi0.gu4.IdleTechs_1>=2)"))))U(G("(gu21.NumClientsReq>gu21.OpenReques...168
Formula 0 simplified : X((G!"(gu86.DoSecuring_4_0>gu86.MovetoZ_0_1_0)" & XF!"(gi1.gi0.gu4.IdleTechs_1>=2)") R F!"(gu21.NumClientsReq>gu21.OpenRequests_8_3)...157
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-13 finished in 286474 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(((X(p1) U ((p2&&X(p1))||X(G(p1))))||p0))))'
Support contains 4 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 7 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2025-06-07 06:51:00] [INFO ] Computed 23 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:00] [INFO ] Implicit Places using invariants in 399 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 402 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 5 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 414 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-14
Product exploration explored 100000 steps with 212 reset in 338 ms.
Product exploration explored 100000 steps with 223 reset in 356 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 13 factoid took 288 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 239 ms. (166 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
// Phase 1: matrix 470 rows 255 cols
[2025-06-07 06:51:02] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 4/725 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/255 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (G (OR p2 p0)), (G (OR p2 p0 p1)), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p2) p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 437 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 255 transition count 430
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 215 transition count 430
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 276 place count 117 transition count 332
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 316 place count 117 transition count 292
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 319 place count 114 transition count 172
Ensure Unique test removed 1 places
Iterating global reduction 1 with 4 rules applied. Total rules applied 323 place count 113 transition count 172
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 351 place count 85 transition count 116
Iterating global reduction 1 with 28 rules applied. Total rules applied 379 place count 85 transition count 116
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 407 place count 57 transition count 88
Iterating global reduction 1 with 28 rules applied. Total rules applied 435 place count 57 transition count 88
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 463 place count 57 transition count 60
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 475 place count 51 transition count 54
Applied a total of 475 rules in 22 ms. Remains 51 /255 variables (removed 204) and now considering 54/470 (removed 416) transitions.
// Phase 1: matrix 54 rows 51 cols
[2025-06-07 06:51:02] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:02] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-07 06:51:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:02] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:51:02] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2025-06-07 06:51:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 10/51 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 54/105 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 72 constraints, problems are : Problem set: 0 solved, 36 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 10/51 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 54/105 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 36/108 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 108 constraints, problems are : Problem set: 0 solved, 36 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1193ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1194ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/255 places, 54/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1318 ms. Remains : 51/255 places, 54/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3475 steps (0 resets) in 23 ms. (144 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 111 reset in 220 ms.
Stack based approach found an accepted trace after 59268 steps with 65 reset with depth 1218 and stack size 1193 in 134 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-14 finished in 4794 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||X(X(p1))))))'
Support contains 3 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 10 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2025-06-07 06:51:05] [INFO ] Computed 23 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:05] [INFO ] Implicit Places using invariants in 375 ms returned []
[2025-06-07 06:51:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:05] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 06:51:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 279 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 460/739 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 739 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60323ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60325ms
Starting structural reductions in LTL mode, iteration 1 : 256/376 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61045 ms. Remains : 256/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-15
Product exploration explored 100000 steps with 20001 reset in 266 ms.
Product exploration explored 100000 steps with 20020 reset in 269 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 9 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2025-06-07 06:52:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:07] [INFO ] Implicit Places using invariants in 364 ms returned []
[2025-06-07 06:52:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:08] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 06:52:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 279 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 460/739 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 739 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60306ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
Finished structural reductions in LTL mode , in 1 iterations and 61015 ms. Remains : 256/256 places, 470/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20035 reset in 266 ms.
Product exploration explored 100000 steps with 19995 reset in 275 ms.
Built C files in :
/tmp/ltsmin4231670381422353990
[2025-06-07 06:53:09] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4231670381422353990
Running compilation step : cd /tmp/ltsmin4231670381422353990;'/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 714 ms.
Running link step : cd /tmp/ltsmin4231670381422353990;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4231670381422353990;'/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/stateBased5878391426545432740.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2025-06-07 06:53:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:53:25] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-06-07 06:53:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:53:25] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 06:53:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 279 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/256 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/726 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 460/739 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 739 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60312ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Finished structural reductions in LTL mode , in 1 iterations and 60972 ms. Remains : 256/256 places, 470/470 transitions.
Built C files in :
/tmp/ltsmin6746462681042885702
[2025-06-07 06:54:25] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6746462681042885702
Running compilation step : cd /tmp/ltsmin6746462681042885702;'/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 722 ms.
Running link step : cd /tmp/ltsmin6746462681042885702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6746462681042885702;'/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/stateBased1079467854745991525.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 06:54:41] [INFO ] Flatten gal took : 22 ms
[2025-06-07 06:54:41] [INFO ] Flatten gal took : 19 ms
[2025-06-07 06:54:41] [INFO ] Time to serialize gal into /tmp/LTL15267984503071596816.gal : 4 ms
[2025-06-07 06:54:41] [INFO ] Time to serialize properties into /tmp/LTL6447808936813590228.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15267984503071596816.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3221520571256783467.hoa' '-atoms' '/tmp/LTL6447808936813590228.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/LTL6447808936813590228.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3221520571256783467.hoa
Detected timeout of ITS tools.
[2025-06-07 06:54:56] [INFO ] Flatten gal took : 25 ms
[2025-06-07 06:54:56] [INFO ] Flatten gal took : 15 ms
[2025-06-07 06:54:56] [INFO ] Time to serialize gal into /tmp/LTL1459865858853788425.gal : 3 ms
[2025-06-07 06:54:56] [INFO ] Time to serialize properties into /tmp/LTL10697125165035841498.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/LTL1459865858853788425.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10697125165035841498.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(NumClientsReq<=Finished_6)")||(X(X("(NumClientsReq>StartSecuring_1_0)")))))))
Formula 0 simplified : GF(!"(NumClientsReq<=Finished_6)" & XX!"(NumClientsReq>StartSecuring_1_0)")
Detected timeout of ITS tools.
[2025-06-07 06:55:11] [INFO ] Flatten gal took : 15 ms
[2025-06-07 06:55:11] [INFO ] Applying decomposition
[2025-06-07 06:55:11] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3584260764723213776.txt' '-o' '/tmp/graph3584260764723213776.bin' '-w' '/tmp/graph3584260764723213776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3584260764723213776.bin' '-l' '-1' '-v' '-w' '/tmp/graph3584260764723213776.weights' '-q' '0' '-e' '0.001'
[2025-06-07 06:55:11] [INFO ] Decomposing Gal with order
[2025-06-07 06:55:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 06:55:11] [INFO ] Removed a total of 735 redundant transitions.
[2025-06-07 06:55:11] [INFO ] Flatten gal took : 28 ms
[2025-06-07 06:55:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 11 ms.
[2025-06-07 06:55:11] [INFO ] Time to serialize gal into /tmp/LTL14936618811908799236.gal : 3 ms
[2025-06-07 06:55:11] [INFO ] Time to serialize properties into /tmp/LTL8549819565015131714.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14936618811908799236.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8549819565015131714.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu62.NumClientsReq<=gu62.Finished_6)")||(X(X("(gu62.NumClientsReq>gu62.StartSecuring_1_0)")))))))
Formula 0 simplified : GF(!"(gu62.NumClientsReq<=gu62.Finished_6)" & XX!"(gu62.NumClientsReq>gu62.StartSecuring_1_0)")
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-15 finished in 261491 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)||X(G(p1))) U G(p2))))'
Found a Lengthening insensitive property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-13
Stuttering acceptance computed with spot in 296 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Support contains 5 out of 376 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 376 transition count 473
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 1 with 188 rules applied. Total rules applied 305 place count 259 transition count 402
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 358 place count 217 transition count 391
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 358 place count 217 transition count 351
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 438 place count 177 transition count 351
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 440 place count 175 transition count 271
Iterating global reduction 3 with 2 rules applied. Total rules applied 442 place count 175 transition count 271
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 461 place count 156 transition count 252
Iterating global reduction 3 with 19 rules applied. Total rules applied 480 place count 156 transition count 252
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 499 place count 137 transition count 214
Iterating global reduction 3 with 19 rules applied. Total rules applied 518 place count 137 transition count 214
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 535 place count 120 transition count 180
Iterating global reduction 3 with 17 rules applied. Total rules applied 552 place count 120 transition count 180
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 569 place count 120 transition count 163
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 607 place count 101 transition count 144
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 609 place count 101 transition count 144
Applied a total of 609 rules in 30 ms. Remains 101 /376 variables (removed 275) and now considering 144/590 (removed 446) transitions.
// Phase 1: matrix 144 rows 101 cols
[2025-06-07 06:55:26] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:55:27] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-07 06:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:55:27] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-07 06:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 144/245 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/245 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 124 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3647 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 144/245 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 121/245 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 245 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5614 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9301ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 9302ms
Starting structural reductions in LI_LTL mode, iteration 1 : 101/376 places, 144/590 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9506 ms. Remains : 101/376 places, 144/590 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-13
Product exploration explored 100000 steps with 19003 reset in 271 ms.
Stack based approach found an accepted trace after 1219 steps with 188 reset with depth 122 and stack size 122 in 4 ms.
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-13 finished in 10209 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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||X(X(p1))))))'
[2025-06-07 06:55:36] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10813599766779947472
[2025-06-07 06:55:36] [INFO ] Applying decomposition
[2025-06-07 06:55:36] [INFO ] Computing symmetric may disable matrix : 590 transitions.
[2025-06-07 06:55:36] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:55:36] [INFO ] Flatten gal took : 21 ms
[2025-06-07 06:55:36] [INFO ] Computing symmetric may enable matrix : 590 transitions.
[2025-06-07 06:55:36] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph16187370448636391209.txt' '-o' '/tmp/graph16187370448636391209.bin' '-w' '/tmp/graph16187370448636391209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16187370448636391209.bin' '-l' '-1' '-v' '-w' '/tmp/graph16187370448636391209.weights' '-q' '0' '-e' '0.001'
[2025-06-07 06:55:36] [INFO ] Decomposing Gal with order
[2025-06-07 06:55:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 06:55:36] [INFO ] Removed a total of 609 redundant transitions.
[2025-06-07 06:55:36] [INFO ] Computing Do-Not-Accords matrix : 590 transitions.
[2025-06-07 06:55:36] [INFO ] Flatten gal took : 31 ms
[2025-06-07 06:55:36] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:55:37] [INFO ] Built C files in 137ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10813599766779947472
Running compilation step : cd /tmp/ltsmin10813599766779947472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-07 06:55:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 13 ms.
[2025-06-07 06:55:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality15373634085251712237.gal : 4 ms
[2025-06-07 06:55:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality10567114826332982757.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/LTLCardinality15373634085251712237.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10567114826332982757.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...299
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu62.NumClientsReq<=gu62.Finished_6)")||(X(X("(gu62.NumClientsReq>gu62.StartSecuring_1_0)")))))))
Formula 0 simplified : GF(!"(gu62.NumClientsReq<=gu62.Finished_6)" & XX!"(gu62.NumClientsReq>gu62.StartSecuring_1_0)")
Compilation finished in 1437 ms.
Running link step : cd /tmp/ltsmin10813599766779947472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10813599766779947472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp3==true)||X(X((LTLAPp4==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.043: LTL layer: formula: <>([](((LTLAPp3==true)||X(X((LTLAPp4==true))))))
pins2lts-mc-linux64( 4/ 8), 0.043: "<>([](((LTLAPp3==true)||X(X((LTLAPp4==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.043: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.133: There are 596 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.133: State length is 377, there are 602 groups
pins2lts-mc-linux64( 0/ 8), 0.133: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.133: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.133: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.133: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.265: [Blue] ~120 levels ~960 states ~8920 transitions
pins2lts-mc-linux64( 2/ 8), 0.333: [Blue] ~240 levels ~1920 states ~13680 transitions
pins2lts-mc-linux64( 2/ 8), 0.489: [Blue] ~480 levels ~3840 states ~28824 transitions
pins2lts-mc-linux64( 2/ 8), 0.687: [Blue] ~960 levels ~7680 states ~64472 transitions
pins2lts-mc-linux64( 2/ 8), 1.026: [Blue] ~1920 levels ~15360 states ~128152 transitions
pins2lts-mc-linux64( 2/ 8), 1.543: [Blue] ~3840 levels ~30720 states ~264640 transitions
pins2lts-mc-linux64( 2/ 8), 2.333: [Blue] ~7675 levels ~61440 states ~516200 transitions
pins2lts-mc-linux64( 2/ 8), 3.517: [Blue] ~15344 levels ~122880 states ~1003640 transitions
pins2lts-mc-linux64( 0/ 8), 5.244: [Blue] ~30717 levels ~245760 states ~2690768 transitions
pins2lts-mc-linux64( 4/ 8), 9.005: [Blue] ~61406 levels ~491520 states ~4598296 transitions
pins2lts-mc-linux64( 4/ 8), 16.617: [Blue] ~122840 levels ~983040 states ~9143240 transitions
pins2lts-mc-linux64( 4/ 8), 31.385: [Blue] ~245712 levels ~1966080 states ~18111232 transitions
pins2lts-mc-linux64( 4/ 8), 60.423: [Blue] ~491386 levels ~3932160 states ~35981064 transitions
pins2lts-mc-linux64( 4/ 8), 120.831: [Blue] ~982671 levels ~7864320 states ~71943272 transitions
pins2lts-mc-linux64( 4/ 8), 124.975: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 125.156:
pins2lts-mc-linux64( 0/ 8), 125.156: Explored 7705332 states 80282692 transitions, fanout: 10.419
pins2lts-mc-linux64( 0/ 8), 125.156: Total exploration time 125.010 sec (124.830 sec minimum, 124.905 sec on average)
pins2lts-mc-linux64( 0/ 8), 125.156: States per second: 61638, Transitions per second: 642210
pins2lts-mc-linux64( 0/ 8), 125.156:
pins2lts-mc-linux64( 0/ 8), 125.156: State space has 66283335 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 125.156: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 125.156: blue states: 7705332 (11.62%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 125.156: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 125.156: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 125.156:
pins2lts-mc-linux64( 0/ 8), 125.156: Total memory used for local state coloring: 117.5MB
pins2lts-mc-linux64( 0/ 8), 125.156:
pins2lts-mc-linux64( 0/ 8), 125.156: Queue width: 8B, total height: 7701631, memory: 58.76MB
pins2lts-mc-linux64( 0/ 8), 125.156: Tree memory: 761.7MB, 12.0 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 125.156: Tree fill ratio (roots/leafs): 49.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 125.156: Stored 685 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 125.156: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 125.156: Est. total memory use: 820.5MB (~1082.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10813599766779947472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp3==true)||X(X((LTLAPp4==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10813599766779947472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp3==true)||X(X((LTLAPp4==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-07 07:19:34] [INFO ] Flatten gal took : 373 ms
[2025-06-07 07:19:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality17635052273444786432.gal : 85 ms
[2025-06-07 07:19:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality7631529750077103672.ltl : 28 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/LTLCardinality17635052273444786432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7631529750077103672.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...298
Read 1 LTL properties
Checking formula 0 : !((F(G(("(NumClientsReq<=Finished_6)")||(X(X("(NumClientsReq>StartSecuring_1_0)")))))))
Formula 0 simplified : GF(!"(NumClientsReq<=Finished_6)" & XX!"(NumClientsReq>StartSecuring_1_0)")
Detected timeout of ITS tools.
[2025-06-07 07:43:31] [INFO ] Flatten gal took : 462 ms
[2025-06-07 07:43:33] [INFO ] Input system was already deterministic with 590 transitions.
[2025-06-07 07:43:33] [INFO ] Transformed 376 places.
[2025-06-07 07:43:33] [INFO ] Transformed 590 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-07 07:43:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality8282906073087591871.gal : 11 ms
[2025-06-07 07:43:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality2234817125168164688.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/LTLCardinality8282906073087591871.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2234817125168164688.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("(NumClientsReq<=Finished_6)")||(X(X("(NumClientsReq>StartSecuring_1_0)")))))))
Formula 0 simplified : GF(!"(NumClientsReq<=Finished_6)" & XX!"(NumClientsReq>StartSecuring_1_0)")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z4T3N10"
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 UtilityControlRoom-PT-Z4T3N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r240-tall-174915590600859"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z4T3N10.tgz
mv UtilityControlRoom-PT-Z4T3N10 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 ;