About the Execution of ITS-Tools for Railroad-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 2885515.00 | 0.00 | 0.00 | FTFFFFFFFFTFTTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r170-smll-174889233300100.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 Railroad-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-174889233300100
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 Railroad-PT-050-LTLFireability-00
FORMULA_NAME Railroad-PT-050-LTLFireability-01
FORMULA_NAME Railroad-PT-050-LTLFireability-02
FORMULA_NAME Railroad-PT-050-LTLFireability-03
FORMULA_NAME Railroad-PT-050-LTLFireability-04
FORMULA_NAME Railroad-PT-050-LTLFireability-05
FORMULA_NAME Railroad-PT-050-LTLFireability-06
FORMULA_NAME Railroad-PT-050-LTLFireability-07
FORMULA_NAME Railroad-PT-050-LTLFireability-08
FORMULA_NAME Railroad-PT-050-LTLFireability-09
FORMULA_NAME Railroad-PT-050-LTLFireability-10
FORMULA_NAME Railroad-PT-050-LTLFireability-11
FORMULA_NAME Railroad-PT-050-LTLFireability-12
FORMULA_NAME Railroad-PT-050-LTLFireability-13
FORMULA_NAME Railroad-PT-050-LTLFireability-14
FORMULA_NAME Railroad-PT-050-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748963862023
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 15:17:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 15:17:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 15:17:45] [INFO ] Load time of PNML (sax parser for PT used): 550 ms
[2025-06-03 15:17:45] [INFO ] Transformed 518 places.
[2025-06-03 15:17:45] [INFO ] Transformed 2756 transitions.
[2025-06-03 15:17:45] [INFO ] Found NUPN structural information;
[2025-06-03 15:17:45] [INFO ] Parsed PT model containing 518 places and 2756 transitions and 16378 arcs in 987 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 151 places in 55 ms
Reduce places removed 151 places and 50 transitions.
FORMULA Railroad-PT-050-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 2706/2706 transitions.
Ensure Unique test removed 52 places
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 315 transition count 2706
Applied a total of 52 rules in 91 ms. Remains 315 /367 variables (removed 52) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 315 cols
[2025-06-03 15:17:46] [INFO ] Invariants computation overflowed in 67 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:17:47] [INFO ] Implicit Places using invariants in 1009 ms returned []
// Phase 1: matrix 2706 rows 315 cols
[2025-06-03 15:17:47] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:17:52] [INFO ] Implicit Places using invariants and state equation in 5553 ms returned [0, 1, 6, 7, 8, 11, 12, 17, 18, 19, 24, 25, 26, 29, 35, 137, 138, 144, 145, 146, 148, 149, 151, 156, 157, 159, 163, 164, 165, 167, 168, 170, 172, 175, 228, 231, 235, 245, 246, 247, 248, 252, 265, 269, 271, 273, 275, 277, 278, 279, 281, 291, 294, 301, 302]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 6632 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/367 places, 2706/2706 transitions.
Applied a total of 0 rules in 34 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6780 ms. Remains : 260/367 places, 2706/2706 transitions.
Support contains 45 out of 260 places after structural reductions.
[2025-06-03 15:17:53] [INFO ] Flatten gal took : 577 ms
[2025-06-03 15:17:54] [INFO ] Flatten gal took : 188 ms
[2025-06-03 15:17:54] [INFO ] Input system was already deterministic with 2706 transitions.
Support contains 43 out of 260 places (down from 45) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4081 ms. (9 steps per ms) remains 19/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:17:56] [INFO ] Invariants computation overflowed in 12 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 1693/1725 variables, 32/64 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1725 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 4 (OVERLAPS) 1121/2846 variables, 142/206 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2846 variables, 142/348 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2846/2966 variables, and 348 constraints, problems are : Problem set: 1 solved, 18 unsolved in 5039 ms.
Refiners :[Domain max(s): 174/260 constraints, State Equation: 174/260 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 18 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 1588/1618 variables, 30/60 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1618 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1228/2846 variables, 144/204 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2846 variables, 144/348 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2846 variables, 18/366 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2846/2966 variables, and 366 constraints, problems are : Problem set: 1 solved, 18 unsolved in 5014 ms.
Refiners :[Domain max(s): 174/260 constraints, State Equation: 174/260 constraints, PredecessorRefiner: 18/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10307ms problems are : Problem set: 1 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 4 place count 258 transition count 2668
Deduced a syphon composed of 36 places in 9 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 76 place count 222 transition count 2668
Applied a total of 76 rules in 1274 ms. Remains 222 /260 variables (removed 38) and now considering 2668/2706 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1275 ms. Remains : 222/260 places, 2668/2706 transitions.
RANDOM walk for 40000 steps (8 resets) in 831 ms. (48 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
// Phase 1: matrix 2668 rows 222 cols
[2025-06-03 15:18:08] [INFO ] Invariants computation overflowed in 11 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1345/1370 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1370 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1466/2836 variables, 145/195 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2836 variables, 145/340 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2836 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 54/2890 variables, 52/392 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2890 variables, 52/444 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 15:18:15] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2890 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2890 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/2890 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2890/2890 variables, and 445 constraints, problems are : Problem set: 0 solved, 15 unsolved in 21358 ms.
Refiners :[Domain max(s): 222/222 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1345/1370 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1370 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1466/2836 variables, 145/195 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2836 variables, 145/340 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2836 variables, 15/355 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2836 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 54/2890 variables, 52/407 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2890 variables, 52/459 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2890 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2890 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/2890 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2890/2890 variables, and 460 constraints, problems are : Problem set: 0 solved, 15 unsolved in 42351 ms.
Refiners :[Domain max(s): 222/222 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63842ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 14 properties in 14119 ms.
Support contains 3 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 2668/2668 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 222 transition count 2653
Deduced a syphon composed of 15 places in 5 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 207 transition count 2653
Applied a total of 30 rules in 560 ms. Remains 207 /222 variables (removed 15) and now considering 2653/2668 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 207/222 places, 2653/2668 transitions.
RANDOM walk for 40000 steps (8 resets) in 725 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 514790 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 1
Probabilistic random walk after 514790 steps, saw 451207 distinct states, run finished after 3015 ms. (steps per millisecond=170 ) properties seen :0
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:19:29] [INFO ] Invariants computation overflowed in 16 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/156 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2654/2810 variables, 154/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2810 variables, 154/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2810 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/2860 variables, 50/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2860 variables, 50/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2860 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2860 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2860/2860 variables, and 414 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1693 ms.
Refiners :[Domain max(s): 207/207 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/156 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2654/2810 variables, 154/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2810 variables, 154/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2810 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2810 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 50/2860 variables, 50/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2860 variables, 50/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2860 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2860 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2860/2860 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2985 ms.
Refiners :[Domain max(s): 207/207 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4731ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3785 steps, including 417 resets, run visited all 1 properties in 134 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 157 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Railroad-PT-050-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(p1)||(!p0 U (G((!p0||G(!p2)))||(X(!p3)&&(!p0||G(!p2))))))))'
Support contains 9 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 21 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:19:35] [INFO ] Invariants computation overflowed in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:19:36] [INFO ] Implicit Places using invariants in 664 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:19:36] [INFO ] Invariants computation overflowed in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:19:40] [INFO ] Implicit Places using invariants and state equation in 4154 ms returned []
Implicit Place search using SMT with State Equation took 4823 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:19:40] [INFO ] Invariants computation overflowed in 13 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30152 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30094 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 0/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66535ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 66568ms
Finished structural reductions in LTL mode , in 1 iterations and 71440 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 755 ms :[true, (AND p0 p2 (NOT p1) p3), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p0 p2 p3), (NOT p0), false, false, p2, (AND (NOT p0) p2)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 1205 ms.
Product exploration explored 100000 steps with 33333 reset in 932 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 25 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-050-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-050-LTLFireability-01 finished in 74622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||((F(p1)&&F(p2)) U p3))))'
Support contains 9 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 16 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:20:49] [INFO ] Invariants computation overflowed in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:20:50] [INFO ] Implicit Places using invariants in 397 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:20:50] [INFO ] Invariants computation overflowed in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:20:53] [INFO ] Implicit Places using invariants and state equation in 3271 ms returned []
Implicit Place search using SMT with State Equation took 3676 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:20:53] [INFO ] Invariants computation overflowed in 6 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30071 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30085 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 0/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65324ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 65340ms
Finished structural reductions in LTL mode , in 1 iterations and 69054 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 1254 ms.
Product exploration explored 100000 steps with 0 reset in 991 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p1))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 128 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 923 ms. (43 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:22:02] [INFO ] Invariants computation overflowed in 11 ms
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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 300/305 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2513/2818 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2818 variables, 155/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2818 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 148/2966 variables, 100/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2966 variables, 100/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2966 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2966 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2966/2966 variables, and 520 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1193 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 300/305 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2513/2818 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2818 variables, 155/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2818 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2818 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 148/2966 variables, 100/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2966 variables, 100/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2966 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2966 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2966/2966 variables, and 522 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3713 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4947ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 133 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=16 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 10 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p1))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F p2), (F p3), (F p1), (F (NOT (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 13 factoid took 308 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p3)]
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:22:08] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 15:22:18] [INFO ] [Real]Absence check using state equation in 7225 ms returned sat
[2025-06-03 15:22:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 15:22:24] [INFO ] [Nat]Absence check using state equation in 3468 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 15:22:24] [INFO ] Deduced a trap composed of 3 places in 509 ms of which 27 ms to minimize.
[2025-06-03 15:22:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 607 ms
Proved EG (NOT p1)
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:22:24] [INFO ] Invariants computation overflowed in 6 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 15:22:30] [INFO ] [Real]Absence check using state equation in 3807 ms returned sat
[2025-06-03 15:22:30] [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 15:22:37] [INFO ] [Nat]Absence check using state equation in 3722 ms returned sat
[2025-06-03 15:22:37] [INFO ] Computed and/alt/rep : 155/205/155 causal constraints (skipped 2501 transitions) in 413 ms.
[2025-06-03 15:22:42] [INFO ] Added : 44 causal constraints over 9 iterations in 5405 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:22:42] [INFO ] Invariants computation overflowed in 6 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 15:22:46] [INFO ] [Real]Absence check using state equation in 1081 ms returned sat
[2025-06-03 15:22:46] [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 15:22:50] [INFO ] [Nat]Absence check using state equation in 1684 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 15:22:51] [INFO ] Deduced a trap composed of 3 places in 482 ms of which 13 ms to minimize.
[2025-06-03 15:22:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 541 ms
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p1))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F p2), (F p3), (F p1), (F (NOT (AND (NOT p1) (NOT p3)))), (G (NOT p1)), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 13 factoid took 249 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-050-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-050-LTLFireability-02 finished in 121728 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||X((X(X(F(p1)))||(G(p3)&&p2))))))))'
Support contains 8 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 11 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:22:51] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:22:52] [INFO ] Implicit Places using invariants in 561 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:22:52] [INFO ] Invariants computation overflowed in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:22:55] [INFO ] Implicit Places using invariants and state equation in 3459 ms returned []
Implicit Place search using SMT with State Equation took 4062 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:22:55] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30087 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30092 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 0/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66049ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 66069ms
Finished structural reductions in LTL mode , in 1 iterations and 70150 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 514 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Railroad-PT-050-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 1255 ms.
Product exploration explored 100000 steps with 0 reset in 1152 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 8 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 867 ms. (46 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:24:05] [INFO ] Invariants computation overflowed in 6 ms
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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 491/498 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2322/2820 variables, 154/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2820 variables, 154/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2820 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 146/2966 variables, 99/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2966 variables, 99/520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2966 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2966 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2966/2966 variables, and 520 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1239 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 491/498 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf5 is UNSAT
At refinement iteration 4 (OVERLAPS) 2322/2820 variables, 154/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2820 variables, 154/322 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2820 variables, 2/324 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2820 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 146/2966 variables, 99/423 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2966 variables, 99/522 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2966 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2966 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2966/2966 variables, and 522 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4910 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6175ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 1 properties in 1231 ms.
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 4 place count 258 transition count 2653
Deduced a syphon composed of 51 places in 5 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 106 place count 207 transition count 2653
Applied a total of 106 rules in 690 ms. Remains 207 /260 variables (removed 53) and now considering 2653/2706 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 691 ms. Remains : 207/260 places, 2653/2706 transitions.
RANDOM walk for 40000 steps (8 resets) in 566 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 572216 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 1
Probabilistic random walk after 572216 steps, saw 500413 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:24:16] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 203/206 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2604/2810 variables, 154/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2810 variables, 154/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2810 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/2860 variables, 50/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2860 variables, 50/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2860 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2860 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2860/2860 variables, and 414 constraints, problems are : Problem set: 0 solved, 1 unsolved in 760 ms.
Refiners :[Domain max(s): 207/207 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 203/206 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2604/2810 variables, 154/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2810 variables, 154/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2810 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2810 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 50/2860 variables, 50/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2860 variables, 50/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2860 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2860 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2860/2860 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4263 ms.
Refiners :[Domain max(s): 207/207 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5047ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 345 ms.
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 544 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 544 ms. Remains : 207/207 places, 2653/2653 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 509 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:24:23] [INFO ] Invariants computation overflowed in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:24:23] [INFO ] Implicit Places using invariants in 378 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:24:23] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:24:29] [INFO ] Implicit Places using invariants and state equation in 5802 ms returned []
Implicit Place search using SMT with State Equation took 6182 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:24:29] [INFO ] Redundant transitions in 334 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:24:29] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 157/2860 variables, and 157 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30080 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
SMT process timed out in 65774ms, After SMT, problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 65785ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72843 ms. Remains : 207/207 places, 2653/2653 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 50 Pre rules applied. Total rules applied 0 place count 207 transition count 2603
Deduced a syphon composed of 50 places in 4 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 157 transition count 2603
Applied a total of 100 rules in 69 ms. Remains 157 /207 variables (removed 50) and now considering 2603/2653 (removed 50) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 157 cols
[2025-06-03 15:25:35] [INFO ] Invariants computation overflowed in 9 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 15:25:35] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 15:25:36] [INFO ] After 908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-03 15:25:37] [INFO ] After 1431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 15:25:37] [INFO ] After 1934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2122 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (X (NOT p0))), (G (OR (NOT p2) (NOT p3))), (G (OR (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F p0), (F p1), (F p3), (F (NOT (OR p1 (NOT p3))))]
Knowledge based reduction with 4 factoid took 309 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:25:38] [INFO ] Invariants computation overflowed in 7 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 15:25:41] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2025-06-03 15:25:41] [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 15:25:49] [INFO ] [Nat]Absence check using state equation in 4979 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 15:25:49] [INFO ] Deduced a trap composed of 3 places in 540 ms of which 25 ms to minimize.
[2025-06-03 15:25:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 717 ms
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (X (NOT p0))), (G (OR (NOT p2) (NOT p3))), (G (OR (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F p0), (F p1), (F p3), (F (NOT (OR p1 (NOT p3)))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 4 factoid took 299 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-050-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-050-LTLFireability-03 finished in 178734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 4 place count 258 transition count 2652
Deduced a syphon composed of 52 places in 7 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 108 place count 206 transition count 2652
Applied a total of 108 rules in 1304 ms. Remains 206 /260 variables (removed 54) and now considering 2652/2706 (removed 54) transitions.
// Phase 1: matrix 2652 rows 206 cols
[2025-06-03 15:25:51] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:25:51] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 2652 rows 206 cols
[2025-06-03 15:25:51] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:25:55] [INFO ] Implicit Places using invariants and state equation in 3653 ms returned []
Implicit Place search using SMT with State Equation took 4010 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:25:55] [INFO ] Redundant transitions in 240 ms returned []
Running 2602 sub problems to find dead transitions.
// Phase 1: matrix 2652 rows 206 cols
[2025-06-03 15:25:55] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 2602 unsolved
(s58 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/2858 variables, and 156 constraints, problems are : Problem set: 0 solved, 2602 unsolved in 30081 ms.
Refiners :[Domain max(s): 156/206 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 2602/2602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 2602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 156/2858 variables, and 156 constraints, problems are : Problem set: 0 solved, 2602 unsolved in 30086 ms.
Refiners :[Domain max(s): 156/206 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 0/2602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65408ms problems are : Problem set: 0 solved, 2602 unsolved
Search for dead transitions found 0 dead transitions in 65418ms
Starting structural reductions in SI_LTL mode, iteration 1 : 206/260 places, 2652/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70990 ms. Remains : 206/260 places, 2652/2706 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 1490 ms.
Product exploration explored 100000 steps with 0 reset in 1273 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 494 steps (0 resets) in 13 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 2652/2652 transitions.
Applied a total of 0 rules in 777 ms. Remains 206 /206 variables (removed 0) and now considering 2652/2652 (removed 0) transitions.
// Phase 1: matrix 2652 rows 206 cols
[2025-06-03 15:27:05] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:27:05] [INFO ] Implicit Places using invariants in 396 ms returned []
// Phase 1: matrix 2652 rows 206 cols
[2025-06-03 15:27:05] [INFO ] Invariants computation overflowed in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:27:09] [INFO ] Implicit Places using invariants and state equation in 4008 ms returned []
Implicit Place search using SMT with State Equation took 4412 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:27:09] [INFO ] Redundant transitions in 100 ms returned []
Running 2602 sub problems to find dead transitions.
// Phase 1: matrix 2652 rows 206 cols
[2025-06-03 15:27:09] [INFO ] Invariants computation overflowed in 7 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 2602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/2858 variables, and 156 constraints, problems are : Problem set: 0 solved, 2602 unsolved in 30058 ms.
Refiners :[Domain max(s): 156/206 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 2602/2602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 2602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 156/2858 variables, and 156 constraints, problems are : Problem set: 0 solved, 2602 unsolved in 30048 ms.
Refiners :[Domain max(s): 156/206 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 0/2602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65570ms problems are : Problem set: 0 solved, 2602 unsolved
Search for dead transitions found 0 dead transitions in 65578ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70878 ms. Remains : 206/206 places, 2652/2652 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
RANDOM walk for 611 steps (0 resets) in 19 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1401 ms.
Stack based approach found an accepted trace after 29268 steps with 0 reset with depth 29269 and stack size 21909 in 466 ms.
FORMULA Railroad-PT-050-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-050-LTLFireability-04 finished in 147565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 17 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:28:17] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:28:18] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:28:18] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:28:21] [INFO ] Implicit Places using invariants and state equation in 3413 ms returned []
Implicit Place search using SMT with State Equation took 3900 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:28:21] [INFO ] Invariants computation overflowed in 6 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30060 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30075 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 0/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65327ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 65338ms
Finished structural reductions in LTL mode , in 1 iterations and 69264 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Railroad-PT-050-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 1305 ms.
Product exploration explored 100000 steps with 0 reset in 1154 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 652 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 445223 steps, run timeout after 3004 ms. (steps per millisecond=148 ) properties seen :0 out of 1
Probabilistic random walk after 445223 steps, saw 392004 distinct states, run finished after 3004 ms. (steps per millisecond=148 ) properties seen :0
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:29:33] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 203/206 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2610/2816 variables, 156/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2816 variables, 156/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2816 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 150/2966 variables, 101/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2966 variables, 101/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2966 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2966 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2966/2966 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 852 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 203/206 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2610/2816 variables, 156/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2816 variables, 156/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2816 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2816 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 150/2966 variables, 101/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2966 variables, 101/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2966 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2966 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2966/2966 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2875 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3754ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 103 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:29:37] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 15:29:42] [INFO ] [Real]Absence check using state equation in 2252 ms returned sat
[2025-06-03 15:29:42] [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 15:29:50] [INFO ] [Nat]Absence check using state equation in 5581 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 15:29:50] [INFO ] Deduced a trap composed of 3 places in 597 ms of which 21 ms to minimize.
[2025-06-03 15:29:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 701 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-050-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-050-LTLFireability-05 finished in 92996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 4 place count 258 transition count 2654
Deduced a syphon composed of 50 places in 8 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 104 place count 208 transition count 2654
Applied a total of 104 rules in 1049 ms. Remains 208 /260 variables (removed 52) and now considering 2654/2706 (removed 52) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:29:51] [INFO ] Invariants computation overflowed in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:29:52] [INFO ] Implicit Places using invariants in 568 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:29:52] [INFO ] Invariants computation overflowed in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:29:55] [INFO ] Implicit Places using invariants and state equation in 3210 ms returned []
Implicit Place search using SMT with State Equation took 3782 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:29:55] [INFO ] Redundant transitions in 174 ms returned []
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:29:55] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/2862 variables, and 158 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30077 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/2862 variables, and 158 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30073 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 0/2604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66221ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 66244ms
Starting structural reductions in SI_LTL mode, iteration 1 : 208/260 places, 2654/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71264 ms. Remains : 208/260 places, 2654/2706 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-06
Product exploration explored 100000 steps with 1 reset in 1642 ms.
Stack based approach found an accepted trace after 186 steps with 0 reset with depth 187 and stack size 187 in 3 ms.
FORMULA Railroad-PT-050-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-050-LTLFireability-06 finished in 73141 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||G(p1)))&&(G(p2)||F(p3))))'
Support contains 9 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 11 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:31:04] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:31:04] [INFO ] Implicit Places using invariants in 375 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:31:04] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:31:07] [INFO ] Implicit Places using invariants and state equation in 3197 ms returned []
Implicit Place search using SMT with State Equation took 3574 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:31:07] [INFO ] Invariants computation overflowed in 4 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30051 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30054 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 0/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65509ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 65518ms
Finished structural reductions in LTL mode , in 1 iterations and 69114 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-07
Entered a terminal (fully accepting) state of product in 10636 steps with 1 reset in 114 ms.
FORMULA Railroad-PT-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-050-LTLFireability-07 finished in 69558 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||G(p1))))&&F(p2)))'
Support contains 7 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 20 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:32:13] [INFO ] Invariants computation overflowed in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:32:14] [INFO ] Implicit Places using invariants in 568 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:32:14] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:32:18] [INFO ] Implicit Places using invariants and state equation in 4023 ms returned []
Implicit Place search using SMT with State Equation took 4599 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:32:18] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30080 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30076 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 0/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65237ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 65244ms
Finished structural reductions in LTL mode , in 1 iterations and 69872 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-050-LTLFireability-08 finished in 70131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 4 place count 258 transition count 2653
Deduced a syphon composed of 51 places in 8 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 106 place count 207 transition count 2653
Applied a total of 106 rules in 993 ms. Remains 207 /260 variables (removed 53) and now considering 2653/2706 (removed 53) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:33:24] [INFO ] Invariants computation overflowed in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:33:25] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:33:25] [INFO ] Invariants computation overflowed in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:33:30] [INFO ] Implicit Places using invariants and state equation in 5078 ms returned []
Implicit Place search using SMT with State Equation took 5435 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:33:30] [INFO ] Redundant transitions in 107 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:33:30] [INFO ] Invariants computation overflowed in 6 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 157/2860 variables, and 157 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30100 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 157/2860 variables, and 157 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30074 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 0/2603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65612ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 65619ms
Starting structural reductions in SI_LTL mode, iteration 1 : 207/260 places, 2653/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72170 ms. Remains : 207/260 places, 2653/2706 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 1417 ms.
Stack based approach found an accepted trace after 60 steps with 0 reset with depth 61 and stack size 61 in 2 ms.
FORMULA Railroad-PT-050-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-050-LTLFireability-09 finished in 73692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 4 place count 258 transition count 2653
Deduced a syphon composed of 51 places in 5 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 106 place count 207 transition count 2653
Applied a total of 106 rules in 627 ms. Remains 207 /260 variables (removed 53) and now considering 2653/2706 (removed 53) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:34:38] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:34:38] [INFO ] Implicit Places using invariants in 634 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:34:38] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:34:42] [INFO ] Implicit Places using invariants and state equation in 3653 ms returned []
Implicit Place search using SMT with State Equation took 4297 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:34:42] [INFO ] Redundant transitions in 155 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:34:42] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 157/2860 variables, and 157 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30070 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 157/2860 variables, and 157 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30074 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 0/2603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65562ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 65570ms
Starting structural reductions in SI_LTL mode, iteration 1 : 207/260 places, 2653/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70666 ms. Remains : 207/260 places, 2653/2706 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-13
Product exploration explored 100000 steps with 1 reset in 1485 ms.
Product exploration explored 100000 steps with 1 reset in 1441 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 27875 steps (6 resets) in 527 ms. (52 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 837 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:35:52] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:35:53] [INFO ] Implicit Places using invariants in 597 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:35:53] [INFO ] Invariants computation overflowed in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:35:57] [INFO ] Implicit Places using invariants and state equation in 4011 ms returned []
Implicit Place search using SMT with State Equation took 4610 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:35:57] [INFO ] Redundant transitions in 178 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:35:57] [INFO ] Invariants computation overflowed in 6 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 157/2860 variables, and 157 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30095 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 157/2860 variables, and 157 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30073 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 0/2603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66126ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 66136ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71790 ms. Remains : 207/207 places, 2653/2653 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 31885 steps (7 resets) in 690 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 1332 ms.
Product exploration explored 100000 steps with 1 reset in 1222 ms.
Built C files in :
/tmp/ltsmin3081708523742540614
[2025-06-03 15:37:07] [INFO ] Too many transitions (2653) to apply POR reductions. Disabling POR matrices.
[2025-06-03 15:37:07] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3081708523742540614
Running compilation step : cd /tmp/ltsmin3081708523742540614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3081708523742540614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3081708523742540614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 712 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:37:11] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:37:11] [INFO ] Implicit Places using invariants in 604 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:37:11] [INFO ] Invariants computation overflowed in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:37:15] [INFO ] Implicit Places using invariants and state equation in 3837 ms returned []
Implicit Place search using SMT with State Equation took 4444 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:37:15] [INFO ] Redundant transitions in 174 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2025-06-03 15:37:15] [INFO ] Invariants computation overflowed in 7 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 157/2860 variables, and 157 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30072 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 157/2860 variables, and 157 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30078 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 0/2603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66826ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 66835ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72185 ms. Remains : 207/207 places, 2653/2653 transitions.
Built C files in :
/tmp/ltsmin10409059779849223550
[2025-06-03 15:38:22] [INFO ] Too many transitions (2653) to apply POR reductions. Disabling POR matrices.
[2025-06-03 15:38:22] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10409059779849223550
Running compilation step : cd /tmp/ltsmin10409059779849223550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10409059779849223550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10409059779849223550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 15:38:26] [INFO ] Flatten gal took : 98 ms
[2025-06-03 15:38:26] [INFO ] Flatten gal took : 117 ms
[2025-06-03 15:38:26] [INFO ] Time to serialize gal into /tmp/LTL9897390482290342480.gal : 77 ms
[2025-06-03 15:38:26] [INFO ] Time to serialize properties into /tmp/LTL9493734534991297576.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9897390482290342480.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4089049034205610619.hoa' '-atoms' '/tmp/LTL9493734534991297576.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9493734534991297576.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4089049034205610619.hoa
Detected timeout of ITS tools.
[2025-06-03 15:38:41] [INFO ] Flatten gal took : 86 ms
[2025-06-03 15:38:41] [INFO ] Flatten gal took : 92 ms
[2025-06-03 15:38:41] [INFO ] Time to serialize gal into /tmp/LTL5403515351226648811.gal : 32 ms
[2025-06-03 15:38:41] [INFO ] Time to serialize properties into /tmp/LTL3656196238605553346.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/LTL5403515351226648811.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3656196238605553346.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 : !((G(F("(((pl_P168_16==0)||(pl_P16_30==0))||(pl_P30_1==0))"))))
Formula 0 simplified : FG!"(((pl_P168_16==0)||(pl_P16_30==0))||(pl_P30_1==0))"
Detected timeout of ITS tools.
[2025-06-03 15:38:56] [INFO ] Flatten gal took : 78 ms
[2025-06-03 15:38:56] [INFO ] Applying decomposition
[2025-06-03 15:38:56] [INFO ] Flatten gal took : 81 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/graph6686291907729379976.txt' '-o' '/tmp/graph6686291907729379976.bin' '-w' '/tmp/graph6686291907729379976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6686291907729379976.bin' '-l' '-1' '-v' '-w' '/tmp/graph6686291907729379976.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:38:57] [INFO ] Decomposing Gal with order
[2025-06-03 15:38:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:38:58] [INFO ] Removed a total of 8320 redundant transitions.
[2025-06-03 15:38:58] [INFO ] Flatten gal took : 678 ms
[2025-06-03 15:38:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 148 ms.
[2025-06-03 15:38:58] [INFO ] Time to serialize gal into /tmp/LTL776399865421933550.gal : 24 ms
[2025-06-03 15:38:58] [INFO ] Time to serialize properties into /tmp/LTL8099092980897605061.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL776399865421933550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8099092980897605061.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...253
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i2.u5.pl_P168_16==0)||(u25.pl_P16_30==0))||(i4.i1.u12.pl_P30_1==0))"))))
Formula 0 simplified : FG!"(((i2.u5.pl_P168_16==0)||(u25.pl_P16_30==0))||(i4.i1.u12.pl_P30_1==0))"
Detected timeout of ITS tools.
Treatment of property Railroad-PT-050-LTLFireability-13 finished in 276261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&F(p1)))))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 11 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:39:13] [INFO ] Invariants computation overflowed in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:39:14] [INFO ] Implicit Places using invariants in 520 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:39:14] [INFO ] Invariants computation overflowed in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:39:18] [INFO ] Implicit Places using invariants and state equation in 4125 ms returned []
Implicit Place search using SMT with State Equation took 4649 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:39:18] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30071 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30082 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 0/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65845ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 65853ms
Finished structural reductions in LTL mode , in 1 iterations and 70523 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 1473 ms.
Product exploration explored 100000 steps with 0 reset in 1191 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 30193 steps (6 resets) in 569 ms. (52 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 17 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:40:28] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:40:29] [INFO ] Implicit Places using invariants in 651 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:40:29] [INFO ] Invariants computation overflowed in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:40:33] [INFO ] Implicit Places using invariants and state equation in 3986 ms returned []
Implicit Place search using SMT with State Equation took 4639 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:40:33] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30073 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30073 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 0/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65705ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 65714ms
Finished structural reductions in LTL mode , in 1 iterations and 70380 ms. Remains : 260/260 places, 2706/2706 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 36696 steps (8 resets) in 787 ms. (46 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1236 ms.
Product exploration explored 100000 steps with 0 reset in 1001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2706
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 260 transition count 2706
Deduced a syphon composed of 4 places in 6 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 260 transition count 2706
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 258 transition count 2704
Deduced a syphon composed of 2 places in 5 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 258 transition count 2704
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 7 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 56 place count 258 transition count 2704
Deduced a syphon composed of 50 places in 6 ms
Applied a total of 56 rules in 1000 ms. Remains 258 /260 variables (removed 2) and now considering 2704/2706 (removed 2) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:41:44] [INFO ] Redundant transitions in 96 ms returned []
Running 2654 sub problems to find dead transitions.
// Phase 1: matrix 2704 rows 258 cols
[2025-06-03 15:41:44] [INFO ] Invariants computation overflowed in 6 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/2962 variables, and 0 constraints, problems are : Problem set: 0 solved, 2654 unsolved in 30045 ms.
Refiners :[State Equation: 0/258 constraints, PredecessorRefiner: 2654/2654 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2654 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 208/2962 variables, and 0 constraints, problems are : Problem set: 0 solved, 2654 unsolved in 30071 ms.
Refiners :[State Equation: 0/258 constraints, PredecessorRefiner: 0/2654 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65583ms problems are : Problem set: 0 solved, 2654 unsolved
Search for dead transitions found 0 dead transitions in 65591ms
Starting structural reductions in SI_LTL mode, iteration 1 : 258/260 places, 2704/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66716 ms. Remains : 258/260 places, 2704/2706 transitions.
Built C files in :
/tmp/ltsmin16906236790011539960
[2025-06-03 15:42:50] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16906236790011539960
Running compilation step : cd /tmp/ltsmin16906236790011539960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16906236790011539960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16906236790011539960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 14 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:42:53] [INFO ] Invariants computation overflowed in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:42:53] [INFO ] Implicit Places using invariants in 617 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:42:53] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:42:57] [INFO ] Implicit Places using invariants and state equation in 3370 ms returned []
Implicit Place search using SMT with State Equation took 3999 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2025-06-03 15:42:57] [INFO ] Invariants computation overflowed in 4 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30083 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/2966 variables, and 210 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30083 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 0/260 constraints, PredecessorRefiner: 0/2656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66374ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 66379ms
Finished structural reductions in LTL mode , in 1 iterations and 70399 ms. Remains : 260/260 places, 2706/2706 transitions.
Built C files in :
/tmp/ltsmin3361557840633031344
[2025-06-03 15:44:03] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3361557840633031344
Running compilation step : cd /tmp/ltsmin3361557840633031344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3361557840633031344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3361557840633031344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 15:44:06] [INFO ] Flatten gal took : 188 ms
[2025-06-03 15:44:07] [INFO ] Flatten gal took : 195 ms
[2025-06-03 15:44:07] [INFO ] Time to serialize gal into /tmp/LTL13805506704325090912.gal : 49 ms
[2025-06-03 15:44:07] [INFO ] Time to serialize properties into /tmp/LTL1341055248826177001.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13805506704325090912.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8048255419630789473.hoa' '-atoms' '/tmp/LTL1341055248826177001.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/LTL1341055248826177001.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8048255419630789473.hoa
Detected timeout of ITS tools.
[2025-06-03 15:44:22] [INFO ] Flatten gal took : 169 ms
[2025-06-03 15:44:22] [INFO ] Flatten gal took : 171 ms
[2025-06-03 15:44:22] [INFO ] Time to serialize gal into /tmp/LTL15681287585524958885.gal : 25 ms
[2025-06-03 15:44:22] [INFO ] Time to serialize properties into /tmp/LTL7160391700715943181.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15681287585524958885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7160391700715943181.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((pl_P168_13==0)||(pl_P16_30==0))||(pl_P30_1==0))"))&&(F("(((pl_P168_23==0)||(pl_P16_3==0))||(pl_P30_1==0))"))))))
Formula 0 simplified : XG(F!"(((pl_P168_13==0)||(pl_P16_30==0))||(pl_P30_1==0))" | G!"(((pl_P168_23==0)||(pl_P16_3==0))||(pl_P30_1==0))")
Detected timeout of ITS tools.
[2025-06-03 15:44:37] [INFO ] Flatten gal took : 166 ms
[2025-06-03 15:44:37] [INFO ] Applying decomposition
[2025-06-03 15:44:37] [INFO ] Flatten gal took : 165 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/graph14668925512357886915.txt' '-o' '/tmp/graph14668925512357886915.bin' '-w' '/tmp/graph14668925512357886915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14668925512357886915.bin' '-l' '-1' '-v' '-w' '/tmp/graph14668925512357886915.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:44:38] [INFO ] Decomposing Gal with order
[2025-06-03 15:44:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:44:38] [INFO ] Removed a total of 8167 redundant transitions.
[2025-06-03 15:44:38] [INFO ] Flatten gal took : 204 ms
[2025-06-03 15:44:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 85 ms.
[2025-06-03 15:44:38] [INFO ] Time to serialize gal into /tmp/LTL412543372997649221.gal : 18 ms
[2025-06-03 15:44:38] [INFO ] Time to serialize properties into /tmp/LTL3679640734347544514.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/LTL412543372997649221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3679640734347544514.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...253
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((i0.i0.u1.pl_P168_13==0)||(u57.pl_P16_30==0))||(i0.i0.u1.pl_P30_1==0))"))&&(F("(((i0.i1.u4.pl_P168_23==0)||(u29.pl_P16_3=...191
Formula 0 simplified : XG(F!"(((i0.i0.u1.pl_P168_13==0)||(u57.pl_P16_30==0))||(i0.i0.u1.pl_P30_1==0))" | G!"(((i0.i1.u4.pl_P168_23==0)||(u29.pl_P16_3==0))|...181
Detected timeout of ITS tools.
Treatment of property Railroad-PT-050-LTLFireability-15 finished in 340104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&F(p1)))))'
Found a Shortening insensitive property : Railroad-PT-050-LTLFireability-15
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 4 place count 258 transition count 2654
Deduced a syphon composed of 50 places in 5 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 104 place count 208 transition count 2654
Applied a total of 104 rules in 91 ms. Remains 208 /260 variables (removed 52) and now considering 2654/2706 (removed 52) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:44:54] [INFO ] Invariants computation overflowed in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:44:54] [INFO ] Implicit Places using invariants in 481 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:44:54] [INFO ] Invariants computation overflowed in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:44:58] [INFO ] Implicit Places using invariants and state equation in 3563 ms returned []
Implicit Place search using SMT with State Equation took 4046 ms to find 0 implicit places.
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:44:58] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/2862 variables, and 158 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30046 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
SMT process timed out in 65238ms, After SMT, problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 65247ms
Starting structural reductions in LI_LTL mode, iteration 1 : 208/260 places, 2654/2706 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 69392 ms. Remains : 208/260 places, 2654/2706 transitions.
Running random walk in product with property : Railroad-PT-050-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 1206 ms.
Product exploration explored 100000 steps with 0 reset in 1243 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 131 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 640 ms. (62 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:46:06] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 203/206 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2604/2810 variables, 154/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2810 variables, 154/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2810 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 52/2862 variables, 51/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2862 variables, 51/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2862 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2862 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2862/2862 variables, and 416 constraints, problems are : Problem set: 0 solved, 1 unsolved in 792 ms.
Refiners :[Domain max(s): 208/208 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 203/206 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2604/2810 variables, 154/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2810 variables, 154/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2810 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2810 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 52/2862 variables, 51/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2862 variables, 51/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2862 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2862 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2862/2862 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2993 ms.
Refiners :[Domain max(s): 208/208 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3802ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1391 steps, including 36 resets, run visited all 1 properties in 38 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 39 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 188 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 13 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:46:11] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:46:11] [INFO ] Implicit Places using invariants in 464 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:46:11] [INFO ] Invariants computation overflowed in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:46:15] [INFO ] Implicit Places using invariants and state equation in 3538 ms returned []
Implicit Place search using SMT with State Equation took 4004 ms to find 0 implicit places.
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:46:15] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/2862 variables, and 158 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30077 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
SMT process timed out in 65327ms, After SMT, problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 65334ms
Finished structural reductions in LTL mode , in 1 iterations and 69360 ms. Remains : 208/208 places, 2654/2654 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 133 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 607 ms. (65 steps per ms) remains 1/3 properties
BEST_FIRST walk for 37660 steps (8 resets) in 80 ms. (464 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 190 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1473 ms.
Product exploration explored 100000 steps with 0 reset in 1205 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 914 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 15:47:25] [INFO ] Redundant transitions in 102 ms returned []
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:47:25] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/2862 variables, and 158 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30047 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2812/2862 variables, and 316 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30047 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 0/2604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65081ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 65093ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66121 ms. Remains : 208/208 places, 2654/2654 transitions.
Built C files in :
/tmp/ltsmin15000436868884954423
[2025-06-03 15:48:30] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15000436868884954423
Running compilation step : cd /tmp/ltsmin15000436868884954423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15000436868884954423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15000436868884954423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 13 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:48:33] [INFO ] Invariants computation overflowed in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:48:34] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:48:34] [INFO ] Invariants computation overflowed in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 15:48:37] [INFO ] Implicit Places using invariants and state equation in 3488 ms returned []
Implicit Place search using SMT with State Equation took 3961 ms to find 0 implicit places.
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2025-06-03 15:48:37] [INFO ] Invariants computation overflowed in 4 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/2862 variables, and 158 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30050 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (OVERLAPS) 2654/2812 variables, 158/316 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2812/2862 variables, and 369 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30133 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 53/2604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65917ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 65922ms
Finished structural reductions in LTL mode , in 1 iterations and 69899 ms. Remains : 208/208 places, 2654/2654 transitions.
Built C files in :
/tmp/ltsmin2591978066621380896
[2025-06-03 15:49:43] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2591978066621380896
Running compilation step : cd /tmp/ltsmin2591978066621380896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2591978066621380896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2591978066621380896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 15:49:47] [INFO ] Flatten gal took : 67 ms
[2025-06-03 15:49:47] [INFO ] Flatten gal took : 70 ms
[2025-06-03 15:49:47] [INFO ] Time to serialize gal into /tmp/LTL2419652897146224264.gal : 39 ms
[2025-06-03 15:49:47] [INFO ] Time to serialize properties into /tmp/LTL1432679991263121436.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/LTL2419652897146224264.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8427497424571111860.hoa' '-atoms' '/tmp/LTL1432679991263121436.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1432679991263121436.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8427497424571111860.hoa
Detected timeout of ITS tools.
[2025-06-03 15:50:02] [INFO ] Flatten gal took : 68 ms
[2025-06-03 15:50:02] [INFO ] Flatten gal took : 73 ms
[2025-06-03 15:50:02] [INFO ] Time to serialize gal into /tmp/LTL6162819087345909498.gal : 16 ms
[2025-06-03 15:50:02] [INFO ] Time to serialize properties into /tmp/LTL13595434045856300649.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6162819087345909498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13595434045856300649.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((pl_P168_13==0)||(pl_P16_30==0))||(pl_P30_1==0))"))&&(F("(((pl_P168_23==0)||(pl_P16_3==0))||(pl_P30_1==0))"))))))
Formula 0 simplified : XG(F!"(((pl_P168_13==0)||(pl_P16_30==0))||(pl_P30_1==0))" | G!"(((pl_P168_23==0)||(pl_P16_3==0))||(pl_P30_1==0))")
Detected timeout of ITS tools.
[2025-06-03 15:50:17] [INFO ] Flatten gal took : 142 ms
[2025-06-03 15:50:17] [INFO ] Applying decomposition
[2025-06-03 15:50:17] [INFO ] Flatten gal took : 108 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/graph14455226363419143841.txt' '-o' '/tmp/graph14455226363419143841.bin' '-w' '/tmp/graph14455226363419143841.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14455226363419143841.bin' '-l' '-1' '-v' '-w' '/tmp/graph14455226363419143841.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:50:17] [INFO ] Decomposing Gal with order
[2025-06-03 15:50:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:50:18] [INFO ] Removed a total of 8218 redundant transitions.
[2025-06-03 15:50:18] [INFO ] Flatten gal took : 247 ms
[2025-06-03 15:50:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 91 ms.
[2025-06-03 15:50:18] [INFO ] Time to serialize gal into /tmp/LTL9157879776188143848.gal : 20 ms
[2025-06-03 15:50:18] [INFO ] Time to serialize properties into /tmp/LTL8600648311694351830.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/LTL9157879776188143848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8600648311694351830.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((i2.i1.u3.pl_P168_13==0)||(u24.pl_P16_30==0))||(i2.i0.u7.pl_P30_1==0))"))&&(F("(((i4.u9.pl_P168_23==0)||(u23.pl_P16_3==0)...188
Formula 0 simplified : XG(F!"(((i2.i1.u3.pl_P168_13==0)||(u24.pl_P16_30==0))||(i2.i0.u7.pl_P30_1==0))" | G!"(((i4.u9.pl_P168_23==0)||(u23.pl_P16_3==0))||(i...178
Detected timeout of ITS tools.
Treatment of property Railroad-PT-050-LTLFireability-15 finished in 339628 ms.
[2025-06-03 15:50:33] [INFO ] Flatten gal took : 162 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18048411941560258768
[2025-06-03 15:50:33] [INFO ] Too many transitions (2706) to apply POR reductions. Disabling POR matrices.
[2025-06-03 15:50:33] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18048411941560258768
Running compilation step : cd /tmp/ltsmin18048411941560258768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 15:50:33] [INFO ] Applying decomposition
[2025-06-03 15:50:34] [INFO ] Flatten gal took : 164 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/graph15171800915604273045.txt' '-o' '/tmp/graph15171800915604273045.bin' '-w' '/tmp/graph15171800915604273045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15171800915604273045.bin' '-l' '-1' '-v' '-w' '/tmp/graph15171800915604273045.weights' '-q' '0' '-e' '0.001'
[2025-06-03 15:50:34] [INFO ] Decomposing Gal with order
[2025-06-03 15:50:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 15:50:34] [INFO ] Removed a total of 8219 redundant transitions.
[2025-06-03 15:50:34] [INFO ] Flatten gal took : 202 ms
[2025-06-03 15:50:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 66 ms.
[2025-06-03 15:50:34] [INFO ] Time to serialize gal into /tmp/LTLFireability11445162345488789665.gal : 14 ms
[2025-06-03 15:50:34] [INFO ] Time to serialize properties into /tmp/LTLFireability1161065459698965083.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11445162345488789665.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1161065459698965083.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...277
Read 2 LTL properties
Checking formula 0 : !((G(F("(((i0.u5.pl_P168_16==0)||(u32.pl_P16_30==0))||(i3.i1.u11.pl_P30_1==0))"))))
Formula 0 simplified : FG!"(((i0.u5.pl_P168_16==0)||(u32.pl_P16_30==0))||(i3.i1.u11.pl_P30_1==0))"
Compilation finished in 11351 ms.
Running link step : cd /tmp/ltsmin18048411941560258768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin18048411941560258768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t20, t21, t22, t24, t26, t29, t30, t32, t34, t35, t36, t39, t42, t44, t45, t47, t48...333
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3316 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,33.3563,894412,1,0,2.47382e+06,1287,16579,1.59975e+06,316,2310,4757677
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Railroad-PT-050-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F((G("(((i3.i0.u3.pl_P168_13==0)||(u32.pl_P16_30==0))||(i3.i1.u11.pl_P30_1==0))"))&&(F("(((i1.u8.pl_P168_23==0)||(u63.pl_P16_3==0...190
Formula 1 simplified : XG(F!"(((i3.i0.u3.pl_P168_13==0)||(u32.pl_P16_30==0))||(i3.i1.u11.pl_P30_1==0))" | G!"(((i1.u8.pl_P168_23==0)||(u63.pl_P16_3==0))||(...180
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin18048411941560258768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18048411941560258768;'/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(<>(([]((LTLAPp1==true))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 1393 ms.
FORMULA Railroad-PT-050-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2882859 ms.
BK_STOP 1748966747538
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="Railroad-PT-050"
export BK_EXAMINATION="LTLFireability"
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 Railroad-PT-050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-174889233300100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Railroad-PT-050.tgz
mv Railroad-PT-050 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;