About the Execution of ITS-Tools for PermAdmissibility-PT-20
| 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 | ?FFTFF?TFFFTTF?F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812800531.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 PermAdmissibility-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812800531
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 336K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 357K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 336K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748913943961
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-03 01:25:45] [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-03 01:25:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 01:25:45] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2025-06-03 01:25:45] [INFO ] Transformed 168 places.
[2025-06-03 01:25:45] [INFO ] Transformed 592 transitions.
[2025-06-03 01:25:45] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-PT-20-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 124 transition count 592
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 55 place count 113 transition count 416
Iterating global reduction 1 with 11 rules applied. Total rules applied 66 place count 113 transition count 416
Applied a total of 66 rules in 30 ms. Remains 113 /168 variables (removed 55) and now considering 416/592 (removed 176) transitions.
// Phase 1: matrix 416 rows 113 cols
[2025-06-03 01:25:45] [INFO ] Computed 18 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:25:45] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-06-03 01:25:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:25:45] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2025-06-03 01:25:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 17/109 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 416/525 variables, 109/127 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 4/529 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 8 (OVERLAPS) 0/529 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 131 constraints, problems are : Problem set: 0 solved, 412 unsolved in 22244 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 17/109 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 416/525 variables, 109/127 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 332/459 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/529 variables, and 459 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 109/113 constraints, PredecessorRefiner: 332/412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52799ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 52812ms
Starting structural reductions in LTL mode, iteration 1 : 113/168 places, 416/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53335 ms. Remains : 113/168 places, 416/592 transitions.
Support contains 80 out of 113 places after structural reductions.
[2025-06-03 01:26:38] [INFO ] Flatten gal took : 64 ms
[2025-06-03 01:26:39] [INFO ] Flatten gal took : 36 ms
[2025-06-03 01:26:39] [INFO ] Input system was already deterministic with 416 transitions.
RANDOM walk for 40049 steps (116 resets) in 438 ms. (91 steps per ms) remains 1/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 1/1 properties
[2025-06-03 01:26:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 68/529 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Generalized P Invariants (flows): 7/18 constraints, State Equation: 0/113 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 113 stabilizing places and 416 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 113 transition count 416
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(X(F(p1))))))))'
Support contains 10 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 416/416 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 101 transition count 416
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 21 place count 92 transition count 356
Iterating global reduction 1 with 9 rules applied. Total rules applied 30 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 44 place count 78 transition count 230
Iterating global reduction 1 with 14 rules applied. Total rules applied 58 place count 78 transition count 230
Applied a total of 58 rules in 19 ms. Remains 78 /113 variables (removed 35) and now considering 230/416 (removed 186) transitions.
// Phase 1: matrix 230 rows 78 cols
[2025-06-03 01:26:39] [INFO ] Computed 17 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:26:39] [INFO ] Implicit Places using invariants in 80 ms returned [0, 5, 33, 44]
[2025-06-03 01:26:39] [INFO ] Actually due to overlaps returned [5, 0, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 83 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/113 places, 230/416 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 75/113 places, 230/416 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-00
Product exploration explored 100000 steps with 964 reset in 831 ms.
Product exploration explored 100000 steps with 981 reset in 672 ms.
Computed a total of 75 stabilizing places and 230 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 230
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 144 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 1096 steps (0 resets) in 8 ms. (121 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 10 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 75 cols
[2025-06-03 01:26:42] [INFO ] Computed 14 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:26:42] [INFO ] Implicit Places using invariants in 83 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 74/75 places, 230/230 transitions.
Computed a total of 74 stabilizing places and 230 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 74 transition count 230
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 130 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 1095 steps (0 resets) in 6 ms. (156 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 992 reset in 633 ms.
Product exploration explored 100000 steps with 1006 reset in 636 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 10 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 230/230 transitions.
Applied a total of 0 rules in 19 ms. Remains 74 /74 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:26:45] [INFO ] Redundant transitions in 8 ms returned []
Running 226 sub problems to find dead transitions.
// Phase 1: matrix 230 rows 74 cols
[2025-06-03 01:26:45] [INFO ] Computed 13 invariants in 7 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 9/74 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 226 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 230/304 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 87 constraints, problems are : Problem set: 0 solved, 226 unsolved in 3030 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 9/74 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 230/304 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 226/313 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 313 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33221ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 33222ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33255 ms. Remains : 74/74 places, 230/230 transitions.
Built C files in :
/tmp/ltsmin4623233532993705786
[2025-06-03 01:27:19] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4623233532993705786
Running compilation step : cd /tmp/ltsmin4623233532993705786;'/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 501 ms.
Running link step : cd /tmp/ltsmin4623233532993705786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4623233532993705786;'/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/stateBased10540876038681030232.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 74 /74 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-03 01:27:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:27:34] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-03 01:27:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:27:34] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2025-06-03 01:27:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 9/74 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 226 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 230/304 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 87 constraints, problems are : Problem set: 0 solved, 226 unsolved in 5396 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 9/74 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 230/304 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 226/313 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 313 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35534ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 35535ms
Finished structural reductions in LTL mode , in 1 iterations and 35723 ms. Remains : 74/74 places, 230/230 transitions.
Built C files in :
/tmp/ltsmin8772948318429060819
[2025-06-03 01:28:09] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8772948318429060819
Running compilation step : cd /tmp/ltsmin8772948318429060819;'/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 372 ms.
Running link step : cd /tmp/ltsmin8772948318429060819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8772948318429060819;'/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/stateBased12440786051174935604.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 01:28:25] [INFO ] Flatten gal took : 18 ms
[2025-06-03 01:28:25] [INFO ] Flatten gal took : 17 ms
[2025-06-03 01:28:25] [INFO ] Time to serialize gal into /tmp/LTL9548253720446260800.gal : 4 ms
[2025-06-03 01:28:25] [INFO ] Time to serialize properties into /tmp/LTL11703247722038169424.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9548253720446260800.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8739939766492298608.hoa' '-atoms' '/tmp/LTL11703247722038169424.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/LTL11703247722038169424.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8739939766492298608.hoa
Detected timeout of ITS tools.
[2025-06-03 01:28:40] [INFO ] Flatten gal took : 15 ms
[2025-06-03 01:28:40] [INFO ] Flatten gal took : 16 ms
[2025-06-03 01:28:40] [INFO ] Time to serialize gal into /tmp/LTL3095290140320825895.gal : 3 ms
[2025-06-03 01:28:40] [INFO ] Time to serialize properties into /tmp/LTL3673937839498914576.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3095290140320825895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3673937839498914576.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(G(("(c16<=(((out4_0+out4_1)+(out4_7+out4_6))+((out4_3+out4_2)+(out4_5+out4_4))))")||(X(X(X(F("(c19>=1)")))))))))
Formula 0 simplified : XF(!"(c16<=(((out4_0+out4_1)+(out4_7+out4_6))+((out4_3+out4_2)+(out4_5+out4_4))))" & XXXG!"(c19>=1)")
Detected timeout of ITS tools.
[2025-06-03 01:28:55] [INFO ] Flatten gal took : 15 ms
[2025-06-03 01:28:55] [INFO ] Applying decomposition
[2025-06-03 01:28:55] [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/graph3610911360290431414.txt' '-o' '/tmp/graph3610911360290431414.bin' '-w' '/tmp/graph3610911360290431414.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3610911360290431414.bin' '-l' '-1' '-v' '-w' '/tmp/graph3610911360290431414.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:28:55] [INFO ] Decomposing Gal with order
[2025-06-03 01:28:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:28:55] [INFO ] Removed a total of 44 redundant transitions.
[2025-06-03 01:28:55] [INFO ] Flatten gal took : 51 ms
[2025-06-03 01:28:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 3 ms.
[2025-06-03 01:28:55] [INFO ] Time to serialize gal into /tmp/LTL14188166128518853087.gal : 3 ms
[2025-06-03 01:28:55] [INFO ] Time to serialize properties into /tmp/LTL11040737228821935789.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/LTL14188166128518853087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11040737228821935789.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...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gu1.c16<=(((gu1.out4_0+gu1.out4_1)+(gu1.out4_7+gu1.out4_6))+((gu1.out4_3+gu1.out4_2)+(gu1.out4_5+gu1.out4_4))))")||(X(X(X(F(...182
Formula 0 simplified : XF(!"(gu1.c16<=(((gu1.out4_0+gu1.out4_1)+(gu1.out4_7+gu1.out4_6))+((gu1.out4_3+gu1.out4_2)+(gu1.out4_5+gu1.out4_4))))" & XXXG!"(gi1....168
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-20-LTLCardinality-00 finished in 150814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0&&F((p0&&G(p1))))||G((F(p0)&&F(G(p1)))))) U (p2&&X((p2 U (X(p3)||G(p2)))))))'
Support contains 36 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 416/416 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 93 transition count 416
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 85 transition count 372
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 85 transition count 372
Applied a total of 36 rules in 9 ms. Remains 85 /113 variables (removed 28) and now considering 372/416 (removed 44) transitions.
// Phase 1: matrix 372 rows 85 cols
[2025-06-03 01:29:10] [INFO ] Computed 16 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:29:10] [INFO ] Implicit Places using invariants in 62 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/113 places, 372/416 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 84/113 places, 372/416 transitions.
Stuttering acceptance computed with spot in 481 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-01
Stuttering criterion allowed to conclude after 379 steps with 1 reset in 4 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-01 finished in 626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 16 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 416/416 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 93 transition count 416
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 85 transition count 372
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 85 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 75 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 75 transition count 262
Applied a total of 56 rules in 9 ms. Remains 75 /113 variables (removed 38) and now considering 262/416 (removed 154) transitions.
// Phase 1: matrix 262 rows 75 cols
[2025-06-03 01:29:11] [INFO ] Computed 16 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:29:11] [INFO ] Implicit Places using invariants in 65 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/113 places, 262/416 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 74/113 places, 262/416 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-02 finished in 192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0 U X(p1)))||X((p2||F(G(p1))))))))'
Support contains 20 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 416/416 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 93 transition count 416
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 84 transition count 356
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 84 transition count 356
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 77 transition count 244
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 77 transition count 244
Applied a total of 52 rules in 10 ms. Remains 77 /113 variables (removed 36) and now considering 244/416 (removed 172) transitions.
// Phase 1: matrix 244 rows 77 cols
[2025-06-03 01:29:11] [INFO ] Computed 16 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:29:11] [INFO ] Implicit Places using invariants in 74 ms returned [0, 5, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/113 places, 244/416 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 74/113 places, 244/416 transitions.
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-03
Product exploration explored 100000 steps with 25000 reset in 148 ms.
Product exploration explored 100000 steps with 25000 reset in 151 ms.
Computed a total of 74 stabilizing places and 244 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 74 transition count 244
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40046 steps (116 resets) in 75 ms. (526 steps per ms) remains 1/9 properties
BEST_FIRST walk for 4073 steps (0 resets) in 17 ms. (226 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 850 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 20 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 244/244 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 244/244 (removed 0) transitions.
// Phase 1: matrix 244 rows 74 cols
[2025-06-03 01:29:14] [INFO ] Computed 13 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:29:14] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-03 01:29:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:29:14] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2025-06-03 01:29: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/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 244/318 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 87 constraints, problems are : Problem set: 0 solved, 240 unsolved in 7554 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 244/318 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 240/327 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/318 variables, and 327 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37713ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 37714ms
Finished structural reductions in LTL mode , in 1 iterations and 37917 ms. Remains : 74/74 places, 244/244 transitions.
Computed a total of 74 stabilizing places and 244 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 74 transition count 244
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40041 steps (116 resets) in 66 ms. (597 steps per ms) remains 1/9 properties
BEST_FIRST walk for 2728 steps (0 resets) in 9 ms. (272 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p2 p1))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1) p0))), (F (NOT (OR p2 (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 565 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 158 ms.
Product exploration explored 100000 steps with 25000 reset in 164 ms.
Applying partial POR strategy [false, false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 20 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 244/244 transitions.
Graph (complete) has 507 edges and 74 vertex of which 70 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Applied a total of 1 rules in 21 ms. Remains 70 /74 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:29:55] [INFO ] Redundant transitions in 8 ms returned []
Running 236 sub problems to find dead transitions.
// Phase 1: matrix 240 rows 70 cols
[2025-06-03 01:29:55] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 240/310 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/310 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 82 constraints, problems are : Problem set: 0 solved, 236 unsolved in 7032 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 240/310 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 236/318 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 318 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37165ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 37165ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/74 places, 240/244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37202 ms. Remains : 70/74 places, 240/244 transitions.
Built C files in :
/tmp/ltsmin15280690063893089543
[2025-06-03 01:30:32] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15280690063893089543
Running compilation step : cd /tmp/ltsmin15280690063893089543;'/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 408 ms.
Running link step : cd /tmp/ltsmin15280690063893089543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15280690063893089543;'/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/stateBased7098996110640993884.hoa' '--buchi-type=spotba'
LTSmin run took 58 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-20-LTLCardinality-03 finished in 81542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||((p1||X((G(p2) U (p1&&G(p2))))) U p3))))'
Support contains 11 out of 113 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 416/416 transitions.
Graph (complete) has 867 edges and 113 vertex of which 80 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.2 ms
Discarding 33 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 67 transition count 232
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 67 transition count 232
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 29 place count 65 transition count 226
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 65 transition count 226
Applied a total of 31 rules in 18 ms. Remains 65 /113 variables (removed 48) and now considering 226/416 (removed 190) transitions.
// Phase 1: matrix 226 rows 65 cols
[2025-06-03 01:30:32] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:30:33] [INFO ] Implicit Places using invariants in 58 ms returned [0, 20, 31]
[2025-06-03 01:30:33] [INFO ] Actually due to overlaps returned [0, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/113 places, 226/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 63/113 places, 226/416 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p3))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-06
Product exploration explored 100000 steps with 819 reset in 699 ms.
Product exploration explored 100000 steps with 816 reset in 700 ms.
Computed a total of 63 stabilizing places and 226 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 226
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 195 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p3))]
RANDOM walk for 674 steps (0 resets) in 7 ms. (84 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 9 factoid took 346 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p3))]
// Phase 1: matrix 226 rows 63 cols
[2025-06-03 01:30:35] [INFO ] Computed 12 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:30:35] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 6 ms returned sat
[2025-06-03 01:30:35] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-03 01:30:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:30:35] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 4 ms returned sat
[2025-06-03 01:30:35] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-06-03 01:30:35] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 194 transitions) in 21 ms.
[2025-06-03 01:30:35] [INFO ] Added : 20 causal constraints over 5 iterations in 128 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 11 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 226/226 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2025-06-03 01:30:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:30:35] [INFO ] Implicit Places using invariants in 51 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 226/226 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 61 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 61 transition count 224
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 60 transition count 224
Applied a total of 4 rules in 14 ms. Remains 60 /62 variables (removed 2) and now considering 224/226 (removed 2) transitions.
// Phase 1: matrix 224 rows 60 cols
[2025-06-03 01:30:35] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:30:35] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-03 01:30:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:30:35] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/63 places, 224/226 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 60/63 places, 224/226 transitions.
Computed a total of 60 stabilizing places and 224 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 224
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p3))]
RANDOM walk for 672 steps (0 resets) in 6 ms. (96 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 9 factoid took 366 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p3))]
[2025-06-03 01:30:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:30:36] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 3 ms returned sat
[2025-06-03 01:30:36] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-03 01:30:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:30:36] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 5 ms returned sat
[2025-06-03 01:30:36] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-03 01:30:36] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 192 transitions) in 23 ms.
[2025-06-03 01:30:37] [INFO ] Added : 21 causal constraints over 6 iterations in 121 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 571 reset in 666 ms.
Product exploration explored 100000 steps with 576 reset in 689 ms.
Built C files in :
/tmp/ltsmin16079137988655976688
[2025-06-03 01:30:38] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2025-06-03 01:30:38] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:30:38] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2025-06-03 01:30:38] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:30:38] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2025-06-03 01:30:38] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:30:38] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16079137988655976688
Running compilation step : cd /tmp/ltsmin16079137988655976688;'/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 486 ms.
Running link step : cd /tmp/ltsmin16079137988655976688;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16079137988655976688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1874122236028697676.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 11 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 224/224 transitions.
Applied a total of 0 rules in 13 ms. Remains 60 /60 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2025-06-03 01:30:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:30:53] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-03 01:30:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:30:53] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:30:53] [INFO ] Redundant transitions in 3 ms returned []
Running 220 sub problems to find dead transitions.
[2025-06-03 01:30:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 224/284 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/284 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 71 constraints, problems are : Problem set: 0 solved, 220 unsolved in 6182 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 224/284 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 220/291 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 291 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36333ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 36334ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36515 ms. Remains : 60/60 places, 224/224 transitions.
Built C files in :
/tmp/ltsmin10375926399546789548
[2025-06-03 01:31:30] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2025-06-03 01:31:30] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:31:30] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2025-06-03 01:31:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:31:30] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2025-06-03 01:31:30] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:31:30] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10375926399546789548
Running compilation step : cd /tmp/ltsmin10375926399546789548;'/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 489 ms.
Running link step : cd /tmp/ltsmin10375926399546789548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10375926399546789548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16480844073521809302.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 01:31:45] [INFO ] Flatten gal took : 13 ms
[2025-06-03 01:31:45] [INFO ] Flatten gal took : 12 ms
[2025-06-03 01:31:45] [INFO ] Time to serialize gal into /tmp/LTL8122734763885011098.gal : 2 ms
[2025-06-03 01:31:45] [INFO ] Time to serialize properties into /tmp/LTL11642248241999828949.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8122734763885011098.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14992988942600946704.hoa' '-atoms' '/tmp/LTL11642248241999828949.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...319
Loading property file /tmp/LTL11642248241999828949.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14992988942600946704.hoa
Detected timeout of ITS tools.
[2025-06-03 01:32:00] [INFO ] Flatten gal took : 9 ms
[2025-06-03 01:32:00] [INFO ] Flatten gal took : 9 ms
[2025-06-03 01:32:00] [INFO ] Time to serialize gal into /tmp/LTL6891277627746697311.gal : 3 ms
[2025-06-03 01:32:00] [INFO ] Time to serialize properties into /tmp/LTL15505957742709834632.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/LTL6891277627746697311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15505957742709834632.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(("(c13>=3)")||((("(c110>=3)")||(X((G("(c8<=(((aux13_2+aux13_1)+(aux13_0+aux13_7))+((aux13_3+aux13_4)+(aux13_5+aux13_6))))"))U(("(...364
Formula 0 simplified : G(!"(c13>=3)" & ((!"(c110>=3)" & X(!"(c110>=3)" W F!"(c8<=(((aux13_2+aux13_1)+(aux13_0+aux13_7))+((aux13_3+aux13_4)+(aux13_5+aux13_6...264
Detected timeout of ITS tools.
[2025-06-03 01:32:15] [INFO ] Flatten gal took : 12 ms
[2025-06-03 01:32:15] [INFO ] Applying decomposition
[2025-06-03 01:32:15] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7743371540278791499.txt' '-o' '/tmp/graph7743371540278791499.bin' '-w' '/tmp/graph7743371540278791499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7743371540278791499.bin' '-l' '-1' '-v' '-w' '/tmp/graph7743371540278791499.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:32:15] [INFO ] Decomposing Gal with order
[2025-06-03 01:32:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:32:15] [INFO ] Removed a total of 148 redundant transitions.
[2025-06-03 01:32:15] [INFO ] Flatten gal took : 35 ms
[2025-06-03 01:32:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 6 ms.
[2025-06-03 01:32:15] [INFO ] Time to serialize gal into /tmp/LTL10991168781397336566.gal : 2 ms
[2025-06-03 01:32:15] [INFO ] Time to serialize properties into /tmp/LTL4107746817804528552.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/LTL10991168781397336566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4107746817804528552.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(("(gi2.gu1.c13>=3)")||((("(gi2.gu2.c110>=3)")||(X((G("(gu0.c8<=(((gu0.aux13_2+gu0.aux13_1)+(gu0.aux13_0+gu0.aux13_7))+((gu0.aux13...500
Formula 0 simplified : G(!"(gi2.gu1.c13>=3)" & ((!"(gi2.gu2.c110>=3)" & X(!"(gi2.gu2.c110>=3)" W F!"(gu0.c8<=(((gu0.aux13_2+gu0.aux13_1)+(gu0.aux13_0+gu0.a...364
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-20-LTLCardinality-06 finished in 117534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 416/416 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 93 transition count 416
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 34 place count 79 transition count 348
Iterating global reduction 1 with 14 rules applied. Total rules applied 48 place count 79 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 70 place count 57 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 92 place count 57 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 56 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 56 transition count 110
Applied a total of 94 rules in 12 ms. Remains 56 /113 variables (removed 57) and now considering 110/416 (removed 306) transitions.
// Phase 1: matrix 110 rows 56 cols
[2025-06-03 01:32:30] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:32:30] [INFO ] Implicit Places using invariants in 54 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/113 places, 110/416 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 55/113 places, 110/416 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-08 finished in 207 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||X(X(p0))) U p1)))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 416/416 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 95 transition count 416
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 31 place count 82 transition count 348
Iterating global reduction 1 with 13 rules applied. Total rules applied 44 place count 82 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 60 transition count 126
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 60 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 58 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 58 transition count 110
Applied a total of 92 rules in 11 ms. Remains 58 /113 variables (removed 55) and now considering 110/416 (removed 306) transitions.
// Phase 1: matrix 110 rows 58 cols
[2025-06-03 01:32:30] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:32:30] [INFO ] Implicit Places using invariants in 50 ms returned [0, 5, 22, 30]
[2025-06-03 01:32:30] [INFO ] Actually due to overlaps returned [5, 0, 22]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/113 places, 110/416 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 55/113 places, 110/416 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-09 finished in 301 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(p0)||G(p1)||X(G(p2))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 416/416 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 94 transition count 416
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 31 place count 82 transition count 356
Iterating global reduction 1 with 12 rules applied. Total rules applied 43 place count 82 transition count 356
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 63 place count 62 transition count 136
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 62 transition count 136
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 60 transition count 120
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 60 transition count 120
Applied a total of 87 rules in 10 ms. Remains 60 /113 variables (removed 53) and now considering 120/416 (removed 296) transitions.
// Phase 1: matrix 120 rows 60 cols
[2025-06-03 01:32:31] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:32:31] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-03 01:32:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:32:31] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2025-06-03 01:32:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 120/179 variables, 59/75 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 1/180 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 76 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3308 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 120/179 variables, 59/75 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 104/179 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 1/180 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 12/192 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 180/180 variables, and 192 constraints, problems are : Problem set: 0 solved, 116 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33346ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 33347ms
Starting structural reductions in LTL mode, iteration 1 : 60/113 places, 120/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33517 ms. Remains : 60/113 places, 120/416 transitions.
Stuttering acceptance computed with spot in 319 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-10 finished in 33848 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((!p0||G((p1||X(p1))))))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 416/416 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 94 transition count 416
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 33 place count 80 transition count 348
Iterating global reduction 1 with 14 rules applied. Total rules applied 47 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 69 place count 58 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 91 place count 58 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 56 transition count 102
Applied a total of 95 rules in 9 ms. Remains 56 /113 variables (removed 57) and now considering 102/416 (removed 314) transitions.
// Phase 1: matrix 102 rows 56 cols
[2025-06-03 01:33:04] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:33:04] [INFO ] Implicit Places using invariants in 51 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/113 places, 102/416 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 55/113 places, 102/416 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, false, (AND (NOT p1) p0), (NOT p1), false, (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 107 ms.
Product exploration explored 100000 steps with 33333 reset in 130 ms.
Computed a total of 55 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 14 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLCardinality-11 finished in 567 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(F(p0))||G(p1))))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 416/416 transitions.
Graph (complete) has 867 edges and 113 vertex of which 50 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.3 ms
Discarding 63 places :
Also discarding 208 output transitions
Drop transitions (Output transitions of discarded places.) removed 208 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 36 transition count 82
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 36 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 35 place count 30 transition count 46
Iterating global reduction 0 with 6 rules applied. Total rules applied 41 place count 30 transition count 46
Applied a total of 41 rules in 10 ms. Remains 30 /113 variables (removed 83) and now considering 46/416 (removed 370) transitions.
// Phase 1: matrix 46 rows 30 cols
[2025-06-03 01:33:05] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:33:05] [INFO ] Implicit Places using invariants in 33 ms returned [9, 13, 15]
[2025-06-03 01:33:05] [INFO ] Actually due to overlaps returned [13, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/113 places, 46/416 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47 ms. Remains : 28/113 places, 46/416 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-12
Product exploration explored 100000 steps with 594 reset in 260 ms.
Product exploration explored 100000 steps with 601 reset in 281 ms.
Computed a total of 28 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 28 transition count 46
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 389 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 17534 steps (80 resets) in 19 ms. (876 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 569 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 28 cols
[2025-06-03 01:33:07] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:33:07] [INFO ] Implicit Places using invariants in 37 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/28 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43 ms. Remains : 27/28 places, 46/46 transitions.
Computed a total of 27 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 46
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLCardinality-12 finished in 2013 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((p0 U X((p1&&X(F(p0))))))))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 416/416 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 95 transition count 416
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 31 place count 82 transition count 350
Iterating global reduction 1 with 13 rules applied. Total rules applied 44 place count 82 transition count 350
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 60 transition count 120
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 60 transition count 120
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 58 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 58 transition count 104
Applied a total of 92 rules in 9 ms. Remains 58 /113 variables (removed 55) and now considering 104/416 (removed 312) transitions.
// Phase 1: matrix 104 rows 58 cols
[2025-06-03 01:33:07] [INFO ] Computed 16 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:33:07] [INFO ] Implicit Places using invariants in 54 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/113 places, 104/416 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 57/113 places, 104/416 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-13
Stuttering criterion allowed to conclude after 320 steps with 0 reset in 4 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-13 finished in 319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 416/416 transitions.
Graph (complete) has 867 edges and 113 vertex of which 32 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.2 ms
Discarding 81 places :
Also discarding 336 output transitions
Drop transitions (Output transitions of discarded places.) removed 336 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 25 transition count 38
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 25 transition count 38
Applied a total of 15 rules in 6 ms. Remains 25 /113 variables (removed 88) and now considering 38/416 (removed 378) transitions.
// Phase 1: matrix 38 rows 25 cols
[2025-06-03 01:33:07] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:33:07] [INFO ] Implicit Places using invariants in 37 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/113 places, 38/416 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45 ms. Remains : 24/113 places, 38/416 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-14
Product exploration explored 100000 steps with 4592 reset in 220 ms.
Product exploration explored 100000 steps with 4581 reset in 241 ms.
Computed a total of 24 stabilizing places and 38 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 38
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 223 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 588 steps (0 resets) in 5 ms. (98 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 452 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 38/38 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 24 cols
[2025-06-03 01:33:09] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:33:09] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 01:33:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:33:09] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:33:09] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2025-06-03 01:33:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 38/62 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 31 constraints, problems are : Problem set: 0 solved, 34 unsolved in 401 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 38/62 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/62 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 65 constraints, problems are : Problem set: 0 solved, 34 unsolved in 734 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1140ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1140ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1211 ms. Remains : 24/24 places, 38/38 transitions.
Computed a total of 24 stabilizing places and 38 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 38
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 221 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 589 steps (0 resets) in 5 ms. (98 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 436 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4628 reset in 229 ms.
Product exploration explored 100000 steps with 4626 reset in 231 ms.
Built C files in :
/tmp/ltsmin12030348336899786998
[2025-06-03 01:33:11] [INFO ] Computing symmetric may disable matrix : 38 transitions.
[2025-06-03 01:33:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:33:11] [INFO ] Computing symmetric may enable matrix : 38 transitions.
[2025-06-03 01:33:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:33:11] [INFO ] Computing Do-Not-Accords matrix : 38 transitions.
[2025-06-03 01:33:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:33:11] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12030348336899786998
Running compilation step : cd /tmp/ltsmin12030348336899786998;'/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 122 ms.
Running link step : cd /tmp/ltsmin12030348336899786998;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12030348336899786998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8612847955874047420.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 38/38 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2025-06-03 01:33:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:33:26] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-03 01:33:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:33:26] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:33:26] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2025-06-03 01:33:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 38/62 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 31 constraints, problems are : Problem set: 0 solved, 34 unsolved in 375 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 38/62 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/62 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 65 constraints, problems are : Problem set: 0 solved, 34 unsolved in 741 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1126ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1126ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1202 ms. Remains : 24/24 places, 38/38 transitions.
Built C files in :
/tmp/ltsmin13523225468458834675
[2025-06-03 01:33:28] [INFO ] Computing symmetric may disable matrix : 38 transitions.
[2025-06-03 01:33:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:33:28] [INFO ] Computing symmetric may enable matrix : 38 transitions.
[2025-06-03 01:33:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:33:28] [INFO ] Computing Do-Not-Accords matrix : 38 transitions.
[2025-06-03 01:33:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:33:28] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13523225468458834675
Running compilation step : cd /tmp/ltsmin13523225468458834675;'/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 124 ms.
Running link step : cd /tmp/ltsmin13523225468458834675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13523225468458834675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12352436629320474880.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 01:33:43] [INFO ] Flatten gal took : 2 ms
[2025-06-03 01:33:43] [INFO ] Flatten gal took : 1 ms
[2025-06-03 01:33:43] [INFO ] Time to serialize gal into /tmp/LTL2877924914392382909.gal : 1 ms
[2025-06-03 01:33:43] [INFO ] Time to serialize properties into /tmp/LTL10534992799000998598.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2877924914392382909.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2446141147745212621.hoa' '-atoms' '/tmp/LTL10534992799000998598.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/LTL10534992799000998598.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2446141147745212621.hoa
Detected timeout of ITS tools.
[2025-06-03 01:33:58] [INFO ] Flatten gal took : 1 ms
[2025-06-03 01:33:58] [INFO ] Flatten gal took : 1 ms
[2025-06-03 01:33:58] [INFO ] Time to serialize gal into /tmp/LTL15188959473276953257.gal : 1 ms
[2025-06-03 01:33:58] [INFO ] Time to serialize properties into /tmp/LTL3808660009823057652.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/LTL15188959473276953257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3808660009823057652.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(("(c8>=2)")||(G("(c12<2)")))))
Formula 0 simplified : G(!"(c8>=2)" & F!"(c12<2)")
Detected timeout of ITS tools.
[2025-06-03 01:34:13] [INFO ] Flatten gal took : 5 ms
[2025-06-03 01:34:13] [INFO ] Applying decomposition
[2025-06-03 01:34:13] [INFO ] Flatten gal took : 3 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/graph286153985093784196.txt' '-o' '/tmp/graph286153985093784196.bin' '-w' '/tmp/graph286153985093784196.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph286153985093784196.bin' '-l' '-1' '-v' '-w' '/tmp/graph286153985093784196.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:34:13] [INFO ] Decomposing Gal with order
[2025-06-03 01:34:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:34:13] [INFO ] Removed a total of 14 redundant transitions.
[2025-06-03 01:34:13] [INFO ] Flatten gal took : 3 ms
[2025-06-03 01:34:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 0 ms.
[2025-06-03 01:34:13] [INFO ] Time to serialize gal into /tmp/LTL16720793096544288497.gal : 1 ms
[2025-06-03 01:34:13] [INFO ] Time to serialize properties into /tmp/LTL1488952186810669540.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/LTL16720793096544288497.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1488952186810669540.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(("(u1.c8>=2)")||(G("(u0.c12<2)")))))
Formula 0 simplified : G(!"(u1.c8>=2)" & F!"(u0.c12<2)")
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-20-LTLCardinality-14 finished in 80596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&G(F(!p0))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 416/416 transitions.
Graph (complete) has 867 edges and 113 vertex of which 94 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.4 ms
Discarding 19 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 80 transition count 346
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 80 transition count 346
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 50 place count 59 transition count 126
Iterating global reduction 0 with 21 rules applied. Total rules applied 71 place count 59 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 73 place count 57 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 75 place count 57 transition count 110
Applied a total of 75 rules in 15 ms. Remains 57 /113 variables (removed 56) and now considering 110/416 (removed 306) transitions.
// Phase 1: matrix 110 rows 57 cols
[2025-06-03 01:34:28] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:34:28] [INFO ] Implicit Places using invariants in 48 ms returned [0, 7, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/113 places, 110/416 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67 ms. Remains : 54/113 places, 110/416 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) p0), true, (NOT p1), p0, p0]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-15
Stuttering criterion allowed to conclude after 341 steps with 1 reset in 4 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-15 finished in 231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(X(F(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||((p1||X((G(p2) U (p1&&G(p2))))) U p3))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
[2025-06-03 01:34:28] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17992155057558991581
[2025-06-03 01:34:28] [INFO ] Computing symmetric may disable matrix : 416 transitions.
[2025-06-03 01:34:28] [INFO ] Applying decomposition
[2025-06-03 01:34:28] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:34:28] [INFO ] Computing symmetric may enable matrix : 416 transitions.
[2025-06-03 01:34:28] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:34:28] [INFO ] Flatten gal took : 17 ms
[2025-06-03 01:34:28] [INFO ] Computing Do-Not-Accords matrix : 416 transitions.
[2025-06-03 01:34:28] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:34:29] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17992155057558991581
Running compilation step : cd /tmp/ltsmin17992155057558991581;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph4149410665035667967.txt' '-o' '/tmp/graph4149410665035667967.bin' '-w' '/tmp/graph4149410665035667967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4149410665035667967.bin' '-l' '-1' '-v' '-w' '/tmp/graph4149410665035667967.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:34:29] [INFO ] Decomposing Gal with order
[2025-06-03 01:34:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:34:29] [INFO ] Removed a total of 408 redundant transitions.
[2025-06-03 01:34:29] [INFO ] Flatten gal took : 80 ms
[2025-06-03 01:34:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 398 labels/synchronizations in 12 ms.
[2025-06-03 01:34:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality1758526230020215579.gal : 3 ms
[2025-06-03 01:34:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality5354511956994858371.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/LTLCardinality1758526230020215579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5354511956994858371.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...297
Read 3 LTL properties
Checking formula 0 : !((X(G(("(gu2.c16<=(((gu2.out4_0+gu2.out4_1)+(gu2.out4_7+gu2.out4_6))+((gu2.out4_3+gu2.out4_2)+(gu2.out4_5+gu2.out4_4))))")||(X(X(X(F(...182
Formula 0 simplified : XF(!"(gu2.c16<=(((gu2.out4_0+gu2.out4_1)+(gu2.out4_7+gu2.out4_6))+((gu2.out4_3+gu2.out4_2)+(gu2.out4_5+gu2.out4_4))))" & XXXG!"(gi2....168
Compilation finished in 998 ms.
Running link step : cd /tmp/ltsmin17992155057558991581;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17992155057558991581;'/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' 'X([](((LTLAPp0==true)||X(X(X(<>((LTLAPp1==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( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 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( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.021: LTL layer: formula: X([](((LTLAPp0==true)||X(X(X(<>((LTLAPp1==true))))))))
pins2lts-mc-linux64( 3/ 8), 0.021: "X([](((LTLAPp0==true)||X(X(X(<>((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.021: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.040: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.096: DFS-FIFO for weak LTL, using special progress label 425
pins2lts-mc-linux64( 0/ 8), 0.096: There are 426 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.096: State length is 114, there are 422 groups
pins2lts-mc-linux64( 0/ 8), 0.096: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.096: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.096: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.096: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.161: ~1 levels ~960 states ~9096 transitions
pins2lts-mc-linux64( 3/ 8), 0.204: ~1 levels ~1920 states ~18208 transitions
pins2lts-mc-linux64( 5/ 8), 0.271: ~1 levels ~3840 states ~37712 transitions
pins2lts-mc-linux64( 1/ 8), 0.422: ~1 levels ~7680 states ~72176 transitions
pins2lts-mc-linux64( 5/ 8), 0.686: ~1 levels ~15360 states ~166848 transitions
pins2lts-mc-linux64( 2/ 8), 1.054: ~1 levels ~30720 states ~286288 transitions
pins2lts-mc-linux64( 2/ 8), 1.601: ~1 levels ~61440 states ~603256 transitions
pins2lts-mc-linux64( 2/ 8), 2.897: ~1 levels ~122880 states ~1306760 transitions
pins2lts-mc-linux64( 2/ 8), 4.762: ~1 levels ~245760 states ~2708120 transitions
pins2lts-mc-linux64( 2/ 8), 8.082: ~1 levels ~491520 states ~5414368 transitions
pins2lts-mc-linux64( 1/ 8), 15.158: ~1 levels ~983040 states ~11848560 transitions
pins2lts-mc-linux64( 1/ 8), 28.423: ~1 levels ~1966080 states ~23203648 transitions
pins2lts-mc-linux64( 1/ 8), 56.649: ~1 levels ~3932160 states ~48439808 transitions
pins2lts-mc-linux64( 1/ 8), 113.495: ~1 levels ~7864320 states ~98071192 transitions
pins2lts-mc-linux64( 1/ 8), 232.597: ~1 levels ~15728640 states ~203585136 transitions
pins2lts-mc-linux64( 2/ 8), 354.389: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 354.635:
pins2lts-mc-linux64( 0/ 8), 354.635: mean standard work distribution: 5.9% (states) 1.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 354.635:
pins2lts-mc-linux64( 0/ 8), 354.635: Explored 22148648 states 306692870 transitions, fanout: 13.847
pins2lts-mc-linux64( 0/ 8), 354.635: Total exploration time 354.530 sec (354.300 sec minimum, 354.381 sec on average)
pins2lts-mc-linux64( 0/ 8), 354.635: States per second: 62473, Transitions per second: 865069
pins2lts-mc-linux64( 0/ 8), 354.635:
pins2lts-mc-linux64( 0/ 8), 354.635: Progress states detected: 111204263
pins2lts-mc-linux64( 0/ 8), 354.635: Redundant explorations: -80.0829
pins2lts-mc-linux64( 0/ 8), 354.635:
pins2lts-mc-linux64( 0/ 8), 354.635: Queue width: 8B, total height: 136994385, memory: 1045.18MB
pins2lts-mc-linux64( 0/ 8), 354.635: Tree memory: 1104.4MB, 10.4 B/state, compr.: 2.3%
pins2lts-mc-linux64( 0/ 8), 354.635: Tree fill ratio (roots/leafs): 82.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 354.635: Stored 443 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 354.635: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 354.635: Est. total memory use: 2149.6MB (~2069.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17992155057558991581;'/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' 'X([](((LTLAPp0==true)||X(X(X(<>((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17992155057558991581;'/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' 'X([](((LTLAPp0==true)||X(X(X(<>((LTLAPp1==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-03 01:57:25] [INFO ] Flatten gal took : 242 ms
[2025-06-03 01:57:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality7810859670309822466.gal : 46 ms
[2025-06-03 01:57:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality8808308288805546878.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/LTLCardinality7810859670309822466.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8808308288805546878.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...297
Read 3 LTL properties
Checking formula 0 : !((X(G(("(c16<=(((out4_0+out4_1)+(out4_7+out4_6))+((out4_3+out4_2)+(out4_5+out4_4))))")||(X(X(X(F("(c19>=1)")))))))))
Formula 0 simplified : XF(!"(c16<=(((out4_0+out4_1)+(out4_7+out4_6))+((out4_3+out4_2)+(out4_5+out4_4))))" & XXXG!"(c19>=1)")
Detected timeout of ITS tools.
[2025-06-03 02:20:22] [INFO ] Flatten gal took : 287 ms
[2025-06-03 02:20:23] [INFO ] Input system was already deterministic with 416 transitions.
[2025-06-03 02:20:23] [INFO ] Transformed 113 places.
[2025-06-03 02:20:23] [INFO ] Transformed 416 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-03 02:20:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality3908312423445852606.gal : 8 ms
[2025-06-03 02:20:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality3543548531167718775.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/LTLCardinality3908312423445852606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3543548531167718775.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 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(("(c16<=(((out4_0+out4_1)+(out4_7+out4_6))+((out4_3+out4_2)+(out4_5+out4_4))))")||(X(X(X(F("(c19>=1)")))))))))
Formula 0 simplified : XF(!"(c16<=(((out4_0+out4_1)+(out4_7+out4_6))+((out4_3+out4_2)+(out4_5+out4_4))))" & XXXG!"(c19>=1)")
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="PermAdmissibility-PT-20"
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 PermAdmissibility-PT-20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876812800531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-20.tgz
mv PermAdmissibility-PT-20 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 ;